Subset-row inequalities applied to the vehicle-routing problem with time windows

Operations Research

Volumn 56, Issue 2, 2008, Pages 497-511

  Jepsen, Mads ^a   Petersen, Bjørn ^a   Spoorendonk, Simon ^a   Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; COSTS; VEHICLE ROUTING; WINDOWS;

ARC FLOWS; BRANCH-AND-CUT-AND-PRICE ALGORITHMS; COMPUTATIONAL EXPERIMENTS; DANTZIG-WOLFE DECOMPOSITIONS; DOMINANCE CRITERION; LABEL-SETTING ALGORITHMS; LOWER BOUNDS; OBJECTIVE FUNCTIONS; OPTIMALITY; PRICING PROBLEMS; RESOURCE CONSTRAINTS; ROOT NODES; SET-PARTITIONING PROBLEMS; SHORTEST-PATH PROBLEMS; TIME WINDOWS; VEHICLE-ROUTING PROBLEMS;

ROUTING ALGORITHMS;

EID: 61449183550     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0449     Document Type: Article

References (37)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 316-329.
2. Beasley, J. E., N. Christofides. 1989. An algorithm for the resource constrained shortest path problem. Networks 19 379-394.
3. Boland, N., J. Dethridge, I. Dumitrescu. 2006. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1) 58-68.
4. Caprara, A., M. Fischetti, A. N. Letchford. 2000. On the separation of maximally violated mod-k cuts. Math. Programming 87(1) 37-56.
5. Chabrier, A. 2005. Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 23(10) 2972-2990.
6. Chvatal, V. 1973. Edmonds polytopes and hierarchy of combinatorial problems. Discrete Math. 4 305-337.
7. COIN. 2005. COIN - COmputational INfrastructure for Operations Research. www.coin-or.org.
8. Cook, W., J. L. Rich. 1999. A parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical Report TR99-04, Computational and Applied Mathematics, Rice University, Houston, TX.
9. Danna, E., C. Le Pape. 2005. Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation, Chapter 3. Springer, New York, 90-130.
10. Desaulniers, G., J. Desrosiers, J. Ioachim, I. M. Solomon, F. Soumis, D. Villeneuve. 1998. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Norwell, MA, 57-93.
11. Desrochers, M. 1986. La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes. Ph.D. thesis, Université de Montréal, Montréal, Quebec, Canada.
12. Desrochers, M., J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 342-354.
13. Dror, M. 1994. Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42 977-979.
14. Dumitrescu, I. 2002. Constrained path and cycle problems. Ph.D. thesis, Department of Mathematics and Statistics, University of Melbourne, Melbourne, Australia.
15. Eisenbrand, F. 1999. Note on the membership problem for the elementary closure of a polyhedron. Combinatorica 19(2) 297-300.
16. Feillet, D., P. Dejax, M. Gendreau, C. Gueguen. 2004. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3) 216-229.
17. Fukasawa, R., H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa, R. F. Werneck. 2006. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3) 491-511.
18. Irnich, S. 2006. Resource extension functions: Properties, inversion, and generalization to segments. Technical Report 2006-01, Deutsche Post Endowed Chair of Optimization of Distribution Networks, RWTH Aachen University, Aachen, Germany. www.dpor.rwth-aachen.de.
19. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation, Chapter 2. Springer, New York, 33-65.
20. Irnich, S., D. Villeneuve. 2006. The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS J. Comput. 18(3) 391-406.
21. Jepsen, M., B. Petersen, S. Spoorendonk. 2005. A branch-and-cut-andprice framework for the VRP applied on CVRP and VRPTW. Master's thesis, DIKU, University of Copenhagen, Copenhagen, Denmark.
22. Kallehauge, B., J. Larsen, O. B. G. Madsen. 2000. Lagrangean duality and non-differentiable optimization applied on routing with time windows - Experimental results. Technical Report IMM-REP-2001-9, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
23. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1) 101-116.
24. Larsen, J. 1999. Parallelization of the vehicle routing problem with time windows. Ph.D. thesis, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark.
25. Lubbecke, M. E., J. Desrosiers. 2005. Selected topics in column generation. Oper: Res. 53(6) 1007-1023.
26. Lysgaard, J. 2003. CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. www.asb.dk/~lys.
27. Lysgaard, J., A. N. Letchford, R. W. Eglese. 2004. A new branch-and-cut algorithm for the capacitated vehicle problem. Math. Programming 100(2) 423-445.
28. Nemhauser, G., S. Park. 1991. A polyhedral approach to edge coloring. Oper. Res. Lett. 10 315-322.
29. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., New York.
30. Pisinger, D., L. B. Reinhardt. 2006. Multi-objective non-additive shortest path. Working paper, DIKU, University of Copenhagen, Copenhagen, Denmark.
31. Righini, G., M. Salani. 2004. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Technical Report 66, Note del Polo - Ricerca, Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, Milano, Italy.
32. Righini, G., M. Salani. 2005. New dynamic programming algorithms for the resource constrained shortest path problem. Technical Report 69, Note del Polo - Ricerca, Dipartimento di Tecnologie dell'Informazione, Università degli Studi di Milano, Milano, Italy.
33. Salani, M. 2005. Branch-and-price algorithms for vehicle routing problems. Ph.D. thesis, Università degli Studi di Milano, Facoltà di Scienza Matematiche, Fisiche e Naturali, Dipartimento di Technologie dell'Informazione, Milano, Italy.
34. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35 234-265.
35. SPEC. 2005. Standard Performance Evaluation Corporation. www.spec.org.
36. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Vol. 9. SIAM, Philadelphia, PA.
37. Wolsey, L. A. 1998. Integer Programming. John Wiley & Sons, Inc., New York.