Research on Algorithm of Multi-Type and Multi-Objective Vehicle Routing Problem with Time Windows

Aiming at the problem of modern logistics distribution, this paper proposes a multi-type vehicle and multi-objective vehicle routing optimization method with time windows. In the process of dispatching vehicles to participate in transportation, enterprises will have various factors that will not fully meet customer needs. On this basis, three objective functions are proposed, namely, the total cost is as low as possible, the number of customers served is as large as possible, and the distribution volume is as large as possible. The corresponding mathematical model is established. The problem is solved through the MOEA/DP algorithm. In order to improve the quality of the solution and avoid falling into local optimization, the self-crossover operator and modified mutation operation are introduced in the algorithm. The experimental results show that the algorithm is feasible in solving the problem of multi vehicle routing with time windows.