Research on the Vehicle Scheduling Problem in Wartime Spare Parts Distribution

Article Preview

Abstract:

The distribution-based logistics support is an important way to improve the efficiency of spare parts supply, and the scientific scheduling of vehicle is crucial to achieve this target. The mathematical model of the vehicle scheduling problem in wartime spare parts distribution was formulated, and an improved ant colony optimization algorithm was utilized to solve it. In our algorithm, the transition rule was improved, and the local search heuristics were integrated into the algorithm. The VRPTW benchmark instances were revised and solved under different parameter settings, and the experimental results showed that our improved transition rule can significantly enhance the algorithm's performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

883-888

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] B. L. Golden, S. Raghavan and E. A. Wasil. The vehicle routing problem: latest advances and new challenges. Springer(2008).

DOI: 10.1007/978-0-387-77778-8

Google Scholar

[2] C. H. Chen and C. J. Ting. A hybrid ant colony system for vehicle routing problem with time windows: Journal of the Eastern Asia Society for Transportation Studies, vol. 6(2005), p.2822.

Google Scholar

[3] G. B. Alvarenga and G. R. Mateus, G. Tomi. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows: Computers & Operations Research, vol. 34(2007), p.1561.

DOI: 10.1016/j.cor.2005.07.025

Google Scholar

[4] Y. J. Zhong and M. H. Cole. A vehicle routing problem with backhauls and time windows: a guided local search solution: Transportation Research Part E, Vol. 41(2005), p.131.

DOI: 10.1016/j.tre.2003.12.003

Google Scholar

[5] M. Dorigo, V. Maniezzo and A. Colorni. Positive feedback as a search strategy: Politecnico di Milano, Dipartimento di Elettronica, Milan, Italy. Tech. Rep. (1991).

DOI: 10.13052/jmm1550-4646.1511

Google Scholar

[6] A. Colorni, M. Dorigo, V. Maniezzo and M. Trubian. Ant system for job-shop scheduling problem: Belgian Journal of Operation Research, Statistics and Computer Science, Vol. 34(1994), p.39.

Google Scholar

[7] L. M. Gambardella, E. Taillard and M. Dorigo. Ant Colonies for QAP: IDSIA, Lugano, Switzerland, Tech1Rep1IDSIA (1997).

Google Scholar

[8] T. Stützle and H. Hoos. MAX-MIN Ant System: Future Generation Computer Systems, Vol. 16(2000), p.889.

DOI: 10.1016/s0167-739x(00)00043-1

Google Scholar

[9] J-Y Potvin and J-M Rousseau. An exchange heuristic for routing problems with time windows: Journal of the Operational Research Society, vol. 46(1995), p.1433.

DOI: 10.1057/jors.1995.204

Google Scholar