By Topic

A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

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

2 Author(s)
Shyi-Ming Chen ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Chih-Yao Chien

In this paper, we present a new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. We also make experiments using the 25 data sets obtained from the TSPLIB and compare the experimental results of the proposed method with the existing methods. The experimental results show that both the average solution and the percentage deviation of the found average solution to the best known solution of the proposed method are better than the existing methods.

Published in:

Machine Learning and Cybernetics (ICMLC), 2010 International Conference on  (Volume:5 )

Date of Conference:

11-14 July 2010