Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (13): 233-235.

• 工程与应用 • Previous Articles     Next Articles

Study and Application on Shortest Path Search Problem Based on Ant Algorithm

  

  • Received:2006-05-31 Revised:1900-01-01 Online:2007-05-01 Published:2007-05-01

基于蚁群算法的最短路径问题的研究和应用

黄贵玲 高西全 靳松杰 谈飞洋   

  1. 西安电子科技大学 西安电子科技大学通信工程学院
  • 通讯作者: 黄贵玲

Abstract: Searching shortest path of the transportation network is one of the most important functions of ITS, in order to find the optimization path accurately and rapidly, the authors attempt to use the ant algorithm with the heuristic direction information to realize the function. The result of simulation experiment shows that this algorithm can accurately find the optimization solution to the shortest path in an transportation network and its efficiency and searching ability is strong ,which has the reference value and the meaning of realism to the study of ITS.

Key words: Shortest path, Ant algorithm, Beeline optimizing

摘要: 求解交通路网中两点间的最短路径是智能交通系统中一个重要的功能,为了更为准确快速的找到最优解,本文尝试采用带有方向引导信息的蚁群算法来实现此功能。实验结果表明,该方法能较为准确的找到交通路网中两点间最短路径的最优解,搜索效率高、搜索最优解的能力强,对于智能交通系统中最短路径搜索的功能实现问题有一定的参考价值和实际意义。

关键词: 最短路径, 蚁群算法, 直线优化