华侨大学学报（自然科学版）2011，Vol.32Issue(5)：588-591,4.
解TSP问题的蚁群算法及其收敛性分析
Convergence Analysis of the Ant Colony Algorithm for Solving TSP
摘要
Abstract
A detailed theoretical research on ant colony algorithm (ACA) is performed, and the convergence of the ACA for solving the traveling salesman problem (TSP) is proved. ACA has the limitations of stagnation and poor convergence, and is easy to fall in local optima, a series of improvement schemes such as roulette strategy and excellent ants release pheromone strategy are proposed. Finally, a typical example of Traveling salesman problem CHN144 is calculated. It is shown that the improved ACA has a satisfied convergence and search ability.关键词
旅行商问题/蚁群算法/收敛性/信息素Key words
traveling salesman problem/ ant colony algorithm/ convergence/ pheromone分类
信息技术与安全科学引用本文复制引用
徐强,宋海洲,田朝薇..解TSP问题的蚁群算法及其收敛性分析[J].华侨大学学报（自然科学版）,2011,32(5):588-591,4.基金项目
福建省自然科学基金资助项目(Z0511028) （Z0511028）
