Issue: 2003/Vol.13/No.3, Pages 91-107
K-PARTITIONING OF GRAPH BY MEANS OF EVOLUTIONARY ALGORITHM
Józef Wojnarowski, Stanisław Zawiślak
, Szymon Kozik, Grzegorz Frej
Cite as: J. Wojnarowski, S. Zawiślak, S. Kozik, G. Frej. K-partitioning of graph by means of evolutionary algorithm. Operations Research and Decisions 2003: 13(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
Received: Accepted: