The Research Of Split Vehicle Routing Problem With Simultaneous Delivery And Pickup And Multiple Time Windows

The split vehicle routing problem with simultaneous delivery and pickup as well as multiple time windows referring to the situation that each warehouse has both pickup and delivery demand, the goal is to determine a set of vehicle routes as well as the pickup and delivery pairings in each vehicle route, all vehicle routes start and end in the same depot, all goods are transported in the required time and the total cost is minimized.This thesis starts from the features of the split vehicle routing problem and the vehicle routing problem with simultaneous pickup and delivery, we summarizes the researches about these problems and point out their shortcomings in practical. Then we propose a vehicle routing problem with features of multiple materials, multi-time windows, split demand, simultaneous pickup and delivery etc., which is concluded from theoretical research and corporation practice. The mathematical model is established from the integrality of supply chain, which combines the transportation with production process by adding the arrival time window constraints of each material. In illusion to the limited inventory, we design a two-stage algorithm for problem solving, and the algorithm is designed from the aspect of maximize the transportation efficiency of vehicles. The analysis result of case study shows that the problem with time windows is more suitable for practical use, and the proposed model and algorithm can not only reduce transportation cost, decrease vehicle number, but also ensure the timeliness and veracity of material supplement for the enterprise. The most important is that the result can help to support the realization of the integration logistics management mode for the enterprise.