Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (24): 51-52.DOI: 10.3778/j.issn.1002-8331.2010.24.016

• 研究、探讨 • Previous Articles     Next Articles

Improved ant colony algorithm and its application in TSP

ZAHO Ji-dong,HU Xiao-bing,LIU Hao-bin   

  1. School of Mathematics & Physics,Chongqing University,Chongqing 400030,China
  • Received:2009-02-26 Revised:2009-04-24 Online:2010-08-21 Published:2010-08-21
  • Contact: ZAHO Ji-dong

改进的蚁群算法及其在TSP中的应用

赵吉东,胡小兵,刘好斌   

  1. 重庆大学 数理学院,重庆 400030
  • 通讯作者: 赵吉东

Abstract: Ant algorithm is a meta-heuristic optimization algorithm.The study has showed that the algorithm has great ability of searching better solution,but at the same time there are some shortcomings.By using the properties of pheromone update of ant colony algorithm,a new method of updating pheromone is introduced,and used to solve the Traveling Salesman Problem(TSP).Simulation experiments show that the new algorithm has better performance.

Key words: ant colony algorithm, pheromone update, Traveling Salesman Problem(TSP)

摘要: 蚂蚁算法是一种元启发式优化算法,研究表明其具有较强的发现较好解的能力,但是也存在一些不足。根据蚂蚁算法的信息素更新的特性,提出了一种信息素更新的新方法,并把其应用于求解TSP问题,仿真结果表明,该方法具有很好的性能。

关键词: 蚁群算法, 信息素更新, 旅行商问题(TSP)

CLC Number: