Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading

Transportation Science

Volumn 49, Issue 4, 2015, Pages 752-766

  Cherkesly, Marilène ^a,b   Desaulniers, Guy ^a,b   Laporte, Gilbert ^b,c,d  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b GERAD   (Canada)

^c HEC MONTRÉAL   (Canada)

^d INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch price and cut; Column generation; Last in first out loading; Valid inequalities; Vehicle routing with pickup and delivery

Indexed keywords

ALGORITHMS; COSTS; CRASHWORTHINESS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; PICKUPS; UNLOADING; VEHICLE ROUTING; VEHICLES;

BRANCH-PRICE-AND-CUT; COLUMN GENERATION; LAST IN FIRST OUTS; PICKUP AND DELIVERY; VALID INEQUALITY;

LOADING;

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

References (26)

1. Baldacci R, Bartolini E, Mingozzi A (2011a) An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2):414-426.
2. Baldacci R, Mingozzi A, Roberti R (2011b) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269-1283.
3. Baldacci R, Bartolini E, Mingozzi A, Roberti R (2010) An exact solution framework for a broad class of vehicle routing problems. Computational Management Sci. 7(3):229-268.
4. Battarra M, Erdoʇan G, Laporte G, Vigo D (2010) The traveling salesman problem with pickups, deliveries, and handling costs. Transportation Sci. 44(3):383-399.
5. Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(1):1-31.
6. Carrabs F, Cerulli R, Cordeau J-F (2007) An additive branch-andbound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR 45(4):223-238.
7. Cheang B, Gao X, Lim A, Qin H, Zhu W (2012) Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur. J. Oper. Res. 223(1):60-75.
8. Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573-586.
9. Cordeau J-F, Iori M, Laporte G, Salazar González JJ (2010) A branchand-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1):46-59.
10. Desaulniers G, Desrosiers J, Solomon MM, eds. (2005) Column Generation (Springer, New York).
11. Desaulniers G, Desrosiers J, Spoorendonk S (2011) Cutting planes for branch-and-price algorithms. Networks 58(4):301-310.
12. Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387-404.
13. Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F (2002) VRP with pickup and delivery. Toth P, Vigo D, eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, (SIAM, Philadelphia), 225-242.
14. Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342-354.
15. Erdoʇan G, Battarra M, Laporte G, Vigo D (2012) Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Comput. Oper. Res. 39(5):1074-1086.
16. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33-65.
17. 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.
18. Kallehauge B, Larsen J, Madsen OBG, Solomon MM (2005) Vehicle routing problem with time windows. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 67-98.
19. 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.
20. Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, (SIAM, Philadelphia), 53-84.
21. Parragh S, Doerner KF, Hartl RF (2008a) A survey on pickup and delivery problems, Part I: Transportation between customers and depot. J. für Betriebswirtschaft 58(1):21-51.
22. Parragh S, Doerner KF, Hartl RF (2008b) A survey on pickup and delivery problems, Part II: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58(2):81-117.
23. Ropke S, Cordeau J-F (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.
24. Ropke S, Cordeau J-F (2009) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267-286.
25. Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258-272.
26. Sol M (1994) Column generation techniques for pickup and delivery problems. Ph. D. thesis, Technische Universitet Eindhoven, Netherlands.