Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

European Journal of Operational Research

Volumn 250, Issue 3, 2016, Pages 782-793

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

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

^b GERAD   (Canada)

^c JOHANNES GUTENBERG UNIVERSITY MAINZ   (Germany)

^d HEC MONTRÉAL   (Canada)

^e INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch price and cut; Column generation; Loading constraints; Valid inequalities; Vehicle routing with pickups and deliveries

Indexed keywords

AGRICULTURE; ALGORITHMS; BENCHMARKING; COSTS; GRAPH THEORY; LINEAR PROGRAMMING; MATERIALS HANDLING; PICKUPS; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

BRANCH-PRICE-AND-CUT; COLUMN GENERATION; COMPUTATIONAL RESULTS; LOADING CONSTRAINTS; MODELS AND ALGORITHMS; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; VALID INEQUALITY;

PROBLEM SOLVING;

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

References (29)

1. Alba Martínez M., Cordeau J.-F., Dell'Amico M., and Iori M. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks INFORMS Journal on Computing 25 1 2013 41 55
2. Baldacci R., Bartolini E., and Mingozzi A. An exact algorithm for the pickup and delivery problem with time windows Operations Research 59 2 2011 414 426
3. Baldacci R., Bartolini E., Mingozzi A., and Roberti R. An exact solution framework for a broad class of vehicle routing problems Computational Management Science 7 2010 229 268
4. Baldacci R., Mingozzi A., and Roberti R. New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 5 2011 1269 1283
5. Battara M., Cordeau J.-F., and Iori M. Pickup-and-delivery problems for goods transportation P. Toth, D. Vigo, Vehicle routing: Problems, methods, and applications 2nd ed. 2014 Society for Industrial and Applied Mathematics Philadelphia 161 191
6. Berbeglia G., Cordeau J.-F., Gribkovskaia I., and Laporte G. Static pickup and delivery problems: A classification scheme and survey TOP 15 2007 1 31
7. Carrabs F., Cerulli R., and Cordeau J.-F. An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading INFOR 45 4 2007 223 238
8. Carrabs F., Cordeau J.-F., and Laporte G. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading INFORMS Journal on Computing 19 4 2007 618 632
9. Cherkesly M., Desaulniers G., and Laporte G. Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading Transportation Science 49 4 2015 752 766
10. Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem Operations Research 54 3 2006 573 586
11. Cordeau J.-F., Iori M., Laporte G., and Salazar González J. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading Networks 55 1 2010 46 59
12. Côté J.-F., Archetti C., Speranza M., Gendreau M., and Potvin J.-Y. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks Networks 60 4 2012 212 226
13. Côté J.-F., Gendreau M., and Potvin J.-Y. Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks Networks 60 1 2012 19 30
14. Desaulniers G., Desrosiers J., and Solomon M.M. Column generation 2005 Springer New York
15. Desaulniers G., Desrosiers J., and Spoorendonk S. Cutting planes for branch-and-price algorithms Networks 58 4 2011 301 310
16. Desaulniers G., Lessard F., and Hadjar A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 3 2008 387 404
17. Iori M., and Riera-Ledesma J. Exact algorithms for the double vehicle routing problem with multiple stacks Computers & Operations Research 63 2015 83 101
18. Jepsen M., Petersen B., Spoorendonk S., and Pisinger D. Subset-row inequalities applied to the vehicle-routing problem with time windows Operations Research 56 2 2008 497 511
19. Kohl N., Desrosiers J., Madsen O., Solomon M., and Soumis F. 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1 1999 101 116
20. Lusby R., Larsen J., Ehrgott M., and Ryan D. An exact method for the double TSP with multiple stacks International Transactions in Operational Research 17 5 2010 637 652
21. Naddef D., and Rinaldi G. Branch-and-cut algorithms for the capacitated VRP P. Toth, D. Vigo, The vehicle routing problem. SIAM monographs on discrete mathematics and applications 2002 Society for Industrial and Applied Mathematics Philadelphia 53 84
22. Parragh S., Doerner K., and Hartl R. A survey on pickup and delivery problems, Part I: Transportation between customers and depot Journal für Betriebswirtschaft 58 2008 21 51
23. Parragh S., Doerner K., and Hartl R. A survey on pickup and delivery problems, Part II: Transportation between pickup and delivery locations Journal für Betriebswirtschaft 58 2008 81 117
24. Petersen H., Archetti C., and Speranza M. Exact solutions to the double travelling salesman problem with multiple stacks Networks 56 4 2010 229 243
25. Petersen H., and Madsen O. The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches European Journal of Operational Research 198 1 2009 139 147
26. Ropke S., and Cordeau J.-F. Branch-and-cut-and-price for the pickup and delivery problem with time windows Technical report 2008 CIRRELT-2008-33, HEC Montréal, Montréal
27. Ropke S., and Cordeau J.-F. Branch-and-cut-and-price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
28. Ropke S., Cordeau J.-F., and Laporte G. Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 4 2007 258 272
29. Savelsbergh M. Local search in routing problems with time windows Annals of Operations research 4 1 1985 285 305