Application Research of Improved Simulated Annealing Algorithm in Vehicle Routing Problems

This paper analyzed the principle and insufficient of traditional simulated annealing algorithm, and on the basis of the traditional simulated annealing algorithm, this paper used improved simulated annealing algorithm to solve vehicle routing problems. The new algorithm increases memory function, and keeps the current best state to avoid losing current optimal solution while reducing the computation times and accelerating the algorithm speed. The experimental results show that, the algorithm can significantly improve the optimization efficiency, and has faster convergence speed than traditional simulated annealing algorithm.