Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem

Expert Systems with Applications

Volumn 37, Issue 2, 2010, Pages 1620-1627

  Chen, Ping ^a,b   Huang, Hou kuan ^b   Dong, Xing Ye ^b  

^a NANKAI UNIVERSITY   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Capacitated vehicle routing problem; Iterated local search; Perturbation; Variable neighborhood descent

Indexed keywords

BENCH-MARK PROBLEMS; CAPACITATED VEHICLE ROUTING PROBLEM; HYBRID HEURISTICS; ITERATED LOCAL SEARCH; LOCAL MINIMUMS; SET OF CUSTOMERS; TOTAL COSTS; WIDE SPECTRUM;

FLEET OPERATIONS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; VEHICLES;

ROUTING ALGORITHMS;

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

References (30)

1. Berger J., and Barkaoui M. A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society 54 (2004) 1254-1262
2. Christofides N., and Eilon S. An algorithm for the vehicle dispatching problem. Operational Research Quarterly 20 (1969) 309-318
3. 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, UK 315-338
4. 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
5. Cordeau J.F., Gendreau M., Hertz A., Laporte G., and Sormany J.S. New heuristics for the vehicle routing problem. In: Langevin A., and Riopel D. (Eds). Logistics systems: Design and optimization (2005), Springer, New York 279-297
6. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., and Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (2002) 512-522
7. Cordeau J.F., Laporte G., and Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52 (2001) 928-936
8. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 (1959) 80-91
9. Derigs U., and Kaiser R. Applying the attribute based hill climber heuristic to the vehicle routing problem. European Journal of Operational Research 177 (2007) 719-732
10. Ergun O., Orlin J.B., and Steele-Feldman A. Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics 12 (2006) 115-140
11. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1979), W.H. Freeman and Company, New York
12. Gendreau M., Laporte G., and Potvin J.Y. Metaheuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM Publishing, Philadelphia 129-154
13. Golden B.L., Wasil E.A., Kelly J.P., and Chao I. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets and computational results. In: Grainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer, Boston 33-56
14. Hansen P., and Mladenović N. Variable neighborhood search. In: Glover F.W., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Springer 145-184
15. Kytöjoki J., Nuortio T., Bräysy O., and Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research 34 (2007) 2743-2757
16. Laporte G., and Semet F. Classical heuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM Publishing, Philadelphia 110-111
17. Li F., Golden B., and Wasil E. Very large-scale vehicle routing: New test problems, algorithms, and results. Computers & Operations Research 32 (2005) 1165-1179
18. Lin S.W., Lee Z.J., Ying K.C., and Lee C.Y. Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Systems with Applications 36 2P1 (2009) 1505-1512
19. Lourenço H.R., Martin O.C., and Stützle T. Iterated local search. In: Glover F.W., and Kochenberger G.A. (Eds). Handbook of metaheuristics (2003), Springer 321-368
20. Mester D., and Bräysy O. Active guided evolution strategies for the large scale capacitated vehicle routing problems with time windows. Computers & Operations Research 32 (2005) 1593-1614
21. Mester D., and Bräysy O. Active guided evolution strategies for the large scale capacitated vehicle routing problems. Computers & Operations Research 34 (2007) 2964-2975
22. Mole R.H., and Jameson S.R. A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27 (1976) 503-511
23. Nagata Y. Edge assembly crossover for the capacitated vehicle routing problem. Evolutionary Computation in Combinatorial Optimization, LNCS 4446 (2007) 142-153
24. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers & Operations Research 34 (2007) 2403-2435
25. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31 (2004) 1985-2002
26. Reimann M., Doerner K., and Hartl R.F. D-ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31 (2004) 563-591
27. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
28. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 32 (2005) 2309-2327
29. Tarantilis C.D., and Kiranoudis C.T. Bone route: An adaptive memory-based method for effective fleet management. Annals of Operations Research 115 (2002) 227-241
30. Toth P., and Vigo D. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal of Computing 15 (2003) 333-348