Lifted and local reachability cuts for the vehicle routing problem with time windows

Computers and Operations Research

Volumn 40, Issue 8, 2013, Pages 2004-2010

  Avella, Pasquale ^a   Boccia, Maurizio ^a   Vasilyev, Igor ^b  

^a UNIVERSITY OF SANNIO   (Italy)

^b MATROSOV INSTITUTE FOR SYSTEM DYNAMICS AND CONTROL THEORY   (Russian Federation)

Author keywords

Vehicle Routing Problem with Time Windows Mixed Integer Programming Branch and Cut

Indexed keywords

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; EXACT ALGORITHMS; FLEET OF VEHICLES; MIXED INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; VALID INEQUALITY; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

ALGORITHMS; FLEET OPERATIONS; LINEAR PROGRAMMING; VEHICLE ROUTING;

SALES;

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

References (26)

1. D. Applegate, R. Bixby, V. Chvátal, and W. Cook Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems Mathematical Programming 97 2003 91 153
2. N. Ascheuer, M. Fischetti, and M. Grötschel A polyhedral study of the asymmetric traveling salesman problem with time windows Networks 36 2 2000 69 79
3. R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 5 2011 1269 1283
4. Baldacci R, Mingozzi A, Roberti R. Personal communication, 2010.
5. J.F. Bard, G. Kontoravdis, and G. Yu A branch-and-cut procedure for the vehicle routing problem with time windows Transportation Science 36 2 2002 250 269
6. A. Chabrier Vehicle routing problem with elementary shortest path based column generation Computers & Operations Research 33 10 2006 2972 2990
7. Cook W, Rich JL. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical Report. Rice University; 1999.
8. G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 3 2008 387 404
9. D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints application to some vehicle routing problems Networks 44 3 2004 216 229
10. M. Fischetti, and A. Lodi Optimizing over the first Chvátal closure Mathematical Programming B 110 1 2007 3 20
11. H. Gehring, and J. Homberger A parallel two-phase metaheuristic for routing problems with time windows Asia-Pacific Journal of Operational Research 18 2001 35 47
12. S. Irnich, and G. Desaulniers Shortest path problems with resource constraints G. Desaulniers, Jacques Desrosiers, M.M. Solomon, Column generation 2005 Springer 33 65
13. S. Irnich, and D. Villeneuve The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3 INFORMS Journal on Computing 18 3 2006 391 406
14. M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle routing problem with time windows Operations Research 56 2 2008 497 511
15. B. Kallehauge, N. Boland, and O.B.G. Madsen Path inequalities for the vehicle routing problem with time windows Networks 49 4 2007 273 293
16. B. Kallehauge, J. Larsen, and O.B.G. Madsen Lagrangian duality applied to the vehicle routing problem with time windows Computers & Operations Research 33 2006 1464 1487
17. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-Path cuts for the vehicle routing problem with time windows Transportation Science 33 1 1999 101 116
18. Lysgaard J. Cvrpsep package, available at 〈 http://www.hha.dk/lys/ 〉.
19. J. Lysgaard Reachability cuts for the vehicle routing problem with time windows European Journal of Operational Research 175 1 2006 210 223
20. B. Petersen, D. Pisinger, and S. Spoorendonk Chvátal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows B. Golden, R. Raghavan, E. Wasil, The vehicle routing problem latest advances and new challenges 2008 Springer 397 420
21. D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers & Operations Research 34 8 2007 2403 2435
22. T.K. Ralphs, L. Kopman, and W.R. Pulleyblank On the capacitated vehicle routing problem Mathematical Programming 94 2003 343 359
23. Raucq J. Real world routing problems. Available at 〈 http://www.raucq.be 〉.
24. G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
25. S. Ropke, J.F. Cordeau, and G. Laporte Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 4 2007 258 272
26. Spoorendonk S. Cut and column generation. PhD thesis. Denmark: DIKU, University of Copenhagen; 2008.