The Maritime Pickup and Delivery Problem with Time Windows and Split Loads

被引:39
作者
Andersson, Henrik [1 ]
Christiansen, Marielle [1 ]
Fagerholt, Kjetil [1 ]
机构
[1] Norwegian Univ Sci & Technol, Dept Ind Econ & Technol Management, N-7491 Trondheim, Norway
关键词
Maritime transportation; routing and scheduling; split loads;
D O I
10.3138/infor.49.2.079
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The purpose of this paper is to present an exact solution method for an important planning problem faced by many shipping companies dealing with transportation of bulk cargoes. A bulk shipping company usually has a set of contract cargoes that it is committed to carry and will try to derive additional revenue from optional spot cargoes. Each cargo, either it is a contract or spot cargo, consists of a given quantity to be picked up in a given loading port and delivered in a given unloading port within specified time windows. The shipping company controls a fixed fleet for the purpose of transporting the cargoes. In most of the literature on ship routing and scheduling problems, a cargo cannot be transported by more than one ship. By introducing split loads, this restriction is removed and each cargo can be transported by several ships. The resulting planning problem can be denoted as a maritime pickup and delivery problem with time windows and split loads (PDPTWSL). We present an arc flow formulation of the PDPTWSL. We also suggest a solution method based on a priori generation of single ship schedules and two alternative path flow models that deal with the selection of ship schedules and assignment of cargo quantities to the schedules. Computational results show that the solution method can provide optimal solutions to small realistic planning instances. We also believe this paper provides an important starting point for research on other exact solution methods for the maritime PDPTWSL.
引用
收藏
页码:79 / 91
页数:13
相关论文
共 21 条
  • [1] [Anonymous], 2008, Review of Maritime Transport 2008
  • [2] Worst-case analysis for split delivery vehicle routing problems
    Archetti, C
    Savelsbergh, MWP
    Speranza, MG
    [J]. TRANSPORTATION SCIENCE, 2006, 40 (02) : 226 - 234
  • [3] A tabu search algorithm for the split delivery vehicle routing problem
    Archetti, C
    Speranza, MG
    Hertz, A
    [J]. TRANSPORTATION SCIENCE, 2006, 40 (01) : 64 - 73
  • [4] To split or not to split: That is the question
    Archetti, Claudia
    Savelsbergh, Martin W. P.
    Speranza, M. Grazia
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (01) : 114 - 123
  • [5] Bouzaiene-Ayari B., 1993, Foundations of Computing and Decision Sciences, V18, P63
  • [6] Ship routing and scheduling: Status and perspectives
    Christiansen, M
    Fagerholt, K
    Ronen, D
    [J]. TRANSPORTATION SCIENCE, 2004, 38 (01) : 1 - 18
  • [7] Christiansen M, 2007, HBK OPERAT RES MANAG, V14, P189, DOI 10.1016/S0927-0507(06)14004-9
  • [8] Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
    Desaulniers, Guy
    [J]. OPERATIONS RESEARCH, 2010, 58 (01) : 179 - 192
  • [9] Desrosiers Jacques., 1995, Handbooks in Operations Research and Management Science, V8, P35, DOI DOI 10.1016/S0927-0507(05)80106-9
  • [10] SPLIT DELIVERY ROUTING
    DROR, M
    TRUDEAU, P
    [J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (03) : 383 - 402