可获知偶发拥堵持续时间的动态车辆路径问题

考虑真实交通路网,探讨了可获知偶发拥堵持续时间的动态车辆路径问题.在利用改进的Dijksta算法将路段行驶时间转化为客户点间最短行驶时间的基础上,根据常发拥堵信息,通过遗传算法安排车辆初始配送路径,根据实时获知的偶发拥堵因素影响下的路段行驶时间和其持续时间,以2-opt和insertion方法更新车辆配送路径,通过车载导航系统实时指导车辆行驶路线.数值试验表明,该方法可根据偶发拥堵信息更新车辆配送路线,以避开偶发拥堵影响路段,缩短总配送时间0.65~13.18 min;获知偶发拥堵持续时间帮助多节省了配送时间 -0.16~4.17 min.节省的时间随偶发拥堵因素对路网影响的加剧而更显著. 

Dynamic Routing of Vehicles with Known Duration of Non-recurrent Congestion

Dynamic routing of vehicles with known duration of non-recurrent congestion in actual urban road net-work is studied.The shortest travel time and initial delivery route between customers are obtained using a modified Dijk-stra algorithm.On the basis,the initial delivery route is updated in accordance with recurrent congestion information by the genetic algorithm.And then,adjusted delivery route is obtained by 2-opt algorithm and insertion algorithm consider-ing travel time influenced by non-recurrent congestion and its duration.The developed delivery route algorithm is finally applied in a car navigation system in real-time.A numerical experiment proves that driving routes can be updated based on congestion information to avoid traffic jam,and travel time decreases total by 0.65 -13.18 min.If the duration time of non-recurrent congestions is known further,the travel time decreases by 0.16-4.17 min additionally.The greater of the influences of non-recurrent congestion factors on urban network,the more travel time are saved using the developed algo-rithm.