Abstract:
In this paper, we study approximate solutions to the extension of the "maximally balanced connected partition problem", whose corresponding decision problem is known to b...Show MoreMetadata
Abstract:
In this paper, we study approximate solutions to the extension of the "maximally balanced connected partition problem", whose corresponding decision problem is known to be /spl Nscr//spl Pscr/-complete. We introduce a genetic algorithm with a new crossover operator, called the "order- and distance-preserving crossover" (ODPX) operator, and we compare the results of our algorithm to a well-known deterministic approximation algorithm.
Published in: Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
Date of Conference: 12-17 May 2002
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7803-7282-4