By Topic

Improved Ant Colony Algorithm and its Applications in 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

3 Author(s)
Xuemei Song ; Comput. & Autom. Control Sch., Hebei Polytech. Univ., Tangshan ; Bing Li ; Hongmei Yang

In the fields of ant colony optimization (ACO), models of collective intelligence of ants are transformed into useful optimization techniques. A kind of improved ACO (named PMACO) approach for traveling salesman problems (TSP) is presented. Aimed at the disadvantages existed in ACO, several new betterments are proposed and evaluated. In particular, the option that an ant hunts for the next step, the use of a combination of two kinds of pheromone evaluation models, the change of amount in the ant colony during the run of the algorithm, and the mutation of pheromone are studied. We tested ACO algorithm on a set of benchmark problems from the traveling salesman problem library. It performed better than the original and the other improved ACO algorithms

Published in:

Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on  (Volume:2 )

Date of Conference:

16-18 Oct. 2006