 |
    |
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Dong-Il Seo and Byung-Ro Moon
School of Computer Science & Engineering,
Seoul National University
Sillim-dong, Kwanak-gu,
Seoul, 151-742 Korea
{diseo,moon}@soar.snu.ac.kr
http://soar.snu.ac.kr{~diseo,moon}
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment and the reproducibility of building blocks. For decades, various chromosomal structures and crossover operators were proposed for the purpose. In this paper, we use Voronoi quantized crossover that adopts complete graph representation. It showed remarkable improvement in comparison with state-of-the-art genetic algorithms.
LNCS 2723, p. 669 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003