基于交通流量预测的动态最优路径规划研究  

Dynamic optimal path planning based on forecasts of traffic flow

作　　者：刘智琦[1] 李春贵[1] 陈波[1] 

机构地区：[1]广西工学院计算机学院,广西柳州545006

出　　处：《广西工学院学报》2012年第2期41-45,共5页Journal of Guangxi University of Technology

基　　金：广西科技开发计划项目(桂科攻0992006-13);教育部重点实验室同济大学嵌入式系统与服务计算开放课题基金(2011-02)资助

摘　　要：针对传统算法仅适用静态路况的缺点,提出基于交通流量预测的动态最优路径规划方法.通过建立道路运营网络模型,计算流量碰撞概率和道路拥堵概率,重新定义路段的权值并改进了传统算法,实现了动态路况下的最优路径规划,并对传统算法与改进算法进行仿真实验,得到3种实验结果.结果表明,改进算法在交通高峰期得到的最优路径所需行驶时间比传统算法得到的最优路径行驶时间减少16%～23%,有效提高了交通调度效率.The dynamic optimal path planning algorithm based on forecasts of traffic flow is proposed. Through establishing road network model, calculating flow collision probability and road congestion probability, redefining the weight of the road, improving the traditional algorithm which is only for static traffic, the dynamic optimal path planning algorithm is achieved. Through the simulation experiments of the traditional and the improved algorithms, three results were obtained. The results show that, in traffic peak, the improved algorithm of travel time reduced by 16% to 23%. The improved algorithm can improve the efficiency of traffic scheduling.

关 键 词：交通流量预测 动态最优路径规划 流量碰撞概率 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]