Research on Vehicle Route Planning with Capacity Limitation Based on Adaptive Large-scale Neighborhood Search Algorithm

In order to solve the routing problem of vehicle with capacity in the logistics optimization field more efficiently, an adaptive large-scale neighborhood search algorithm is proposed. Considering the characteristics of vehicle path planning problems with capacity constraints (CVRP), a combination of destruction and repair operators is proposed. At the same time, the algorithm used in this paper can dynamically adjust the weights of the two operators to improve the search efficiency and the quality of the solution. The calculation results show that the adaptive large-scale neighborhood search algorithm can better solve the CVRP and can better adapt to the needs of practical problems.