Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

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

Dong-Il SeoContact Information and Byung-Ro MoonContact Information

(5)  School of Computer Science & Engineering, Seoul National University, Sillim-dong, Kwanak-gu, Seoul, 151-742, Korea
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.

Contact Information Dong-Il Seo
Email: diseo@soar.snu.ac.kr
URL: http://soar.snu.ac.kr/~diseo

Contact Information Byung-Ro Moon
Email: moon@soar.snu.ac.kr
URL: http://soar.snu.ac.kr/~moon
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)