Improved variable neighborhood search algorithm for multi-compartment vehicle routing problem

To study the multi-compartment vehicle routing problem, a mathematical model of minimizing the delivery distance was established, and an improved variable neighborhood search algorithm was proposed to solve it. Based on the framework of the variable neighborhood search algorithm, a multi-start optimization mechanism was designed ,and a scanning method was used to construct the initial solution. A Shaking process and a global disturbance process were designed to explore the neighborhood solution space,a return and redistribution strategy was proposed to explore the infeasible area in the solution space,a greedy algorithm and multiple hybrid operators were combined to design the search optimization mechanism within and between the sub-paths of the Local Search process to expand the local search,and a maximum number of iterations to stop the rule was applied to end the loop and retain the optimal solution. The experiment and comparative analysis of the adapted calculation examples showed that the improved variable neighborhood search algorithm designed for the characteristics of the multi-compartment vehicle routing problem could plan a more reasonable distribution path,obtain a more stable high-quality solution, and achieve a more obvious optimization effect in an appropriate time. © 2022 CIMS. All rights reserved.