By Topic

A new method for handling the traveling salesman problem based on parallelized genetic ant colony systems

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)
Chih-Yao Chien ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Shyi-Ming Chen

In this paper, we present a new method for handling the traveling salesman problem, called the parallelized genetic ant colony systems (PGACS). The proposed method combines genetic algorithms with new crossover operations, hybrid mutation operations and ant colony systems with communication strategies. We also make an experiment using three well-known data sets of the traveling salesman problem. The experiment results show that the performance of the proposed method is better than the method presented in in both the result and the convergence time.

Published in:

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

Date of Conference:

12-15 July 2009