Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 2964-2975

  Mester, David ^a   Bräysy, Olli ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Evolution strategies; Guided local search; Heuristics; Vehicle routing

Indexed keywords

BENCHMARKING; HEURISTIC METHODS; PROBLEM SOLVING;

EVOLUTION STRATEGIES; GUIDED LOCAL SEARCH;

VEHICLE ROUTING;

EID: 33847671359     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.006     Document Type: Article

References (33)

1. Laporte G., Gendreau M., Potvin J.-Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operations Research 7 (2000) 285-300
2. Laporte G., and Semet F. Classical heuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2001), SIAM, Philadelphia 109-128
3. Gendreau M., Laporte G., and Potvin J.-Y. Metaheuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2001), SIAM, Philadelphia 129-154
4. 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
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. Toth P., and Vigo D. Branch-and-bound algorithms for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2001), SIAM, Philadelphia 29-52
7. Naddef D., and Rinaldi G. Branch-and-cut algorithms for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2001), SIAM, Philadelphia 53-84
8. Bramel J., and Simchi-Levi J. Set-covering-based algorithms for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2001), SIAM, Philadelphia 85-108
9. Mester D., and Bräysy O. Active guided evolution strategies for the large scale vehicle routing problem with time windows. Computers & Operations Research 32 (2005) 1593-1614
10. Mester D, Bräysy O, Dullaert W. A multi-parametric evolution strategies algorithm for vehicle routing problems. Working paper, University of Haifa, Israel, 2005.
11. Bent R., and Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38 (2004) 515-530
12. Voudouris C. Guided local search for combinatorial problems. PhD dissertation, University of Essex, UK, 1997.
13. Voudouris C., and Tsang E. Guided local search. European Journal of Operations Research 113 (1998) 80-119
14. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M., and Puget J.-F. (Eds). Principles and practice of constraint programming-CP98, lecture notes in computer science (1998), Springer, New York 417-431
15. Rechenberg I. Evolutionsstrategie (1973), Fromman-Holzboog, Stuttgart
16. Schwefel H.-P. Numerische optimierung von computer-modellen mittels der evolutionsstrategie (1977), Birkhäuser, Basel
17. Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Northwestern University, Evanston, USA, 1976.
18. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Annals of Operations Research 41 (1993) 421-452
19. Potvin J.-Y., and Rousseau J.-M. An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society 46 (1995) 1433-1446
20. Flood M.M. The traveling-salesman problem. Operations Research 4 (1956) 61-75
21. Savelsbergh M.W.P. The vehicle routing problem with time windows: minimizing route duration. INFORMS Journal on Computing 4 (1992) 146-154
22. Kytöjoki J, Nuortio T, Bräysy O, Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, in press, doi: 10.1016/j.cor.2005.10.010.
23. Mester D., Korol A., and Nevo E. Fast and high precision algorithms for optimization in large scale genomic problems. Computation Biology and Chemistry 28 (2004) 281-290
24. 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 315-338
25. Golden B.L., Wasil E.A., Kelly J.P., and Chao I.M. The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer, Boston 33-56
26. 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
27. Gehring H., and Homberger J. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Miettinen K., Mäkelä M., and Toivanen J. (Eds). In: Proceedings of EUROGEN99 (1999), University of Jyväskylä, Jyväskylä 57-64
28. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 32 (2005) 2309-2327
29. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
30. Toth P., and Vigo D. The granular tabu search (and its application to the vehicle routing problem). INFORMS Journal on Computing 15 (2003) 333-348
31. 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
32. Dongarra J. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Department of Computer Science, University of Tennessee, USA, 2005.
33. Pisinger D, Röpke S. A general heuristic for vehicle routing problems. Computers & Operations Research, in press, doi: 10.1016/j.cor.2005.09.012.