Vehicle Scheduling Problem of Multiple Distribution Centers Based on Improved Ant Colony Algorithm

Optimizing Vehicle Routing Problem (VRP) has become an important element to reduce the pressure in the logistics industry. VRP problems with more constraints are usually solved with heuristic algorithms, so this article adopts the Ant Colony Optimization (ACO) algorithm to address the university meal distribution problems under the epidemic situation. For the problem that the ant colony algorithm easily falls into the local optimum, the optimal path obtained in each iteration is optimized by adding 2-optimization (2-opt). The improved algorithm is applied to the vehicle scheduling problem of multiple distribution centers, and it’s indicated that the algorithm has practical significance compared with dynamic programming algorithm and ant colony algorithm without 2-opt.