基于实时交通信息的动态路径规划算法性能比较  

Performance Comparison of Dynamic Route Planning Based on Real Time Traffic Information

作　　者：黄西洲 王蕾[2] 

机构地区：[1]陕西西咸新区发展集团有限公司 [2]长安大学信息工程学院

出　　处：《微计算机信息》2012年第9期497-498,248,共3页Control & Automation

摘　　要：本文综合考虑起始点间的所有路径的实时交通信息,将其作为影响选择概率的一个重要因素-阻抗,应用于蚁群算法当中,在此基础上进一步优化了传统的蚁群算法。通过与求解AR的两种方法-Dijkstra算法和蚁群算法的性能仿真对比。详细比较了与这两种算法在收敛速度和计算结果精确度方面的差异。结论表明改进后的蚁群算法在各方面均优于其他两种算法。This paper to consider all paths between the starting point for real-time traffic information,As an important factor to influence the choice of probability-impedance,We applied it to the ant colony algorithm,On this basis,we further optimized the traditional ant colony algorithm 。 Simulation of compared with the performance of the two methods of solving AR-Dijkstra algorithm and ant colony algorithm 。 A detailed comparison of the differences of these two algorithms in convergence speed and calculation accuracy 。 Concluded that the improved ant colony algorithm in all respects superior to the other two algorithms.

关 键 词：动态路径规划 实时交通信息 蚁群算法 DIJKSTRA算法 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]