A library of local search heuristics for the vehicle routing problem

Mathematical Programming Computation

Volumn 2, Issue 2, 2010, Pages 79-101

  Groër, Chris ^a   Golden, Bruce ^b   Wasil, Edward ^c  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c AMERICAN UNIVERSITY   (United States)

Author keywords

Heuristics; Metaheuristics; Optimization; Vehicle routing

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; EFFICIENT DATA STRUCTURES; HEURISTICS; LOCAL SEARCH HEURISTICS; META HEURISTICS; OBJECT-ORIENTED DESIGN; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

BENCHMARKING; COMBINATORIAL OPTIMIZATION; DATA STRUCTURES; HEURISTIC METHODS; OPTIMIZATION; ROUTING ALGORITHMS; VEHICLE ROUTING;

NETWORK ROUTING;

EID: 79955081124     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-010-0013-5     Document Type: Article

References (40)

1. Applegate, D., Bixby, R., Chvátal, V., Cook, W., Espinoza, D., Goycoolea, M., Helsgaun K.: The Concorde source code. http://www.tsp.gatech.edu/concorde.html (2010)
2. Applegate, D., Bixby, R., Chv́dftal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, NJ (2006)
3. Bräysy, O., Gendreau, M.:VRPTW, part I: Route construction and local search algorithms. Transp. Sci. 39, 104-118 (2005)
4. Bräysy, O., Gendreau, M.: VRPTW, part II: Metaheuristics. Transp. Sci. 39, 119-139 (2005)
5. Christofides, N., Eilon, S.: An algorithm for the vehicle dispatching problem. Oper. Res. Q. 20, 309-318 (1969)
6. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315-338. Wiley, Chichester, UK (1979)
7. COIN-OR. Open Solver Interface (OSI). https://projects.coin-or.org/Osi/ (2010)
8. Dueck, G.: New optimization heuristics: the great-deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86-92 (1993)
9. Fukasawa, R., Longo, H., Lysgaard, J., Poggi, D., Reis, M., Uchoa, E., Werneck, R.: Robust branchand-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491-511 (2006)
10. Gendreau, M., Potvin, J-Y., Bräysy, O., Hasle, G., Løkketangen, A.: Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 143-169. Springer, New York (2008)
11. Glover, F., Taillard, E.: A user's guide to tabu search. Ann. Oper. Res. 41(1), 1-28 (1993)
12. GLPK, The GNU Linear Programming Kit. http://www.gnu.org/software/glpk/ (2010)
13. Golden, B., Wasil, E., Kelly, J., Chao, I.-M.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, T., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33-56. Kluwer, Boston (1998)
14. Groër, C.: Parallel and serial algorithms for vehicle routing problems. Ph. D thesis, University of Maryland, College Park, MD (2008)
15. Groër, C.: The VRPH software. http://sites.google.com/site/vrphlibrary/ (2010)
16. Hassin, R., Keinan, A.: Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP. Oper. Res. Lett. 36(2), 243-246 (2008)
17. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Euro. J. Oper. Res. 126(1), 106-130 (2000)
18. Helsgaun, K.: The LKH source code. http://www.akira.ruc.dk/~keld/research/LKH/ (2010)
19. Kindervater, G., Savelsbergh, M.: Vehicle routing: handling edge exchanges. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 337-360. Princeton University Press, Princeton, NJ (2003)
20. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
21. Kytöjoki, J., Nuortio, T., Bräysy, O., Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 47(2), 329-336 (2005)
22. Le Bouthillier, A., Crainic, T.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32, 1685-1708 (2005)
23. Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms, and results. Comput. Oper. Res. 32, 1165-1179 (2005)
24. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 2245-2269 (1973)
25. Lodi, A., Punnen, A.: TSP software. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and its Variations, pp. 737-749. Kluwer, Dordrecht (2002)
26. Lysgaard, J.: CVRPSP: A package of separation routines for the capacitated vehicle routing problem. Working Paper 03-04 (2004)
27. Mester, D., Bräysy, O.: Active guided evolution strategies for the large scale vehicle routing problem with time windows. Comput. Oper. Res. 32, 1593-1614 (2005)
28. Mester, D., Bräysy, O.: Active-guided evolution strategies for large-scale vehicle routing problems. Comput. Oper. Res. 34, 2964-2975 (2007)
29. Nagata, Y., Bräysy, O.: Efficient local search limitation strategies for vehicle routing problems. In: Hemert, J., Cotta, C. (eds.) EvoCOP, Volume 4972 of Lecture Notes in Computer Science, pp. 48-60. Springer, Berlin (2008)
30. Nagata, Y., Bräysy, O.: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54, 205-215 (2009)
31. PLPlot: The PLPlot software package. http://plplot.sourceforge.net/ (2010)
32. Prins, C.: A GRASP evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F., Tavares, J. (eds.) Bio-Inspired Algorithms for the Vehicle Routing Problem, pp. 35-53. Springer, Berlin (2009)
33. Ralphs, T.: Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29, 607-620 (2003)
34. Ralphs, T., Guzelsoy, M., Mahajan, A.: The SYMPHONY source code. https://projects.coin-or.org/ SYMPHONY (2010)
35. Ralphs, T., Kopman, L., Pulleyblank, W., Trotter, L.: On the capacitated vehicle routing problem. Math. Program. 94, 343-359 (2003)
36. Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3, 376-384 (1991)
37. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147-167 (1995)
38. Taillard, E.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661-676 (1993)
39. Taillard, E.: VRP benchmarks. http://mistic.heig-vd.ch/taillard/problemes.dir/vrp.dir/vrp.html (1993)
40. Yellow, P.C.: A computational modification to the savings method of vehicle scheduling. Oper. Res. Q. 21, 281-293 (1970)