Solving graph partitioning problem using genetic algorithms

The graph partitioning problem (GPP) is one of the fundamental multimodal, combinatorial problems that has many applications in computer science. Many deterministic algorithms have been devised to obtain a good solution for the GPP. This paper presents new techniques for discovering more than one so...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Circuits and Systems; Proceedings: Midwest Symposium on Circuits and Systems s. 302 - 305
Hlavní autori: Shazely, S., Baraka, H., Abdel-Wahab, A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1998
Predmet:
Application software
Computer science
Design optimization
Genetic algorithms
Joining processes
Parallel programming
Partitioning algorithms
Performance analysis
Scientific computing
Very large scale integration
ISBN:9780818689147, 0818689145
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The graph partitioning problem (GPP) is one of the fundamental multimodal, combinatorial problems that has many applications in computer science. Many deterministic algorithms have been devised to obtain a good solution for the GPP. This paper presents new techniques for discovering more than one solution to this problem using genetic algorithms. The techniques used are based upon applying niching methods to obtain multiple good solutions instead of only one solution. The paper also presents in detail a comparison between the results of a traditional method, simple genetic algorithm (SGA), and two niching methods, fitness sharing and deterministic crowding when applied to the graph partitioning problem.
AbstractList The graph partitioning problem (GPP) is one of the fundamental multimodal, combinatorial problems that has many applications in computer science. Many deterministic algorithms have been devised to obtain a good solution for the GPP. This paper presents new techniques for discovering more than one solution to this problem using genetic algorithms. The techniques used are based upon applying niching methods to obtain multiple good solutions instead of only one solution. The paper also presents in detail a comparison between the results of a traditional method, simple genetic algorithm (SGA), and two niching methods, fitness sharing and deterministic crowding when applied to the graph partitioning problem.
Author Shazely, S.
Abdel-Wahab, A.
Baraka, H.
Author_xml – sequence: 1
  givenname: S.
  surname: Shazely
  fullname: Shazely, S.
  organization: Fac. of Eng., Cairo Univ., Giza, Egypt
– sequence: 2
  givenname: H.
  surname: Baraka
  fullname: Baraka, H.
– sequence: 3
  givenname: A.
  surname: Abdel-Wahab
  fullname: Abdel-Wahab, A.
BookMark eNotj9tKxDAURQMqqGN_YJ76A61J00xy8Gko3mDEhyo-DifpSSfSG2kV_Hsv437ZsNgs2JfsdBgHYmwteC4Eh-unt7ra1rkAMLlWUEJxwhLQhhthNgZEqc9ZMs_v_CelKjiXF-ymHrvPMLRpG3E6pBPGJSxhHH7RFEfbUZ9-zH8DGmgJLsWuHWNYDv18xc48djMl_71ir3e3L9VDtnu-f6y2uywIXS6ZtdYVxnhsFIEoUAFK0zjwRmqS1nNTusZ78AK5aKwjVMIb5Gh1s1FOyhVbH72BiPZTDD3Gr_3xofwGzadK-w
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/MWSCAS.1998.759492
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 305
ExternalDocumentID 759492
GroupedDBID 6IE
6IH
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
RIO
ID FETCH-LOGICAL-i174t-bbbc288fad5e912a59a38dc9f837e3bf084cdff9f1a01dbcea51f8a0ab7d65c33
IEDL.DBID RIE
ISBN 9780818689147
0818689145
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000079563200068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 17:57:35 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i174t-bbbc288fad5e912a59a38dc9f837e3bf084cdff9f1a01dbcea51f8a0ab7d65c33
PageCount 4
ParticipantIDs ieee_primary_759492
PublicationCentury 1900
PublicationDate 19980000
PublicationDateYYYYMMDD 1998-01-01
PublicationDate_xml – year: 1998
  text: 19980000
PublicationDecade 1990
PublicationTitle Circuits and Systems; Proceedings: Midwest Symposium on Circuits and Systems
PublicationTitleAbbrev MWSCAS
PublicationYear 1998
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000452003
Score 1.4674236
Snippet The graph partitioning problem (GPP) is one of the fundamental multimodal, combinatorial problems that has many applications in computer science. Many...
SourceID ieee
SourceType Publisher
StartPage 302
SubjectTerms Application software
Computer science
Design optimization
Genetic algorithms
Joining processes
Parallel programming
Partitioning algorithms
Performance analysis
Scientific computing
Very large scale integration
Title Solving graph partitioning problem using genetic algorithms
URI https://ieeexplore.ieee.org/document/759492
WOSCitedRecordID wos000079563200068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmAqlCIoD3lgTZuHHdtiQhUVA1SVyqNb5ddBpdJUbcrvx3bSIiQWFiuOIiu63J2TL_d9h9AN5KAhBhnpnEFEqBs4IyKySmbEuldgHjDd10c2HPLJRIxqne3AhbHWhuIz2_WH4V--KfTGQ2U9RgURLt_uM5ZXVK0dnOKVwZ2DBoVHrwAvEkJrfZ3tnG05M7HoPb2N-3djT9Xj3WrVX91VwuYyaP7rto5Q-4ekh0e77ecY7dlFCzW3XRpwHbQn6HZczD1qgIM2NV56X6lRWFy3k8G--t1d4PKe8yMs5-_FalZ-fK7b6GVw_9x_iOqWCdHM2bWMlFI65RykoVYkqaRCZtxoAe471GYKYk60ARCQyDgxSltJE-AyloqZnOosO0WNRbGwZ57MTagxqaAgU-JWUakLVaq0JIILMOYctbwppstKFWNaWaHz59kLdFhx-Tx0cYka5Wpjr9CB_ipn69V1eJLf4y2eMw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4YNdETihjf7sFroY9duhtPhkgwAiEBlRvZ1ygJUgLF3-_utmBMvHjZdJtm00xnZtuv832D0B00QUEIIlDNFAJC7cBSwgMjRUKMfQVmHtN97ab9PhuP-aDU2fZcGGOMLz4zdXfo_-XrTK0dVNZIKSfc5ts9SkgcFmStLaDitMGti3qNR6cBzyNCS4WdzTzdsGZC3ui9DVsPQ0fWY_Vi3V_9Vfz20q7868aOUO2HpocH2w3oGO2YeRVVNn0acBm2J-h-mM0cboC9OjVeOG8pcVhcNpTBrv7dXmAzn_UkLGbv2XKaf3yuauil_ThqdYKyaUIwtZbNAymlihkDoanhUSwoFwnTioP9EjWJhJARpQE4RCKMtFRG0AiYCIVMdZOqJDlFu_Nsbs4cnZtQrWNOQcTEriJjG6xUKkE446D1Oao6U0wWhS7GpLDCxZ9nb9FBZ9TrTrpP_edLdFgw-xyQcYV28-XaXKN99ZVPV8sb_1S_AU40oXo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Circuits+and+Systems%3B+Proceedings%3A+Midwest+Symposium+on+Circuits+and+Systems&rft.atitle=Solving+graph+partitioning+problem+using+genetic+algorithms&rft.au=Shazely%2C+S.&rft.au=Baraka%2C+H.&rft.au=Abdel-Wahab%2C+A.&rft.date=1998-01-01&rft.pub=IEEE&rft.isbn=9780818689147&rft.spage=302&rft.epage=305&rft_id=info:doi/10.1109%2FMWSCAS.1998.759492&rft.externalDocID=759492
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818689147/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818689147/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818689147/sc.gif&client=summon&freeimage=true