A new ILP-based refinement heuristic for vehicle routing problems

Mathematical Programming

Volumn 105, Issue 2-3, 2006, Pages 471-499

  De Franceschi, Roberto ^a   Fischetti, Matteo ^a   Toth, Paolo ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Computational Analysis; Distance Constrained Vehicle Routing Problem; Heuristics; Large Neighborhood Search; Vehicle Routing Problems

Indexed keywords

HEURISTIC METHODS; NUMBER THEORY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

DISTANCE-CONSTRAINED VEHICLE ROUTING PROBLEM; LARGE NEIGHBORHOOD SEARCH; VEHICLE ROUTING PROBLEMS;

MATHEMATICAL PROGRAMMING;

EID: 29044449517     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0662-8     Document Type: Conference Paper

References (45)

1. Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.B.: A survey of very large-scale neighborhood search techniques. Discrete Applied Math. 123, 75-102 (2002)
2. Balas, E., Simonetti, N.: Linear time dynamic programming algorithms for new classes of Restricted TSPs. Informs J. Comput. 13, 56-75 (2001)
3. Baldacci, R., Hadjiconstantinou, E.A., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 2004 (forthcoming)
4. Burkard, R.E., Deineko, V.G.: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood. Comput. 54, 191-211 (1995)
5. Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.-S.: New heuristics for the vehicle routing problem. In: A. Langevin, D. Riopel (eds.). Logistics Systems: Design and Optimization, Kluwer, Boston, 2005 forthcoming
6. Christofides, N., Eilon, S.: Expected distances in distribution problems. Oper. Res. Quarterly 20 (4), 437-443 (1969)
7. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. Combinatorial Optimization (Wiley, Chichester), 1979
8. Deineko, V.G., Woeginger, G.J.: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math. Programming 87, 519-542 (2000)
9. Dell' Amico, M., Fischetti, M., Toth, P.: Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. 39, 115-125 (1993)
10. Ergun, O.: New neighborhood search algorithms based on exponentially large neighborhoods. Operations Research Center Thesis, MIT, 2001
11. Ergun, O., Orlin, J.B.: Two dynamic programming methodologies in very large scale neighborhood search applied to the Traveling Salesman Problem. Working Paper 4463-03, MIT Sloan School of Management, 2003
12. Ergun, O., Orlin, J.B., Steele-Feldman, A.: A computational study on a large-scale neighborhood search algorithm for the vehicle routing problem with capacity and distance constraints. Working paper, School of Ind. and Sys. Engr. Georgia Institute of Technology, Atlanta, 2002
13. Ergun, O., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves: a study on the Vehicle Routing Problem. Working Paper 4393-02, MIT Sloan School of Management, 2002
14. Firla, R.T., Spille, B., Weismantel, R.: Exponentialirreducible neighborhoods for combinatorial optimization problems. Math. Meth. Oper. Res. 56, 29-44 (2002)
15. Fischetti, M., Lodi, A., Martello, S., Toth, P.: A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. 47 (6), 833-850 (2001)
16. Fischetti, M., Toth, P., Vigo, D.: A branch and bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper. Res. 42, 846-859 (1994)
17. Fisher, M.: Vehicle routing. In: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (eds.). Network Routing, Handbooks in OR & MS Vol. 8, Elsevier, Amsterdam, 1995
18. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11, 109-124 (1981)
19. Fukasawa, R., Poggi de Aragão, M., Reis, M., Uchoa, E: Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Relatórios de Pesquisa em Engenharia de Produção, RPEP 3 (8), Universidade Federal Fluminense, 2003
20. Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22, 340-349 (1974)
21. Gendreau, M., Hertz, A., Laporte, G.: A Tabu Search Heuristic for the VRP, Technical Reoprt CRT-777, 1991
22. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Sci. 40, 1276-1290 (1994)
23. Gendreau, M., Laporte, G., Potvin, J.-Y.: Metaheuristics for the capacitated VRP. In: P. Toth, D. Vigo (eds.). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, 2002
24. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I-M.: Metaheuristics in Vehicle Routing. In: T.G. Crainic, G. Laporte (eds.). Fleet Management and Logictics. Kluwer, Boston, 1998 pp. 33-56
25. Glover, F., Punnen, A.P.: The traveling salesman problem: New solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48, 502-510 (1997)
26. Gutin, G.M.: On an approach to solving the traveling salesman problem, Proc. The USSR Conference on System Research (Moscow, USSR), 1984 pp. 184-185 (in Russian)
27. Gutin, G.M.: Exponential neighborhood local search for the traveling salesman problem. Comput. Oper. Res. 26, 313-320 (1999)
28. Gutin, G., Yeo, A., Zverovitch, A.: Exponential neighborhoods and domination analysis for the TSP. In: G. Gutin, A. Punnen (eds.). The Traveling Salesman Problem and its Variations. Kluwer, 2002 pp. 223-256
29. ILOG Cplex 8.1: user's manual and reference manual, ILOG, S.A., http://www.ilog.com/, 2003
30. ILOG Concert Technology 1.2: User's manual and reference manual, ILOG, S.A., http: //www.ilog.com/, 2003
31. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: G. Gutin, A.P. Punnen (eds.). The Traveling Salesman Problem and Its Variations Kluwer Academic Publishers, 9, pp. 369-487, 2002
32. Laporte, G., Semet, E: Classical heuristics for the capacitated VRP. In: P. Toth, D. Vigo (eds.). The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications, Chap. 5, 2002
33. Li, F., Golden, B.L., Wasil, E.A.: Very large-scale vehicle routing: New test problems, algorithms, and results. Comput. Oper. Res. 2004 (forthcoming)
34. Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Prog. 100 (2), 423-442 2004
35. Mester, D., Braysy, O.: Active guided evolution strategies for the large scale vehicle routing problems with time windows. Comput. Oper. Res. 2004 (forthcoming)
36. Punnen, A.P.: The Traveling Salesman Problem: new polynomial approximation and domination analysis. J. Information Optim. Sci. 22, 191-206 (2001)
37. Ralphs, T.: Branch and Cut and Price Applications: Vehicle Routing, http://branchandcut.org/VRP/
38. Rego, C., Glover, E: Local search and metaheuristcs. In: G. Gutin, A. Punnen (eds.). The Traveling Salesman Problem and its Variations, Kluwer. 2002 pp. 309-368
39. Reimann, M., Doerner, K., Hartl, R.E.: D-Ants: Savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 2004 (forthcoming)
40. Sarvanov, V.I., Doroshko, N.N.: The approximate solution of the travelling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time, (in Russian), Software: Algorithms and Programs 31, Mathematical Institute of the Belorussian Academy of Sciences, Minsk, 1981, pp. 11-13
41. Taillard, E.: Eric Taillard's Page, Vehicle Routing Instances, http://ina.eivd.ch/collaborateurs/etd/problemes.dir/vrp.dir/vrp.html.
42. Tarantilis, C.-D., Kiranoudis, C.T.: Bone Route: An adaptive memory-based method for effective fleet management. Ann. Oper. Res. 115, 227-241 (2002)
43. Toth, P., Vigo, D.: An overview of vehicle routing problems. In: P. Toth, D. Vigo (eds.). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, 2002
44. Vigo, D.: VRPLIB: A Vehicle Routing Problem LIBrary, http://www.or.deis.unibo.it/research.pages/ORinstances/VRPLIB/VRPLIB.htm
45. Wenger, K.M.: Generic cut generation methods for routing problems. Ph.D Dissertation, Institute of Computer Science, University of Heidelberg, 2003