The Starting point for ant colony optimization is a biological metaphor: natural ant colonies are able to find shortest paths between ant-hill and food by using local pheromone trails for information exchange. The convergence of ant colony algorithm for solving shortest path problem is exploringly studied. The theorems establish sufficient condition for the convergence ant colony algorithm for solving shortest path problem .A numerical example is given to illustrate the efficiency of the results.
参考文献
相似文献
引证文献
引用本文
高尚 杨静宇. 最短路的蚁群算法收敛性分析[J]. 科学技术与工程, 2006, (3): 273-277. GAO Shang, YANG Jingyu. Convergence Analysis of Ant Colony Algorithm for Solving Shortest Path Problem[J]. Science Technology and Engineering,2006,(3):273-277.