A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity

Transportation Science

Volumn 49, Issue 2, 2015, Pages 254-270

  Qu, Yuan ^a   Bard, Jonathan F ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Branch and price and cut; Configurable vehicle capacity; Dial a ride problem; Heterogeneous vehicles; Pickup and delivery problem

Indexed keywords

ALGORITHMS; CABS (TRUCK); COSTS; FLEET OPERATIONS; LINEAR PROGRAMMING; PICKUPS; TRUCKS; VEHICLE ROUTING; VEHICLES;

BRANCH-AND-PRICE-AND-CUT; DIAL-A-RIDE PROBLEM; HETEROGENEOUS VEHICLES; PICKUP AND DELIVERY PROBLEMS; VEHICLE CAPACITY;

INTEGER PROGRAMMING;

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

References (34)

1. Alexandrescu A (2001) Modern CCC Design: Generic Programming and Design Patterns Applied (Addison-Wesley, Boston).
2. Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2):414-426.
3. Bard JF, Jarrah AI (2009) A large-scale constrained clustering for rationalizing pickup and delivery operations. Transportation Res. Part B 43(5):542-561.
4. Bard JF, Nananukul N (2010) A two-stage supply chain planning problem with inventory routing. Comput. Oper. Res. 37(12): 2202-2217.
5. Bard JF, Kontoravdis G, Yu G (2002) A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Sci. 36(2):250-269.
6. Bard JF, Shao Y, Qi X, Jarrah AI (2014) The traveling therapist scheduling problem with fixed appointment times. IIE Trans. Oper. Engrg. Analytics 46(7):683-706.
7. Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(2a):1-31.
8. Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573-586.
9. Cordeau JF, Laporte G (2003) The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR 1:89-101.
10. Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1):7-22.
11. Dumitrescu I, Ropke S, Cordeau JF, Laporte G (2010) The travel salesman problem with pickup and delivery: Polyhedral results and a branch and cut algorithm. Math. Programming 121(2): 269-305.
12. Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216-229.
13. Irnich S, Desaulniers D (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33-65.
14. Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle routing problem with time windows. Oper. Res. 56(2):497-511.
15. Kohl N, Desrosiers J, Madsen OBG, Solomon MM, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1):101-116.
16. Li H, Lim A (2003) A metaheuristic for the pickup and delivery problem with time windows. Internat. J. Artificial Intelligence Tools 12(2):173-186.
17. Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Res. Part B 34(2b):107-121.
18. Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization (John Wiley & Sons, New York).
19. Parragh SN (2011) Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Res. Part C 19(5):912-930.
20. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58(2):81-117.
21. Parragh SN, Doerner KF, Hartl RF (2010) Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6): 1129-1138.
22. Qu Y (2012) The pickup and delivery problems with side constraints. Unpublished doctoral dissertation, University of Texas, Austin, http://repositories.lib.utexas.edu/handle/2152/19531.
23. Qu Y, Bard JF (2012) A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39(10):2439-2456.
24. Qu Y, Bard JF (2013) The heterogeneous pickup and delivery problem with configurable vehicle capacity. Transportation Res. Part C 32:1-21.
25. Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267-286.
26. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455-472.
27. Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258-272.
28. Ruland K, Rodin EY (1997) The pickup and delivery problem: Faces and branch-and-cut algorithm. Comput. Math. Appl. 33(12): 1-13.
29. Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (North-Holland, Amsterdam), 269-280.
30. Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17-29.
31. Sol M, Savelsbergh MWP (1994) A branch-and-price algorithm for the pickup and delivery problem with time windows. Memorandum COSOR 94-22, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
32. Spoorendonk S, Desaulniers G (2010) Clique inequalities applied to the vehicle routing problem with time windows. INFOR 48(1):53-67.
33. Wolsey LA (1998) Integer Programming (John Wiley & Sons, New York).
34. Xu H, Chen ZL, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transportation Sci. 37(3): 347-364.