Logistics Vehicle Optimization Scheduling Based on Multi Constraint PDPTW Algorithm

The key to reduce the cost of urban logistics distribution is reasonable planning of vehicle distribution routes, and the core theoretical model is the VRP problem proposed by Dantzig. VRP is a milestone progress to the traditional manual distribution route. Since then, this problem has been a hot research topic in the field of logistics, and it has constantly derived a variety of vehicle routing problems with different constraints. PDPTW is an optimization combination problem with wide practical applications. Because PDPTW can be used as a model of logistics operation planning, it is used more and more in practical life. The optimal solution of the problem can be obtained by using the precise algorithm, but when the size of the problem increases, the solution inches will increase exponentially. In this paper, a multi-constraint PDPTW solution model is constructed to solve the problem of precise algorithm. Based on the basic GA, the adaptive GA is studied. The crossover rate and mutation rate in the genetic process can be adapted to the changes of chromosome adaptation values. The experimental results show that the adaptive GA can save the logistics cost significantly.