【摘要】 讨论了带有实时交通信息的动态网络车辆路径派送问题.问题包含重复性拥堵和非重复性拥堵两种情形.用重复性拥堵下的交通信息以安排初始路径,通过采用遗传算法求解时变车辆调度问题.车辆在行驶过程中需要根据接收到的实时交通信息调整路线.提出在关键点更新路线的机制,并采用Dynasearch算法求解一类特殊的旅行商问题调整路线.通过对Sioux Falls网络进行数值模拟分析,结果表明新策略能在较短时间内改进其他策略,且随着网络动态性增加其优越性更加明显.更多还原

【Abstract】 A vehicle routing and dispatching problem in a dynamic traffic network with real-time traffic information is discussed in this paper. Both re-current and non-recurrent congestion are considered in the problem.The initial route planning is made by solving a time-dependent vehicle routing problem under re-current congestion conditions. The genetic algorithm is applied. During the planning implementation,a new mechanism updating at the critical node is proposed to adjust the routes with real-time traffic information subject to the unexpected traffic accidents in non-recurrent congestion environment. It is conducted by solving a special traveling salesman problem with Dynasearch algorithm. The numerical simulation results with the Sioux Falls network show the efficiency of the new mechanism. The new strategy can improve the other strategies in a short time,and it becomes more efficient when the network becomes more dynamic.更多还原