A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

European Journal of Operational Research

Volumn 236, Issue 3, 2014, Pages 849-862

  Masson, Renaud ^a,c   Ropke, Stefan ^b   Lehuédé, Fabien ^a   Péton, Olivier ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Branch and cut and price; Column generation; Pickup and delivery problem; Transfers

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PICKUPS;

BRANCH AND CUT AND PRICES; BRANCH-AND-CUT-AND-PRICE ALGORITHM; COLUMN GENERATION; OPTIMIZATION PROBLEMS; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; PICKUP AND DELIVERY PROBLEMS; SHORTEST PATH PROBLEM; TRANSFERS;

COSTS;

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

References (32)

1. R. Baldacci, E. Bartolini, and A. Mingozzi An exact algorithm for the pickup and delivery problem with time windows Operations Research 59 2 2011 414 426
2. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: A classification scheme and survey TOP 15 2007 1 31
3. J.-F. Cordeau, G. Laporte, and S. Ropke Recent models and algorithms for one-to-one pickup and delivery problems B. Golden, R. Raghavan, E. Wasil, The vehicle routing problem: Latest advances and new challenges 2008 Springer 327 357
4. C.E. Cortés, M. Matamala, and C. Contardo The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method European Journal of Operational Research 200 3 2010 711 724
5. G. Desaulniers, J. Desrosiers, and S. Spoorendonk Cutting planes for branch-and-price algorithms Networks 58 4 2011 301 310
6. D. Feillet, P. Dejax, M. Gendreau, and C. Guéguen An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems Networks 44 2004 216 229
7. A. Fugenschuh Solving a school bus scheduling problem with integer programming European Journal of Operational Research 193 3 2009 867 884
8. I.L. Gørtz, V. Nagarajan, and R. Ravi Minimum makespan multi-vehicle dial-a-ride Algorithms - ESA 2009 A. Fiat, P. Sanders, Lecture notes in computer science Vol. 5757 2009 Springer Berlin Heidelberg 540 552
9. S. Irnich, and G. Desaulniers Shortest path problems with resource constraints G. Desaulniers, J. Desrosiers, M. Solomon, Column generation 2005 Springer 33 65
10. M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle routing problem with time windows Operations Research 56 2 2008 497 511
11. H.L.M. Kerivin, M. Lacroix, A.R. Mahjoub, and A. Quilliot The splittable pickup and delivery problem with reloads European Journal of Industrial Engineering 2 2 2008 112 133
12. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1999 101 116
13. G. Laporte, M. Desrochers, and Y. Nobert Two exact algorithms for the distance constrained vehicle routing problem Networks 14 1984 161 172
14. Lehuédé, F.; Pavageau, C.; Péton, O. (2009). A tabu search based heuristic for the transportation of mentally disabled people. In ORAHS 2009. Leuven Belgique.
15. C.K.Y. Lin A cooperative strategy for a vehicle routing problem with pickup and delivery time windows Computers & Industrial Engineering 55 4 2008 766 782
16. Lysgaard, J. (2003). CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Working paper 03-04, Department of Management Science and Logistics, Faculty of Business Administration, The Aarhus School of Business.
17. J. Lysgaard, A.N. Letchford, and R.W. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming 100 2004 423 445
18. R. Masson, F. Lehuédé, and O. Péton An adaptive large neighborhood search for the pickup and delivery problem with transfers Transportation Science 47 2013 344 355
19. R. Masson, F. Lehuédé, and O. Péton The dial-a-ride problem with transfers Computers & Operations Research 2013
20. S. Mitrović-Minić, and G. Laporte The pickup and delivery problem with time windows and transshipment INFOR 44 3 2006 217 228
21. C. Mues, and S. Pickl Transshipment and time windows in vehicle routing ISPAN'05: Proceedings of the 8th international symposium on parallel architectures, algorithms and networks 2005 IEEE Computer Society Washington, DC, USA 113 119
22. Naddef, D.; Rinaldi, G. (2002). Branch-and-cut algorithms for the capacitated VRP. SIAM monographs on discrete mathematics and applications (pp. 53-84).
23. Y. Nakao, and H. Nagamochi Worst case analysis for pickup and delivery problems with transfer IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A 9 2010 2328 2334
24. Oertel, P. (2000). Routing with reloads. Ph.D. thesis, University of Cologne, Germany.
25. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part 2: Transportation between pickup and delivery locations Journal für Betriebswirtschaft 2006
26. H.L. Petersen, and S. Ropke The pickup and delivery problem with cross-docking opportunity J.W. Bse, H. Hu, C. Jahn, X. Shi, R. Stahlbock, S. Voß, Computational logistics Lecture notes in computer science Vol. 6971 2011 Springer Berlin Heidelberg 101 113
27. Y. Qu, and J.F. Bard A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment Computers & Operations Research 39 10 2012 2439 2456
28. S. Ropke, and J.-F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
29. R.A. Russell, R.B. Morrel, and B. Haddox Routing special-education school buses Interfaces 16 5 1986 56 64
30. J.S. Shang, and C.K. Cuff Multicriteria pickup and delivery problem with transfer opportunity Computers & Industrial Engineering 30 4 1996 631 645
31. S.R. Thangiah, A. Fergany, and S. Awam Real-time split-delivery pickup and delivery time window problems with transfers Central European Journal of Operations Research 15 2007 329 349
32. P. Toth, and D. Vigo The vehicle routing problem SIAM monographs on discrete mathematics and applications 2002 SIAM Philadelphia