An Application of Ant Colony Optimization Algorithm in TSP

Author

Yuanyuan, Lin ; Jing, Zhang

Author_Institution

Training Center of Comput. & Language, Tianjin Univ. of Technol. & Educ., Tianjin, China

fYear

2012

fDate

1-3 Nov. 2012

Firstpage

61

Lastpage

64

Abstract

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.

Keywords

ant colony optimisation; computational complexity; travelling salesman problems; 2-opt strategy; ACA; NP problem; TSP problems; adjacent edge adjustment; ant colony optimization algorithm; mathematical model; node selection; optimization methods; pheromone updating; piecewise function control; smooth elitist strategy; travelling salesman problem; Algorithm design and analysis; Ant colony optimization; Cities and towns; Convergence; Educational institutions; Mathematical model; Traveling salesman problems; 2-opt strategy; Ant colony algorithm; TSP; node selection; smooth elitist strategy;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Tianjin

Print_ISBN

978-1-4673-3083-1

Type

conf

DOI

10.1109/ICINIS.2012.20

Filename

6376485