Applying hybrid meta-heuristics for capacitated vehicle routing problem

Expert Systems with Applications

Volumn 36, Issue 2 PART 1, 2009, Pages 1505-1512

  Lin, Shih Wei ^a,b   Lee, Zne Jung ^b   Ying, Kuo Ching ^b   Lee, Chou Yuan ^c  

^a CHANG GUNG UNIVERSITY   (Taiwan)

^b HUAFAN UNIVERSITY   (Taiwan)

^c LAN YANG INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Capacitated vehicle routing problem; Hybrid algorithm; Simulated annealing; Tabu search

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; HYBRID VEHICLES; SIMULATED ANNEALING; TABU SEARCH; VEHICLE ROUTING;

CAPACITATED VEHICLE ROUTING PROBLEM; HYBRID ALGORITHMS; HYBRID METAHEURISTICS; OPTIMAL SETS; PROBLEM SIZE;

PROBLEM SOLVING;

EID: 56649112895     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.11.060     Document Type: Article

References (36)

1. Alfa A.S., Heragu S.S., and Chen M. A 3-opt based simulated annealing algorithm for vehicle routing problem. Computers & Industrial Engineering 21 (1991) 635-639
2. Baker B.M., and Ayechew M.A. A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30 (2003) 787-800
3. Beasley J.E. Route first-cluster second methods for vehicle routing. Omega 11 (1983) 403-408
4. Bell J.E., and McMullen P.R. Ant colony optimization techniques for the vehicle routing. Advanced Engineering Informatics 18 (2004) 41-48
5. Bullnheimer B., Hartl R.F., and Strauss C. An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
6. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi C. (Eds). Combinatorial Optimization (1979), Wiley, Chichester 325-338
7. Christofides N., Mingozzi A., and Toth P. Exact algorithm for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming 20 (1981) 255-282
8. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
9. David M., Olli B., and Wout D. A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems with Applications 32 (2007) 508-517
10. Fisher M.L., and Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks 11 (1981) 109-124
11. Gendreau M.P., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
12. Gillett B., and Johnson J. Multi-terminal vehicle-dispatch algorithm. Omega 4 (1976) 711-718
13. Gillett B.E., and Miller L.R. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 (1974) 340-349
14. Glover F. Tabu search-Part I. ORSA Journal on Computing 1 (1989) 190-206
15. Glover F. Tabu search-Part II. ORSA Journal on Computing 2 (1990) 4-32
16. Haimovich M., and Kan A.H.G.R. Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10 (1985) 527-542
17. Ho S.C., and Gendreau M. Path relinking for the vehicle routing problem. Journal of Heuristics 12 (2006) 55-72
18. Kirkpatrick S., Gelatt C.D., and Vecchi J.M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
19. Laporte, G. & Semet, F. (2001). The vehicle routing problem. In P. Toth, D. Vigo (Eds.), SIAM monographs on discrete mathematics and application (pp. 109-125). Philadelphia.
20. Lee Z.-J., and Lee C.-Y. A hybrid search algorithm with heuristics for resource allocation problem. Information Sciences 173 (2005) 155-167
21. Lee Z.-J., Lee C.-Y., and Su S.-F. An immunity based ant colony optimization algorithm for solving weapon-target assignment problem. Applied Soft Computing 2 (2002) 39-47
22. Lee Z.-J., Su S.-F., and Lee C.-Y. Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics. IEEE Transactions on Systems, Man and Cybernetics, Part B 33 (2003) 113-121
23. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
24. Mazzeo S., and Loiseau I. An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Mathematics 18 (2004) 181-186
25. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., and Teller E. Equations of state calculations by fast computing machines. Journal of Chemical Physics 21 (1953) 1087-1092
26. Mole R.H., and Jameson S.R. A sequential route-building algorithm employing a generalised savings criterion. Operation Research Quarterly 27 (1976) 503-511
27. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
28. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computer & Operation Research 31 (2004) 1985-2002
29. Rego C., and Roucairol C. A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman I.H., and Kelly J.P. (Eds). Meta-Heuristics: Theory and Applications (1996), Kluwer, MA, Boston 661-675
30. Robusté F., Daganzo C.F., and Souleyrette I.I.R. Implementing vehicle routing models. Transportation Research 24B (1990) 263-286
31. Rochat Y., and Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
32. Taillard E.D. Parallel iterative search methods for vehicle routing problem. Networks 23 (1993) 661-673
33. Toth P., and Vigo D. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing 15 (2003) 333-346
34. Xu J., and Kelly J.P. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science 30 (1996) 379-393
35. Yellow P.C. A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly 21 (1970) 281-283
36. Zeng L., Ong H.L., and Ng K.M. An assignment-based local search method for solving vehicle routing problems. Asia-Pacific Journal of Operational Research 22 (2005) 85-104