DocumentCode
3398978
Title
Criteria for designing crossovers for TSP
Author
Nagata, Yuichi
Author_Institution
Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan
Volume
2
fYear
2004
fDate
19-23 June 2004
Firstpage
1465
Abstract
This work proposes criteria for designing crossovers for genetic algorithms (GAs) used to solve traveling salesman problems (TSPs). These criteria are [1] that the ratio at which new edges are introduced into offspring by crossovers should be adjusted appropriately and [2] that the quality of the new edges should be high. The validity of these criteria is demonstrated by comparing several crossovers that were designed for TSP with regard to these criteria. Experimental results indicate that the performances of GAs using some previously proposed crossovers can be explained by considering these criteria. Furthermore, experiments with a new crossover designed by modifying a very simple crossover called edge recombination (EX) in accordance with these criteria demonstrate that the performance of the GA using this modified crossover is improved dramatically.
Keywords
genetic algorithms; travelling salesman problems; TSP; crossover design; edge recombination; genetic algorithms; traveling salesman problems; Algorithm design and analysis; Assembly; Design optimization; Genetic algorithms; Genetic mutations; Paper technology; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1331069
Filename
1331069
Link To Document