计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (24): 75-77.
• 学术探讨 • 上一篇 下一篇
张曦煌,李彦中,李 岩
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
ZHANG Xi-huang,LI Yan-zhong,LI Yan
Received:
Revised:
Online:
Published:
Contact:
摘要: 提出了一种基于基本蚁群算法的有节点信息素更新和记忆功能的算法模型;仿真结果表明,基于改进的蚁群算法模型在寻找最优解时表现出很高的效率,明显地优于现有的启发式算法的解,是一种有效的算法。
关键词: 寻径, 基本蚁群算法, 旅行商问题(TSP), 信息素, 路径
Abstract: Basing on these problems,a new algorithm of ant colony algorithm is proposed.In this new algorithm,two new proposals are introduced into this reforming algorithm:comparing to the original ACO,propose the ideal of updating pheromone on these nodes;Basing on this new ACO,the simulation results indicate a better throughout.About the algorithm running time,the improved proposals accelerate time converging of routing and improved efficiency of algorithm.
Key words: routing, Ant Colony Algorithm(ACO), Traveling Salesman Problem(TSP), pheromone, paths
张曦煌,李彦中,李 岩. 基于加速寻径收敛的改进型蚁群算法[J]. 计算机工程与应用, 2007, 43(24): 75-77.
ZHANG Xi-huang,LI Yan-zhong,LI Yan. Improved ant colony optimization algorithm based on accelerating time converging of routing[J]. Computer Engineering and Applications, 2007, 43(24): 75-77.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2007/V43/I24/75