A Dynamic Vehicle Routing Problem with Backhaul and Time Window
The problem of demand changes in the vehicle routing problem with backhaul and time window is addressed in the paper.In real vehicle scheduling,customer demand often changes,such as new requests,requests of canceling service and increase/decrease in the quantity from backhauls.These make the original optimal plan unfeasible.In order to solve the problem,demand changes are analyzed,and their impact on the original plan is measured at first.And based on disruption management thoughts,a disruption recovery model for the problem is put forward.Then two strategies and a local search algorithm are designed to find the optimal adjusted solution.Finally,experimental results show the effectiveness of the model and the algorithm.
demand change disruption management vehicle routing problem with backhaul and time window(VRPBTW) a local search algorithm
Xuping Wang Haiyan Cao
Institute of Systems EngineeringDalian University of TechnologyDalian,China Institute of Systems Engineering Dalian University of Technology Dalian,China
国际会议
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）