By Topic

Criteria for designing crossovers for TSP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nagata, Y. ; Graduate Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan

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.

Published in:

Evolutionary Computation, 2004. CEC2004. Congress on  (Volume:2 )

Date of Conference:

19-23 June 2004