Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (5): 67-70.

• 学术探讨 • Previous Articles     Next Articles

Ant Colony System and Its Convergence

Xia Zhao   

  • Received:2006-03-16 Revised:1900-01-01 Online:2007-02-11 Published:2007-02-11
  • Contact: Xia Zhao

蚁群系统(ACS)及其收敛性证明

赵霞 田恩刚   

  1. 南京师范大学
  • 通讯作者: 赵霞

Abstract: Ant Colony System is one of the best approaches in resolving the Traveling Salesman Problem. It makes many improvements based on Ant System, and these improvements can avoid the premature convergence in a way. And Ant Colony System is also a good cooperating searching algorithm. Compared with the Ant System, this paper introduced Ant Colony System systemically and proved its convergence theoretically.

Key words: convergence, pheromone, Ant Colony Optimization Algorithm, Ant Colony System

摘要: 蚁群系统(ACS)是解决旅行商问题(TSP)的最好方法之一,它是在蚂蚁系统的基础上作了许多改进之后得到的一种优化算法。这些改进在一定程度上避免了过早停滞现象的发生,是一种较好的协作式搜索算法。通过与蚂蚁系统的比较,本文系统的介绍了蚁群系统(ACS)所做出的种种改进,并且在理论上证明了该算法的收敛性。

关键词: 收敛性, 信息素, 蚁群优化算法, 蚁群系统