首页 | 本学科首页   官方微博 | 高级检索  
     

解TSP问题的蚁群算法及其收敛性分析
引用本文:徐强,宋海洲,田朝薇. 解TSP问题的蚁群算法及其收敛性分析[J]. 华侨大学学报(自然科学版), 2011, 0(5): 588-591
作者姓名:徐强  宋海洲  田朝薇
作者单位:华侨大学数学科学学院;
基金项目:福建省自然科学基金资助项目(Z0511028)
摘    要:
研究和证明求解旅行商问题(TSP)的蚁群算法收敛性.针对蚁群算法搜索时间长、收敛速度慢、易陷入局部最优等缺陷,改进Dorigo提出的基本蚁群算法.最后,用典型的旅行商问题CHN144进行仿真实验,结果表明,改进蚁群算法在收敛速度及求解能力上都有较大改善.

关 键 词:旅行商问题  蚁群算法  收敛性  信息素

Convergence Analysis of the Ant Colony Algorithm for Solving TSP
XU Qiang,SONG Hai-zhou,TIAN Zhao-wei. Convergence Analysis of the Ant Colony Algorithm for Solving TSP[J]. Journal of Huaqiao University(Natural Science), 2011, 0(5): 588-591
Authors:XU Qiang  SONG Hai-zhou  TIAN Zhao-wei
Affiliation:XU Qiang,SONG Hai-zhou,TIAN Zhao-wei(School of Mathematical Sciences,Huaqiao University,Quanzhou 362021,China)
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 convergenc...
Keywords:traveling salesman problem  ant colony algorithm  convergence  pheromone  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号