An exact algorithm for the pickup and delivery problem with time windows

Operations Research

Volumn 59, Issue 2, 2011, Pages 414-426

  Baldacci, Roberto ^a   Bartolini, Enrico ^b   Mingozzi, Aristide ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Column generation; Dual ascent; Pickup and delivery; Set partitioning

Indexed keywords

BOUNDING PROCEDURES; BRANCH-AND-CUT-AND-PRICE ALGORITHM; COLUMN GENERATION; COMPUTATIONAL RESULTS; DUAL ASCENT; DUAL SOLUTIONS; EXACT ALGORITHMS; EXACT METHODS; INTEGRALITY GAPS; LOWER BOUNDS; LP-RELAXATION; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; PRECEDENCE CONSTRAINTS; REDUCED COST; SET PARTITIONING; TIME WINDOWS; UPPER BOUND; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

ALGORITHMS; INTEGER PROGRAMMING; PICKUPS;

VEHICLE ROUTING;

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

References (18)

1. Baldacci, R., N. Christofides, A. Mingozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming Ser. A 115(2) 351-385.
2. Boschetti, M. A., A. Mingozzi, S. Ricciardelli. 2008. A dual ascent procedure for the set partitioning problem. Discrete Optim. 5(4) 735-747.
3. Christofides, N., A. Mingozzi, P. Toth. 1981a. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming 20(1) 255-282. (Pubitemid 12508234)
4. Christofides, N., A. Mingozzi, P. Toth. 1981b. State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2) 145-164. (Pubitemid 13506977)
5. Cordeau, J.-F. 2006. A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3) 573-586. (Pubitemid 43838367)
6. Cordeau, J.-F., G. Laporte, S. Ropke. 2008. Recent models and algorithms for one-to-one pickup and delivery problems. B. Golden, S. Raghavan, E.Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 327-357.
7. Cordeau, J.-F., G. Laporte, J.-Y. Potvin, M. W. P. Savelsbergh. 2007. Transportation on demand. C. Barnhart, G. Laporte, eds. Transportation. Elsevier, Amsterdam, 429-466.
8. 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. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 225-242.
9. 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.
10. Dumas, Y., J. Desrosiers, F. Soumis. 1991. The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1) 7-22. (Pubitemid 21712574)
11. Jepsen, M., B. Petersen, S. Spoorendonk, D. Pisinger. 2008. Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2) 497-511.
12. Li, H., A. Lim. 2001. A metaheuristic for the pickup and delivery problem with time windows. 13th IEEE Internat. Conf. Tools Artificial Intelligence, ICTAI-2001, Dallas.
13. Lu, Q., M. Dessouky. 2004. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Sci. 38(4) 503-514.
14. Parragh, S. N., K. F. Doerner, R. F. Hartl. 2008a. A survey on pickup and delivery problems (Part I: Transportation between customers and depot). J. für Betriebswirtschaft 58(1) 21-51.
15. Parragh, S. N., K. F. Doerner, R. F. Hartl. 2008b. A survey on pickup and delivery problems (Part II: Transportation between pickup and delivery locations). J. für Betriebswirtschaft 58(2) 81-117.
16. Ropke, S., J.-F. Cordeau. 2009. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3) 267-286.
17. Ropke, S., J.-F. Cordeau, G. Laporte. 2007. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4) 258-272. (Pubitemid 47324734)
18. Savelsbergh, M. W. P., M. Sol. 1998. Drive: Dynamic routing of independent vehicles. Oper. Res. 46(4) 474-490. (Pubitemid 128665758)