Combination Application of Simulated Annealing and Ant Colony Algorithm in VRP Optimization Problem

Vehicle routing problem is the core problem of logistics system optimization, and the shortest path and the lowest cost are achieved when the relevant requirements are satistied. The VRP optimization problem and its solving method are analyzed. The principle and characteristics of simulated annealing and ant colony algorithm are studied. The idea and method of combination of simulated annealing algorithm and ant colony algorithm are proposed.The parameters of ant colony algorithm are improved, and the neighborhood algorithm is used to search the solution two times. The quality of the solution is optimized. It achieves the shortest path under the condition of relevant constraints. The results of this algorithm are compared with those of basic ant colony algorithm, modified ant colony algorithm and VRP website. Experimental results show that the proposed combination algorithm has a great improvement in time and accuracy, and has good application value.