A branch-price-and-cut method for a ship routing and scheduling problem with split loads

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 3361-3375

  Stålhane, Magnus ^a   Andersson, Henrik ^a   Christiansen, Marielle ^a   Cordeau, Jean François ^b   Desaulniers, Guy ^c  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b HEC MONTRÉAL   (Canada)

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

Author keywords

Branch price and cut; Maritime transportation; Pickup and delivery; Split loads

Indexed keywords

BRANCH-PRICE-AND-CUT; COMPUTATIONAL RESULTS; MARITIME TRANSPORTATION; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PICKUP AND DELIVERY; PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS; PLANNING HORIZONS; RESOURCE CONSTRAINT; ROUTING AND SCHEDULING; SHORTEST PATH PROBLEM; SOLUTION METHODS; SPLIT-LOAD; VALID INEQUALITY;

COSTS; FLEET OPERATIONS; GRAPH THEORY; INTEGER PROGRAMMING; PROFITABILITY; SHIPS; WATERWAY TRANSPORTATION;

PROBLEM SOLVING;

EID: 84862991359     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.04.021     Document Type: Article

References (29)

1. H. Andersson, M. Christiansen, and K. Fagerholt The maritime pickup and delivery problem with time windows and split loads Information Systems and Operational Research 49 2011 79 91
2. C. Archetti, M. Bouchard, and G. Desaulniers Enhanced branch and price and cut for vehicle routing with split deliveries and time windows Transportation Science 45 3 2011 285 298
3. C. Archetti, M.W.P. Savelsbergh, and M.G. Speranza Worst-case analysis for split delivery vehicle routing problems Transportation Science 40 2 2006 226 234
4. C. Archetti, M.W.P. Savelsbergh, and M.G. Speranza To split or not to split: that is the question Transportation Research Part E 44 1 2008 114 123 (Pubitemid 47528125)
5. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.P.W. Savelsbergh, and P.H. Vance Branch-and-price: column generation for solving huge integer programs Operations Research 46 3 1998 316 329 (Pubitemid 128655433)
6. J.M. Belenguer, M.C. Martinez, and E. Mota A lower bound for the split delivery vehicle routing problem Operations Research 48 5 2000 801 810 (Pubitemid 32069966)
7. 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
8. M. Christiansen, K. Fagerholt, B. Nygreen, and D. Ronen Maritime transportation C. Barnhart, G. Laporte, Transportation. Handbooks in operations research and management science vol. 14 2007 Elsevier Science 189 284
9. M. Christiansen, K. Fagerholt, and D. Ronen Ship routing and scheduling: status and perspectives Transportation Science 38 1 2004 1 18
10. G. Desaulniers Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows Operations Research 33 1 2009 3 14
11. J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis Time constrained routing and scheduling M. Ball, T. Magnanti, C. Monma, G. Nemhauser, Network routing. Handbooks in operations research and management science vol. 8 1995 Elsevier Science 35 139
12. M. Dror, G. Laporte, and P. Trudeau Vehicle routing with split deliveries Discrete Applied Mathematics 50 1994 239 254
13. M. Dror, and P. Trudeau Savings by split delivery routing Transportation Science 23 2 1989 141 145
14. Y. Dumas, J. Desrosiers, and F. Soumis The pickup and delivery problem with time windows European Journal of Operational Research 54 1991 7 22 (Pubitemid 21712574)
15. P.W. Frizzel, and J.W. Griffin The bounded split delivery vehicle routing problem with grid network distances Asia-Pacific Journal of Operational Research 9 1 1995 101 116
16. P.W. Frizzel, and J.W. Griffin The split delivery scheduling problem with time windows and split deliveries Computers & Operations Research 22 6 1995 655 667
17. Gendreau M, Dejax P, Feillet D, Gueguen C. Vehicle routing with time windows and split deliveries. Working paper, CIRRELT, Canada; 2010.
18. S.C. Ho, and D. Haugland A tabu search heuristic for the vehicle routing problem with time windows and split deliveries Computers Operations & Research 31 12 2009 1947 1964 (Pubitemid 38728562)
19. S. Irnich, and G. Desaulniers Shortest path problems with resource constraints G. Desaulniers, J. Desrosiers, M. Solomon, Column generation. GERAD 25th anniversary series 2005 Springer 33 65
20. M. Jin, K. Liu, and R.O. Bowdon A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem International Journal of Production Economics 105 2007 228 242 (Pubitemid 44636209)
21. M. Jin, K. Liu, and B. Eksioglu A column generation approach for the split delivery vehicle routing problem Operations Research Letters 36 2008 265 270 (Pubitemid 351258138)
22. J. Korsvik, K. Fagerholt, and G. Laporte A large neighborhood search heuristic for ship routing and scheduling with split loads Computers & Operations Research 38 2 2011 474 483
23. S.A. Lawrence International sea transport: the years ahead 1972 Lexington Books Lexington, MA
24. C.G. Lee, M.A. Epelman, C.C. White III, and Y.A. Bozer A shortest path approach to the multiple-vehicle routing problem with split pick-ups Transportation Research Part B 40 2006 265 284 (Pubitemid 43033363)
25. M. Nowak, O. Ergun, and C.C. White Pickup and delivery with split loads Transportation Science 42 1 2008 32 43
26. 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
27. M. Savelsbergh, and M. Sol Drive: dynamic routing of independent vehicles Operations Research 46 1998 474 490 (Pubitemid 128665758)
28. G. Sierksma, and G.A. Tijssen Routing helicopters for crew exchanges on off-shore locations Annals of Operations Research 76 1997 261 286
29. UNCTAD, Review of maritime transportation. Technical report, United Nations, New York and Geneva; 2008.