A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem

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.

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: Dong-il Seo, Byung Ro Moon
• Keywords: GECCO 2003, Genetic Algorithms, Hybrid Genetic Algorithm, Voronoi Quantized Crossover