Application of Improved Scatter Search Algorithm to Reverse Logistics VRP Problem

In this paper, waste packaging recycling route planning is summarized as a reverse logistics vehicle routing problem with backhauls (RL- VRPB), and a mathematical model is established to minimize the cost of vehicle recovery. Integer encoding containing 0 is used. When the initial solution is generated, the “remaining loading space” is used to measure the recovery capacity of the vehicle, and the classical heuristic saving algorithm is improved to obtain the initial solution. The local search strategy is used to diversify the initial solution, and the evolutionary algorithm is designed based on the scatter search framework. Simulation experiments verify the rationality and effectiveness of the routing problem model and the scatter search algorithm based on the improved initial solutions.