By Topic

Solving the traveling salesman problem through genetic algorithms with changing crossover operators

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)
Takahashi, R. ; Hachinohe Inst. of Technol., Hachinohe Aomori, Japan

In order to solve the traveling salesman problem (TSP) through genetic algorithms (GAs), a method of changing crossover operators (CXO), which can flexibly substitute the current crossover operator for another suitable crossover operator at any time, is proposed. This paper reports experimental validation of CXO through C software by using data of 200 cities.

Published in:

Machine Learning and Applications, 2005. Proceedings. Fourth International Conference on

Date of Conference:

15-17 Dec. 2005