K-partitioning of graph by means of evolutionary algorithm

Józef Wojnarowski, Stanisław Zawiślak (), Szymon Kozik and Grzegorz Frej

Operations Research and Decisions, 2003, vol. 13, issue 3, 91-107

Abstract: The problem of graph k-partitioning has been considered in the paper. The versatile interpretations of this problem have been listed. Besides some heuristic methods described in references, the evolutionary approach was proposed. It is the generalisation of the problem of graph bisection. The plain evolutionary algorithms are not so robust in this caselike for the bisection one. New genetic operations were considered which improve the behaviour of the computer program written based on the proposed algorithm. The results of analysis are enclosed.

Keywords: graph k-partitioning; heuristic method; evolutionary algorithm (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/0200336%20-%20published.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:3:y:2003:p:6

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().