Research on the optimization of vehicle routing problem with multi-constraints based on improved ant algorithm

In order to address the timely delivery of distribution and the internal resource constraints of distribution enterprises, this paper constructed a optimization model of vehicle routing problem (VRP) with multi-constraints, and added test subroutines (such as mileage restrictions, time windows constraints, the number and capacity-limited of vehicles) and an effective mechanism to avoid premature convergence to the ant algorithm to solve the VRP. Finally, a numerical example is presented. Comparison is made between the improved ant algorithm proposed by the paper and saving algorithm, distribution algorithm and genetic algorithm. The experimental results showed that the model and the approach was an effective solution to VRP.