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ženo v:
Podrobná bibliografie
Vydáno v:Circuits and Systems; Proceedings: Midwest Symposium on Circuits and Systems s. 302 - 305
Hlavní autoři: Shazely, S., Baraka, H., Abdel-Wahab, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1998
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9780818689147
0818689145
DOI:10.1109/MWSCAS.1998.759492