An optimization algorithm for the capacitated vehicle routing problem based on ant colony system

Australian Journal of Basic and Applied Sciences

Volumn 5, Issue 12, 2011, Pages 2729-2737

  Khoshbakht, Majid Yousefi ^a   Sedighpour, Mohammad ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

3 opt algorithm; Ant colony system; Capacitated vehicle routing problem; Meta heuristic algorithms

Indexed keywords

EID: 84856424462     PISSN: 19918178     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (46)

1. Baker, B.M., M.A. Ayechew, 2003. A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30: 787-800.
2. Bin, W.U., S.H.I. Zhongzhi, 2001. A kind of subsection algorithm based on ACO solving the TSP problem, Computer transaction., 1328-1333.
3. Bin, Y., Y. Zhong-Zhen, Y. Baozhen, 2009. An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196: 171-176.
4. Bodin, L.D., B. Golden and A. Bender, 1983. The state of the art in the routing and scheduling of vehicle and crews. Computers and Operations Research, 10: 79-116.
5. Bullnheimer, B., R.F. Hartl, C. Strauss, 1999. An improved ant system algorithm for the vehicle routing problem, Ann. Operations Research, pp: 89.
6. Christofides, N., A. Mingozzi and P. Toth, 1979. The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C, editors. Combinatorial optimization. Chichester:Wiley, pp: 315-338.
7. Christofides, N., A. Mingozzi and P. Toth, 1981. Exact algorithm for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20: 255-282.
8. Clarke, G. and J.W. Wright, 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12: 568-581.
9. Cordeau, J.F., M. Gendreau, 2002. Laporte, G., Potvin, J. Y. and Semet, F. A. A, guide to vehicle routing heuristic. Journal of the Operational Research Society, 53: 512-522.
10. Croes, G.A., 1958. A method for solving the traveling salesman problems, Operations Research, 6: 791-812.
11. Di Caro, G., M. Dorigo, 1998. AntNet: distributed stigmergetic control for communications networks, J. Artificial Intelligent Research, 9: 317-365.
12. Dorigo, M, 1992. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, pp: 140.
13. Dorigo, M., E. Bonabeau, G. Theraulaz, 2000. Ant algorithms and stigmergy, this issue, Future Generation Computer Systems, 16: 851-871.
14. Fisher, M.L., 1994. Optimal solution of vehicle routing problems using minimum K-trees, Operations Research, 42: 626-642.
15. Gambardella, L.M., M. Dorigo, 1997. HAS-SOP: hybrid ant system for the sequential ordering problem, Technical Report IDSIA 11-97, IDSIA, Lugano, Switzerland.
16. Garey, M.R., D.S. Johnson, 1979. Computers and intractability: a guide to the theory of NP completeness. New York: W.H. Freeman & Co.
17. Gendreau, M., A. Hertz and G. Laporte, 1994. A tabu search heuristic for the vehicle routing problem, Management Science, 40: 1276-1290.
18. Gillett, B.E. and L.R. Miller, 1974. A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22: 340-349.
19. Hashemi, S.M., M. Yousefikhoshbakht, A. Zafari, 2009. Solving Multiple Traveling Salesman Problem by A modified Elite Ant Colony System, the 40th Annual Iranian Mathematics Conference (AIMC), Sharif University of Technology, Tehran, Iran, (In Persian).
20. Hong, l., 2012. An improved LNS algorithm for real-time vehicle routing problem with time windows, Computers & Operations Research, 39(2): 151-163.
21. http://mistic.heig-vd.ch/taillard/problemes.dir/vrp.dir/taillard.dir
22. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/
23. Laporte, G., 1992. The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research, 59: 345-358.
24. Leung, S.C.H., X. Zhou, D. Zhang and. J. Zheng, 2011. Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, Computers & Operations Research, 38(1): 205-215.
25. Lin, S.W., Z.J. Lee, K.C. Ying, C.Y. Lee, 2009. Applying hybrid meta-heuristic for capacitated vehicle routing problem, Expert Systems with Applications., 36: 1505-1512.
26. Maniezzo, V., 1999. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem, INFORMS J. on Computing, 11: 358-369.
27. Michel, R., M. Middendorf, 1998. An island based ant system with lookahead for the shortest common super sequence problem, in: A.E. Eiben, T. Bäck, M. Schoenauer, H.-P. Schwefel (Eds.), Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer, Berlin, 1498: 692-708.
28. Osman, I.H., 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, 41: 421-451.
29. Paessens, H., 1988. The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34: 336-344.
30. Pisinger, D. and S. Ropke, 2010. Large neighborhood search. In: Gendreau M, Potvin J-Y, editors. Handbook of Metaheuristics of International Series in Operations Research & Management Science, 146: 399-419.
31. Potvin, J.Y., D. Dube and C. Robillard, 1996. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Applied Intelligence, 6: 241-252.
32. Prins, C., 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31: 1985-2002.
33. Prins, C., 2009. Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence., 22: 916-928.
34. Qinghong, W.U., 1999. Zhang, Jihui, ACO with the characteristic of Mutation, Computer research and development., pp: 240-245.
35. Reimann, M., S. Shtovba and E. Nepomuceno, 2001. A hybrid ACO-GA approach to solve Vehicle Routing Problems, Student Papers of the Complex Systems Summer School, Budapest, Santa Fe Institute.
36. Renaud, J., F.F. Boctor and G. Laporte, 1996. An improved petal heuristic for the vehicle routing problem. Journal of the Operational Research Society, 47: 329-336.
37. Rochat, Y. and E.D. Taillard, 1995. Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristic., 1: 147-167.
38. Rochat, Y., E. Taillard, 1995. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristic, 1: 147-67.
39. Schulze, J., T. Fahle, 1999. A parallel algorithm for the vehicle routing problem with time window constraints, Combinatorial Optimization: Recent Advances in Theory and Praxis, Special volume of Annals of Operations Research, 86: 585-607.
40. Stutzle, T., H.H. Hoos, 1997. The MAX-MIN ant system and local search for the traveling salesman problem, in: T. Bäck, Z. Michalewicz, X. Yao (Eds.), Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'97), IEEE Press, Piscataway, USA, pp: 309-314.
41. Taillard, R.E., 1993. Parallel iterative search methods for vehicle routing problems. Networks, 23: 661-673.
42. Wang, CH., J.Z. Lu, A hybrid genetic algorithm that optimizes capacitated vehicle routing problems, Expert Systems with Applications., 36: 2921-2936.
43. Wassan, N.A., I.H. Osman, Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society, 53: 768-782.
44. Yousefikhoshbakht, M., A. Zafari, 2008. A New Ant Colony Algorithm for Solving Multiple Traveling Salesman Problem The 2th Joint Congress on Intelligent and Fuzzy Systems (ISFS2008), Malek-Ashtar University of Technology,Tehran, Iran, (in persian).
45. Yousefikhoshbakht, M., A. Zafari, 2009. Mixing Ant Colony Algorithm and Simulated Algorithm Based on Escaping from Local Optimum Points, The second International Conference of Iranian Operations Research Society, Mazandaran University, Babolsar - Iran, (In persian).
46. Zhang, X., L. Tang, 2009. A new hybrid ant colony optimization algorithm for the vehicle routing problem Pattern Recognition Letters, 30: 848-855.