Reachability cuts for the vehicle routing problem with time windows

European Journal of Operational Research

Volumn 175, Issue 1, 2006, Pages 210-223

  Lysgaard, Jens ^a  

^a AARHUS SCHOOL OF BUSINESS   (Denmark)

Author keywords

Precedence constraints; Routing; Time windows

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

PRECEDENCE CONSTRAINTS; ROUTING; TIME WINDOWS; VEHICLE ROUTING PROBLEM;

OPERATIONS RESEARCH;

EID: 33749124514     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.04.022     Document Type: Article

References (15)

1. Ahuja R.K., Kodialam M., Mishra A.K., and Orlin J.B. Computational investigations of maximum flow algorithms. European Journal of Operational Research 97 (1997) 509-542
2. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: Theory, Algorithms, and Applications (1993), Prentice-Hall
3. Ascheuer N., Fischetti M., and Grötschel M. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90 (2001) 475-506
4. Balas E., Fischetti M., and Pulleyblank W.R. The precedence-constrained asymmetric traveling salesman polytope. Mathematical Programming 68 (1995) 241-265
5. Bard J.F., Kontoravdis G., and Yu G. A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36 (2002) 250-269
6. Carraghan R., and Pardalos P.M. An exact algorithm for the maximum clique problem. Operations Research Letters 9 (1990) 375-382
7. Cook W., and Rich J.L. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical Report, Computational and Applied Mathematics (1999), Rice University
8. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, F. Soumis, VRP with time windows, in: P. Toth, D. Vigo, editors, The Vehicle Routing Problem, chapter 7. SIAM Monographs on Discrete Mathematics and Applications, 2002.
9. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
10. Fischetti M., Lodi A., Martello S., and Toth P. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science 47 (2001) 833-850
11. Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., and Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33 (1999) 101-116
12. A.N. Letchford, J.-J. Salazar-González, Projection results for vehicle routing, Mathematical Programming, in press.
13. J. Lysgaard, CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Working Paper 03-04, Department of Management Science and Logistics, Aarhus School of Business. Available at www.asb.dk/~lys, 2003.
14. Lysgaard J., Letchford A.N., and Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100 (2004) 423-445
15. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 (1987) 254-265