Research on Multi-Center Vehicle Recovery Routing Optimization

Aiming at the vehicle path optimization problem of multi-center recyclables under the background of low carbon, a mathematical model with the goal of minimizing the total cost taking into account the carbon emission cost is constructed, and a two-stage algorithm is designed to solve it according to the characteristics of the model. In the first stage, the k-means clustering algorithm is used to cluster the recycling points based on the principle of minimum distance, and then each type is divided into the nearest recycling center according to the distance between the clustering center and the recycling center. In the second stage, adaptive genetic algorithm is designed to solve the vehicle recycling path of each recycling center, and the optimal recycling path of each recycling center is summarized to obtain the overall recycling plan. Finally, a numerical example is given to prove the effectiveness of the proposed model and algorithm in solving the multi-center vehicle recovery path problem.