Study on Optimization of Vehicle Routing Problem by Improved Ant Colony Algorithm

This paper mainly studies the vehicle routing problem with path constraints, time window constraints and capacity constraints through the improvement of ant colony optimization algorithm to optimize the route of delivery vehicles to achieve the minimization of the total cost of the delivery route. The improvement is mainly carried out from three aspects: first, the insertion operation between nodes and paths is designed to avoid customer omission in the process of ant colony traveling and reduce the probability of generating infeasible solutions; second, the insertion operation between road sections is used instead of the traditional simple merger guides the search to minimize the cost of the route. Finally, the convergence speed of ant colony optimization is accelerated by rewarding only the pheromone of the route constructed by the global optimal solution obtained so far. Through two groups of experiments with the best known solution and the existing research results, the efficiency of the improved scheme in optimizing the vehicle routing problem with constraints is verified.