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 -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
Graph partitioning using genetic algorithms with ODPX
CUTELLO, Vincenzo;PAVONE, MARIO FRANCESCO
2002-01-01
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 -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 algorithmFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.