Research on Vehicle Routing Problem Based on Improved Ant Colony Algorithm

Based on the analysis of characteristics of vehicle routing problem in logistics distribution(VLD),the VLD mathematical model and relative ant colony algorithm which can be used to solve the problem were proposed.After analyzing the impact of the ant colony algorithm parameters setting such as α、β、ρ on the convergence of the algorithm and solving precision,a parameter self-adaptive adjustment tactic which can speed up the convergence rate and improve the global search capability was proposed,and the original ant colony algorithm was improved accordingly.The simulation experiment results show that the improved algorithm is superior to the original algorithm in the global convergence capability,the stability of calculation and the speed of calculation.Its feasibility and effectiveness were proved.