Research on Vehicle Routing Optimization Based on Improved Ant Colony Algorithm

Article Preview

Abstract:

This paper analyzes the domestic and international logistics distribution route optimization problem and the research status of ant colony algorithm, illustrates the problems existing in the logistics distribution now. It reflects the necessity to research on the vehicle routing optimization problem. In order to increasing the ant colony algorithm’s convergence speed and avoiding to fall into local optimum, we improve the pheromone evaporation coefficient and visibility to optimize the searching ability, which can avoid premature convergence and stagnation.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1917-1920

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] PaessensH. The Saving Algorithm for The Vehicle Routing Problem [J]. EuroPean Journal of operational Researeh, (1988).

Google Scholar

[2] W. L. Pharn, W. C. Chiu. Approximate solutions for the Maximum Benefit Chinese Postman Problem[J]. International Journal of Systems Science, (2005).

Google Scholar

[3] Ren T X, Edwardsa J S, Clarkeb D. Adiabatic oxidation study on the propensity of pulverized coals to spontaneous combus-tion[J]. Fuel, (1999).

Google Scholar

[4] BramelJB, Simchi-LeviD. A location based heuristic for general routing Problems [J]. Operations Researeh, (1995).

Google Scholar