Door Assignment and Time-dependent Vehicle Routing Problem with Multiple Cross-Docks
The thesis is about the optimization of time-dependent vehicle routing problem with multiple cross-docks and door assignment,considering collaborative distribution of multiple cross-docks,time-dependent speed and time windows of customers.An optimization model is established to minimize the sum of pick up,delivery and transfer vehicles'dispatching cost,vehicles'energy cost,forklifts'transportation cost and penalty cost on earliness and tardiness.A variable neighborhood search algorithm is designed according to the characteristics of the problem.In order to improve algorithm's searching speed and solving quality,neighbor-hood search is simultaneously carried out in the interval of pick up,delivery,door assignment and cross-docking operation process,and the neighborhood structure includes inserting,switching and 2-opt.The validity of the algorithm is verified by multi-group examples.The results show that:(1)Considering the time-dependent vehicle speed and collaborative distribution of multiple cross-docks,the vehicle scheduling and cross-dock door assignment scheme could effectively reduce the operation cost and improve logistics distribution efficiency of urban areas.(2)The neighborhood search within each interval enhances the optimization ability of variable neighborhood search algorithm designed in this paper,improves the solution quality and provides an effective algorithm for solving the cross-dock door assignment and vehicle routing problem optimization.(3)Compared with fuel vehicle delivery and mixed fleet vehicle delivery,electric vehicle delivery could save cost.Therefore,logistics enterprises should increase the use of electric vehicles and give priority to dispatching electric vehicles for delivery services.The research results expand and enrich the research of vehicle routing problem with cross-docking,and provide theoretical basis for logistics enterprises to formulate the decision distribution scheme scientifically.