By Topic

An Application of Ant Colony Optimization Algorithm 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

2 Author(s)
Lin Yuanyuan ; Training Center of Comput. & Language, Tianjin Univ. of Technol. & Educ., Tianjin, China ; Zhang Jing

This paper has made a detailed analysis of the Ant Colony Algorithm and its parameters, integrated the algorithm with the TSP problems and put forward such optimization methods as the node selection by means of piecewise function control, the pheromone updating by means of smooth elitist strategy and the adjacent edge adjustment in the global optimal solution by means of the 2-opt strategy. The mathematical model of ant colony optimization algorithm has been proposed on the basis of the analysis to solve the TSP problems and the results of simulation indicate this algorithm has a quite good performance.

Published in:

Intelligent Networks and Intelligent Systems (ICINIS), 2012 Fifth International Conference on

Date of Conference:

1-3 Nov. 2012