计算机工程与应用2016，Vol.52Issue(6)：8-12,5.DOI:10.3778/j.issn.1002-8331.1407-0225
改进蚁群算法求解最短路径问题
Solving shortest path problem with modified ant colony algorithm
袁亚博 1刘羿 1吴斌1
作者信息
- 1. 北京跟踪与通信技术研究所，北京 100094
- 折叠
摘要
Abstract
To solve the problem that the ant colony algorithm is easy to fall into local optimal solutions in solving the shortest path problem, improvements on the classical ant colony algorithm are provided in three aspects. Firstly, direction guiding is utilized in the initial pheromone concentration to speed up the initial convergence;secondly, the idea of phero-mone redistribution is added to the pheromone partial renewal process in order to prevent the optimal path pheromone con-centration from being over-damped by the path pheromone decay process;finally, a dynamic factor is invited to the global renewal process to adaptively update the pheromone concentration on the optimal path. In this way the global searching ability is improved. The results of the simulation experiment show that this modified algorithm can greatly increase the probability of finding the optimal path while guaranteeing the convergence speed.关键词
蚁群算法/最短路径/方向引导/信息素Key words
ant colony algorithm/shortest path/direction guiding/pheromone分类
信息技术与安全科学引用本文复制引用
袁亚博,刘羿,吴斌..改进蚁群算法求解最短路径问题[J].计算机工程与应用,2016,52(6):8-12,5.
