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

被引:38
|
作者
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
相关论文
共 50 条
  • [31] The pickup and delivery problem with alternative locations and overlapping time windows
    Dragomir, Alina G.
    Van Woensel, Tom
    Doerner, Karl F.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 143
  • [32] A grouping genetic algorithm for the pickup and delivery problem with time windows
    Pankratz, G
    OR SPECTRUM, 2005, 27 (01) : 21 - 41
  • [33] Metaheuristic, models and software for the heterogeneous fleet pickup and delivery problem with split loads
    Gasque, Diogenes
    Munari, Pedro
    JOURNAL OF COMPUTATIONAL SCIENCE, 2022, 59
  • [34] A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Giselher Pankratz
    OR Spectrum, 2005, 27 : 21 - 41
  • [35] Waiting strategies for the dynamic pickup and delivery problem with time windows
    Mitrovic-Minic, S
    Laporte, G
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2004, 38 (07) : 635 - 655
  • [36] Pickup and delivery problem with time windows in mode of "truck +drone"
    Wu T.
    Tao X.
    Meng T.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (07): : 2440 - 2448
  • [37] A coevolutionary algorithm for the flexible delivery and pickup problem with time windows
    Wang, Hsiao-Fan
    Chen, Ying-Yen
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 4 - 13
  • [38] Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads
    Chen, Qingfeng
    Li, Kunpeng
    Liu, Zhixue
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 69 : 218 - 235
  • [39] Guided Ejection Search for the Pickup and Delivery Problem with Time Windows
    Nagata, Yuichi
    Kobayashi, Shigenobu
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6022 : 202 - 213
  • [40] A constraint programming approach for the pickup and delivery problem with time windows
    Kucuk, Mustafa
    Topaloglu Yildiz, Seyda
    PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2019, 25 (09): : 1041 - 1049