DocumentCode
2123975
Title
An Improvement of the Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem (TSP)
Author
Li, Tiankun ; Chen, Wanzhong ; Zheng, Xin ; Zhang, Zhuo
Author_Institution
Coll. of Commun. Eng., Jilin Univ., Changchun, China
fYear
2009
fDate
24-26 Sept. 2009
Firstpage
1
Lastpage
3
Abstract
The ant colony optimization algorithm usually falls into local optimal solution and can not select the path with high pheromone concentration quickly in solving the TSP. According to this, in this paper an improved max-min ant system (MMAS) algorithm based on pheromone concentration reinitialization is proposed to overcome the shortcoming above. The simulation results show that the improved algorithm can obtain the optimal solution of TSP, and speed up convergence.
Keywords
minimax techniques; travelling salesman problems; ant colony optimization algorithm; max-min ant system algorithm; pheromone concentration reinitialization; travelling salesman problem; Ant colony optimization; Cities and towns; Costs; Educational institutions; Simulated annealing; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-3692-7
Electronic_ISBN
978-1-4244-3693-4
Type
conf
DOI
10.1109/WICOM.2009.5302937
Filename
5302937
Link To Document