Branch and cut and price for the pickup and delivery problem with time windows

Transportation Science

Volumn 43, Issue 3, 2009, Pages 267-286

  Ropke, Stefan ^a   Cordeau, Jean François ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Branch and price; Column generation; Pickup and delivery; Valid inequalities

Indexed keywords

COSTS; GRAPH THEORY; LINEAR PROGRAMMING; PICKUPS; TRANSPORTATION ROUTES;

BRANCH AND CUT; BRANCH AND PRICE; COLUMN GENERATION; PICKUP AND DELIVERY; VALID INEQUALITY;

INTEGER PROGRAMMING;

EID: 70449631681     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0272     Document Type: Article

References (43)

1. Balas, E., M. Fischetti, W. R. Pulleyblank. 1995. The precedenceconstrained asymmetric traveling salesman polytope. Math. Programming 68 241-265.
2. Baldacci, R., N. Christofides, A. Migozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming, Ser. A 115 351-385.
3. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving integer programs. Oper. Res. 46 (3)316-329.
4. Boland, N., J. Detridge, I. Dumitrescu. 2006. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34 58-68.
5. Bramel, J., D. Simchi-Levi. 2002. Set-covering-based algorithms for the capacitated VRP. P. Toth, D. Vigo, eds. The Vehicle Routing Problem, Vol. 9. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 85-108.
6. Cordeau, J.-F. 2006. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54 (3)573-586.
7. Cordeau, J.-F., G. Laporte, J.-Y. Potvin, M. W. P. Savelsbergh. 2007. Transportation on demand. C. Barnhart, G. Laporte, eds. Transportation Handbooks in Operations Research and Management Science. Elsevier, Amsterdam, 429-466.
8. Dell'Amico, M., G. Rihigni, M. Salani. 2006. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Sci. 40 (2)235-247.
9. Desaulniers, G., F. Lessard, A. Hadjar. 2008. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42 (3)387-404.
10. Desaulniers, G., J. Desrosiers, A. Erdmann, M. M. Solomon, F. Soumis. 2002. VRP with pickup and delivery. P. Toth, D. Vigo, eds. The Vehicle Routing Problem, Vol. 9. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 225-242.
11. Desaulniers, G., J. Desrosiers, I. Ioachim, M. 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.
12. Desrochers, M., J. Desrosiers, M. Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 (2)342-354.
13. Desrosiers, J., Y. Dumas, F. Soumis. 1986. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Amer. J. Math. Management Sci. 6 301-325.
14. Dumas, Y., J. Desrosiers, F. Soumis. 1991. The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54 7-22.
15. Dumitrescu, I., S. Ropke, J.-F. Cordeau, G. Laporte. 2009. The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm. Math. Programming, Ser. A. Forthcoming. DOI 10.1007/s10107-008-0234-9.
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-andprice for the capacitated vehicle routing problem. Math. Programming, Ser. A 106 (3)491-511. (Pubitemid 43296485)
18. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation. Springer, New York, 33-65.
19. 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.
20. Jepsen, M., B. Petersen, S. Spoorendonk, D. Pisinger. 2008. Subsetrow inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56 (2)497-511.
21. 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.
22. Letchford, A. N., J. J. Salazar González. 2006. Projection results for vehicle routing. Math. Programming, Ser. B 105 251-274.
23. Li, H., A. Lim. 2001. A metaheuristic for the pickup and delivery problem with time windows. 13th IEEE Internat. Conf. Tools with Artificial Intelligence, ICTAI-2001, Dallas, IEEE, 160-167. (Pubitemid 34658736)
24. Lu, Q., M. Dessouky. 2004. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Sci. 38 (4)503-514.
25. Lysgaard, J. 2006. Reachability cuts for the vehicle routing problem with time windows. Eur. J. Oper. Res. 175 (1)210-223.
26. Naddef, D., G. Rinaldi. 2002. Branch-and-cut algorithms for the capacitated VRP. P. Toth, D. Vigo, eds. The Vehicle Routing Problem, Vol. 9. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 53-84.
27. Righini, G., M. Salani. 2006. Symmetry helps: Bounded bidirectional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3 (3)255-273.
28. Righini, G., M. Salani. 2008. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51 (3)155-170.
29. Ropke, S. 2005. Heuristic and exact algorithms for vehicle routing problems. Doctoral dissertation, Department of Computer Science, University of Copenhagen, Copenhagen.
30. Ropke, S., J.-F. Cordeau. 2008. Branch-and-cut-and-price for the pickup and delivery problem with time windows. Technical Report CIRRELT-2008-33, HEC Montréal, Montréal, Quebec, Canada.
31. Ropke, S., D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40 (4)455-472.
32. Ropke, S., J.-F. Cordeau, G. Laporte. 2007. Models and branch-andcut algorithms for pickup and delivery problems with time windows. Networks 49 (4)258-272.
33. Ruland, K. S., E. Y. Rodin. 1997. The pickup and delivery problem: Faces and branch-and-cut algorithm. Comput. Math. Appl. 33 (12)1-13.
34. Salani, M. 2005. Branch-and-price algorithms for vehicle routing problems. Ph. D. dissertation, Università of Milan, Milan.
35. Savelsbergh, M. W. P., M. Sol. 1995. The general pickup and delivery problem. Transportation Sci. 29 (1)17-29.
36. Savelsbergh, M. W. P., M. Sol. 1998. DRIVE: Dynamic routing of independent vehicles. Oper. Res. 46 (4)474-490.
37. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. CP-98 Fourth Internat. Conf. Principles and Practice of Constraint Programming, Vol. 1520, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 417-431.
38. Sigurd, M., D. Pisinger, M. Sig. 2004. Scheduling transportation of live animals to avoid the spread of diseases. Transportation Sci. 38 (2)197-209.
39. Sol, M. 1994. Column generation techniques for pickup and delivery problems. Unpublished doctoral dissertation, Technische Universiteit Eindhoven, Eindhoven, The Netherlands.
40. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 (2)254-265.
41. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem, Vol. 9, SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
42. Wolsey, L. A. 1998. Wiley-Interscience series in discrete mathematics. Integer Programming. Wiley-Interscience, New York.
43. Xu, H., Z.-L. Chen, S. Rajagopal, S. Arunapuram. 2003. Solving a practical pickup and delivery problem. Transportation Sci. 37 (3)347-364.