基于蚁群算法的最短路径搜索方法研究  

New Method to Search Shortest Path in a Network Based on Ant Colony Optimization

作　　者：程世娟[1,2] 卢伟[3] 陈虬[1] 

机构地区：[1]西南交通大学应用力学与工程系 [2]西南交通大学应用力学与工程系应用数学系,成都610031 [3]西华大学计算机系

出　　处：《科学技术与工程》2007年第21期5706-5708,5712,共4页Science Technology and Engineering

摘　　要：最短路径问题是在给定的网络图中寻找出一条从起始点到目标点之间的最短路径。蚁群算法是一种用于求解优化问题的新型模拟进化算法,该算法在许多相当困难的优化问题的求解中体现了极强的寻优能力和较好的性质。提出了一种利用蚁群算法来解决网络最短路径问题的新方法,并用Matlab语言编程进行算法的实现和仿真。结果表明,蚁群算法在寻求网络最短路方面的应用是可行的。Searching shortest path is one of the most important questions in a network from a node to another.The Ant Colony Optimization is a kind of bionic optimization based on swarm intelligence,which provides new methods for complex combinatory optimization.A new method is put forward by the authors to get the shortest path in a network by use of the basic Ant Colony Optimization.At the same time,simulation experiment is done under the environment of network.The experiment data showed that the Ant Colony Optimization is an effective way to solve the Shortest Path question.

关 键 词：蚁群算法 最短路径 网络图 信息素 

分 类 号：TV391.75[水利工程—水工结构工程]