Application Research of Improved Simulated Annealing Algorithm in Vehicle Routing Problems

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1031-1036

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhang Hong: Vehicle Routing Optimization Problem Research in Logistics Distribution. Master Thesis of Harbin Industrial University(2007).

Google Scholar

[2] Chen Huo: Application of Based on Multi-thread Simulated Annealing Algorithm in Distribution Route Choice. Computer Knowledge and Technology(2009).

Google Scholar

[3] JinCheng Fang and QiShan Zhang: Algorithm Research of Logistics Distribution VRP. Journals of Xuzhou Engineering College(2007).

Google Scholar

[4] GuoXian He: Application in Single Logistics Center Distribution VRP of Simulated Annealing Algorithm Based on the Simulation Random Solutions. Railway Journal(2009).

Google Scholar

[5] HaiJun Wang, LiJuan Yang and YuRan Wan: Application in Emergency Logistics Vehicle Scheduling of Simulated Annealing Algorithm. Logistics Engineering and Management(2009).

Google Scholar