本文已被：浏览 1702次 下载 3829次
Received:August 25, 2011 Revised:September 23, 2011
Received:August 25, 2011 Revised:September 23, 2011
中文摘要: 针对蚁群算法存在易陷入局部寻优、收敛缓慢等缺陷,提出一种基于邻接矩阵的两层搜索决策来选择转移路径的方法对蚁群算法进行改进,求解TSP 问题。通过实验及分析,验证了该算法具有较好性能。
Abstract:Aiming at solving the problem of falling into local optimization easily and slow convergence, this paper proposes a method that adopts a bi-level searching decision based on adjacent matrix in choosing diverting path to improve ant colony algorithm and solve TSP problem. The experiment results show that the new algorithm has better performance.
keywords: improved ant colony algorithm TSP path optimization bi-level searching decision global convergence
文章编号： 中图分类号： 文献标志码：
基金项目:安徽省教育厅自然科学基金(2005KJ004ZD)
引用文本：
胡粼粼,葛红.改进蚁群算法求解TSP.计算机系统应用,2012,21(5):198-200,208
HU Lin-Lin,GE Hong.Improved Ant Colony Algorithm for Solving TSP.COMPUTER SYSTEMS APPLICATIONS,2012,21(5):198-200,208
胡粼粼,葛红.改进蚁群算法求解TSP.计算机系统应用,2012,21(5):198-200,208
HU Lin-Lin,GE Hong.Improved Ant Colony Algorithm for Solving TSP.COMPUTER SYSTEMS APPLICATIONS,2012,21(5):198-200,208
