p.1712
p.1717
p.1721
p.1726
p.1733
p.1739
p.1745
p.1750
p.1755
Application Research about the Chaos Ant Colony Algorithm in Emergency Logistics Distribution Routing Optimization
Abstract:
In this essay, the solution about emergency logistics distribution routing optimization has been analyzed by quantitative methods, and the mathematic model focusing on trying the best to shorten distribution time has been established, in which the actual situations of the pathways and the shortage of goods at each affected point have been considered in order to keep further close to the real circumstances where had suffered disaster. Using the Chaos Ant Colony Algorithm solves the mathematic model. The experimental simulation indicates that the arithmetic is feasible and effective to settle the problem about the optimization of emergency logistics distribution route.
Info:
Periodical:
Pages:
1733-1738
Citation:
Online since:
July 2011
Authors:
Price:
Сopyright:
© 2011 Trans Tech Publications Ltd. All Rights Reserved
Citation:
[1] Feng Xundong, Lv Shuai: Making a Good Job of Several Measures in Emergency Logistics and Distribution. China Materials Distribution Vol. 23, No. 3 (2003), pp.31-34.
[2] Gao Shang: Solving Traveling Salesman Problem by Chaos Ant Colony Optimization Algorithm. Engineering-theory & Practice Vol. 8, No. 9(2005), pp.100-103.
[3] Liu Lidong: Master. Research on Improved Ant Colony Optimization. Southwest Jiaotong University(2005).
[4] Ye Zhiwei and Zheng Zhaobao: Study on the parameters in Ant colony algorithm—An example to TSP. Wuhan University (Information Science) vol. 29, no. 7(2004), p.597–601.
[5] Dorigo M: Ant colony system：A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation Vol1, No. 1(1997).
DOI: 10.1109/4235.585892
[1] 2.
[1] 1.
[1] 3.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[1] 0.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[1] 3 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 7.
[1] 9.
[1] 6.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 0.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 0.
[1] 1 2.
[1] 1.
[1] 3.
[1] 5.
[1] 4.
[1] 6.
[1] 7.
[1] 8.
[1] 3.
[1] 2.
[1] 1.
[1] 0.
[1] 8.
[1] 75.
[1] 69.
[1] 74.
[1] 62.
[1] 1.
[1] 2.
[1] 4 3.
[1] 3.
[1] 4.
[1] 5.
[1] 1.
[1] 2.
[1] 3.
[1] 6.
[1] 5.
[1] 3.
[1] 1.
[1] 2.
[1] 4.
[1] 6.
[1] 7.
[1] 81.
[1] 8.
[1] 7.
[1] 9.
[1] 2 4.
[1] 5.
[1] 5.
[1] 4.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 1.
[1] 7.
[1] 3.
[1] 5.
[1] 6.
[1] 9.
[1] 8.
[2] 1.
[2] 0 5.
[1] 6.
[1] 7.
[1] 6.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6 6.
[1] 7.
[1] 9.
[1] 7.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7 7.
[1] 8.
[1] 6.
[1] 8.
[1] 6.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8 8.
[1] 9.
[1] 1.
[1] 3.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9 9.
[1] 0.
[1] 1.
[1] 2.
[1] 3.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0 10.
[1] 1.
[1] 2.
[1] 1.
[1] 1.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8.
[1] 9 11.
[1] 2.
[1] 3.
[1] 0.
[1] 2.
[1] 1.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7.
[1] 8 12.
[1] 3.
[1] 0.
[1] 8.
[1] 4.
[1] 7.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 3.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6.
[1] 7 13.
[1] 4.
[1] 6.
[1] 75.
[1] 6.
[1] 3.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5.
[1] 6 14.
[1] 5.
[1] 5.
[1] 69.
[1] 7.
[1] 5.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4.
[1] 5 15.
[1] 6.
[1] 4.
[1] 74.
[1] 81.
[1] 6.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3.
[1] 4 16.
[1] 7.
[1] 3.
[1] 62.
[1] 8.
[1] 9.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2.
[1] 3 17.
[1] 8.
[1] 2.
[1] 1.
[1] 7.
[1] 8.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1.
[1] 2 18.
[1] 9.
[1] 0.
[1] 2.
[1] 9.
[2] 1.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.
[1] 1 19.
[1] 3.
[1] 1.
[1] 4.
[1] 2.
[2] 0.
[1] 6.
[1] 7.
[1] 8.
[1] 9.
[2] 0.
[1] 9.
[1] 8.
[1] 7.
[1] 6.
[1] 5.
[1] 4.
[1] 3.
[1] 2.
[1] 1.