Research and improvement of ant colony algorithm based on TSP

Author

Ling Lin ; Huailin Dong ; Qingfeng Wu ; Tianmao Xu

Author_Institution

Software Sch., Xiamen Univ., Xiamen, China

Volume

2

fYear

2011

fDate

20-22 Aug. 2011

Firstpage

453

Lastpage

456

Abstract

Ant colony algorithm is a new algorithm of heuristic bionic calculation. Now, it has been widely applied in many fields of combinatorial optimization. This paper elaborates the basic principle and mathematical model of typical ant colony algorithm for solving the traveling salesman problem, and analyzes impact of the optimal parameters to the performance of algorithm. Based on its shortages, an improved algorithm by dynamically adjusting parameters is proposed. Finally, the paper gives the simulation result, and it indicates the improved algorithm has a better performance.

Keywords

biomimetics; travelling salesman problems; TSP; ant colony algorithm; combinatorial optimization; dynamically adjusting parameters; mathematical model; metaheuristic bionic algorithm; traveling salesman problem; Algorithm design and analysis; Cities and towns; Convergence; Heuristic algorithms; Optimization; Software algorithms; Wheels; ant colony algorithm; dynamically adjust parameters; traveling salesman problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology and Artificial Intelligence Conference (ITAIC), 2011 6th IEEE Joint International

Conference_Location

Chongqing

Print_ISBN

978-1-4244-8622-9

Type

conf

DOI

10.1109/ITAIC.2011.6030371

Filename

6030371