2-Path Cuts for the Vehicle Routing Problem with Time Windows

References

• Cornuejols G. , Harche F. Polyhedral study of the capacitated vehicle routing problem. Math. Program. (1993) 60 21 52 Crossref, Google Scholar
• CPLEX Optimization Using the CPLEX Callable Library and CPLEX Mixed Integer Library (1993) . CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd. Bldg. 803, Incline Village, NV 89451-9436 Google Scholar
• Desaulniers G. , Desrosiers J. , Ioachim I. , Solomon M. M. , Soumis F. , Villeneuve D. , Crainic T. , Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Dordrecht, The Netherland) 57 93 Crossref, Google Scholar
• Desrochers M. La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes. (1986) . Publication #470, Université de Montréal, Centre de recherche sur les Transports, CP 6128, Succursale A, Montréal, Québec, H3C 3J7, (In French) Google Scholar
• Desrochers M. , Desrosiers J. , Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Opns. Res. (1992) 40 342 354 Link, Google Scholar
• Desrosiers J. , Dumas Y. , Solomon M. M. , Soumis F. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science 8: Network Routing (1995) (North-Holland, Amsterdam, The Netherlands) 35 139 Google Scholar
• Desrosiers J. , Sauvé M. , Soumis F. Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. Management Sci. (1988) 34 1005 1022 Link, Google Scholar
• Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Opns. Res. (1995) 42 977 978 Link, Google Scholar
• Dumas Y. , Desrosiers J. , Gélinas E. , Solomon M. M. An optimal algorithm for the traveling salesman problem with time windows. Opns. Res. (1995) 43 367 371 Link, Google Scholar
• Fisher M. L. Optimal solution of vehicle routing problems using minimum K-trees. Opns. Res. (1994) 42 626 642 Link, Google Scholar
• Fisher M. L. , Jörnsten K. O. , Madsen O. B. G. Vehicle routing with time windows—Two optimization algorithms. Opns. Res. (1997) 45 488 498 Link, Google Scholar
• Gélinas S. , Desrochers M. , Desrosiers J. , Solomon M. M. A new-branching strategy for time constrained routing problems with application to backhauling. Ann. Opns. Res. (1995) 61 91 109 Crossref, Google Scholar
• Geoffrion A. M. Lagrangean relaxation and its uses in linear programming. Math. Programming Stud. (1974) 2 82 114 Crossref, Google Scholar
• Guignard M. , Kim S. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Program. (1987) 39 215 228 Crossref, Google Scholar
• Houck D. J. , Picard J.-C. , Queyranne M. , Vemuganti R. R. The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch (1980) 17 93 109 Google Scholar
• Halse K. Modeling and solving complex vehicle routing problems. (1992) . Ph.D. dissertation no. 60, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, DK-2800 Lyngby, Denmark Google Scholar
• Ioachim I. , Gélinas S. , Desrosiers J. , Soumis F. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks (1998) 31 193 204 Crossref, Google Scholar
• Jörnsten K. , Madsen O. B. G. , Sørensen B. Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting. (1986) . Research report 5/1986, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, DK-2800 Lyngby, Denmark Google Scholar
• Jörnsten K. , Näsberg M. , Smeds P. Variable splitting—A new approach to some mathematical programming models. (1985) . Report LITH-MAT-85-04, Department of Mathematics, Linköping Institute of Technology, Sweden Google Scholar
• Jünger M. , Reinelt G. , Rinaldi G. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. The travelling salesman problem. Handbooks in Operations Research and Management Science 7: Network Models (1995) (North-Holland, Amsterdam, The Netherlands) 225 330 Google Scholar
• Kohl N. Exact methods for time constrained routing and related scheduling problems. (1995) . Ph.D. dissertation no. 16, Institute of Mathematical Modelling, Technical University of Denmark, DK-2800 Lyngby, Denmark Google Scholar
• Kohl N. , Madsen O. B. G. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation. Opns. Res. (1997) 45 395 406 Link, Google Scholar
• Kolen A. W. J. , Rinnooy Kan A. H. G. , Trienekens H. W. J. M. Vehicle routing with time windows. Opns. Res. (1987) 35 256 273 Link, Google Scholar
• Laporte G. , Nobert Y. , Desrochers M. Optimal routing under capacity and distance restrictions. Opns. Res. (1985) 33 1050 1073 Link, Google Scholar
• Olsen B. Routing with time constraints: Exact solutions. (1988) . MSc thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, DK-2800 Lyngby, Denmark, (In Danish) Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Opns. Res. (1987) 35 254 265 Link, Google Scholar