A new hybrid ant colony optimization algorithm for the vehicle routing problem

Pattern Recognition Letters

Volumn 30, Issue 9, 2009, Pages 848-855

  Zhang, Xiaoxia ^a   Tang, Lixin ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Ant colony optimization; Cyclic transfer; Hybrid ant colony optimization algorithm; Scatter search

Indexed keywords

ACO ALGORITHMS; ACO METHOD; ANT COLONY OPTIMIZATION; COMBINATION METHOD; COMPUTATIONAL REQUIREMENTS; CYCLIC TRANSFER; EXISTING METHOD; GREEDY HEURISTIC; HYBRID ALGORITHMS; HYBRID ANT COLONY OPTIMIZATION; HYBRID ANT COLONY OPTIMIZATION ALGORITHM; HYBRID METHOD; INITIAL SOLUTION; NEIGHBORHOOD SEARCH; NEIGHBORHOOD SEARCH ALGORITHMS; NEW CLASS; NEW SOLUTIONS; REFERENCE SET; SCATTER SEARCH; SOLUTION QUALITY; VEHICLE ROUTING PROBLEMS;

CIRCUIT THEORY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING;

SET THEORY;

EID: 67349276679     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2008.06.001     Document Type: Article

References (22)

1. Ahuja R.K., Orlin J.B., and Sharma D. Very large-scale neighborhood search. Internat. Trans. Oper. Res. 7 (2000) 301-317
2. Baker B.M., and Ayechew M.A. A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30 (2003) 787-800
3. Bell J.E., and McMullen P.R. Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18 (2004) 41-48
4. Bulleneimer, B., Hartl, R.F., Strauss, C., 1997. Strauss, applying the ant system to the vehicle routing problem. In: Proc. of the Second Internat. Conf. on Metaheuristics, pp. 1-12.
5. Bulleneimer B., Hartl R.F., and Strauss C. An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89 (1999) 319-328
6. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 (1964) 568-581
7. Clolrni A., Dorigo M., and Maniezzo V. Distributed optimization by ant colonies [A]. Proc. of the First European Conf. of Artificial Life (ECAL'91) (1991), Elsevier 134-142
8. Corberan A., Fernandez E., Laguna M., and Marti R. Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 53 4 (2002) 427-435
9. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. BioSystems 43 (1997) 73-81
10. Fisher M.A. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42 (1994) 626-642
11. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sci. 8 (1997) 156-166
12. Glover F. A template for scatter search and path relinking. In: Hao J.-K., Lutton E., Ronald E., Schoenauer M., and Snyers D. (Eds). Artificial Evolution. Lecture Notes in Computer Science vol. 1363 (1998), Springer-Verlag, Berlin, Heidelberg, New York 13-54
13. Greistorfer P. A tabu scatter search metaheuristic for the arc routing problem. Comput. Ind. Eng. 44 2 (2003) 249-266
14. Kelly J.P., and Xu J. A set-partitioning-based heuristic for the vehicle routing problem. INFORMS 11 2 (1999) 161-172
15. Marti M., Laguna M., and Glover F. Principles of scatter search. Eur. J. Oper. Res. 169 (2006) 359-372
16. Osman I.H. Metastrategy simulated annealing and Tabu search algorithms for the vehicle routing problem. Oper. Res. 41 (1993) 421-451
17. Rego C. A subpath ejection method for the vehicle routing problem. Manage Sci. 44 10 (1998) 1447-1458
18. Rochat Y., and Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 (1995) 147-167
19. Russell R.A., and Chiang W.C. Scatter search for the vehicle routing problem with time windows. Eur. J. Oper. Res. 169 (2006) 606-622
20. Taillard R.E. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-673
21. Thompson, P.M., Orlin, J.B., 1989. The theory cyclic transfers. Working Paper, Operations Research Center, MIT.
22. Thompson P.M., and Psaraftis H.N. Cyclic transfers algorithms for multivehicle routing and scheduling problem. Oper. Res. 41 5 (1993) 935-946