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

Study on Shortest Path Search Method Based on Ant Algorithm

作　　者：靳凯文[1] 李春葆[1] 秦前清[2] 

机构地区：[1]武汉大学计算机学院,湖北武汉430079 [2]武汉大学测绘遥感信息工程国家重点实验室,湖北武汉430079

出　　处：《公路交通科技》2006年第3期128-130,134,共4页Journal of Highway and Transportation Research and Development

摘　　要：最短路径搜索是车载定位导航系统中很重要的一个功能,最短路径搜索问题本身也可以归结为组合优化问题。蚁群算法是基于群体的一种仿生算法,为求解复杂的组合优化问题提供了一种新思路。文章尝试采用蚁群算法来解决车载导航系统中的最短路径搜索问题,并在VC 6.0的环境下进行了仿真实验。实验结果表明,该方法能有效解决车载导航系统中的最短路径搜索问题,具有一定的理论参考价值和实际意义。Searching shortest path is one of the most important functions of vehicle location and navigation system, and to march shortest path can also be summarized to combinatory optimization. Ant algorithm is a kind of population based bionic algorithm, which provides new methods for complex combinatory＂ optimization. In the paper, the authors attempt to use the basic ant algorithm to get shortest path solution for vehicle location and navigation system.At the same time, simulation experiment is done under the environment of VC 6.0. The experiment data shows that the ant algorithm is an effective way to the solution.

关 键 词：最短路径 最短路径搜索 蚁群算法 车载定位导航系统 智能交通运输系统 

分 类 号：U491[交通运输工程—交通运输规划与管理]