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 条
  • [21] Genetic algorithm for a pickup and delivery problem with time windows
    Jung, S.
    Haghani, A.
    Transportation Research Record, 2000, (1733) : 1 - 7
  • [22] Genetic algorithm for a pickup and delivery problem with time windows
    Jung, SJ
    Haghani, A
    TRANSPORTATION NETWORK PLANNING: PLANNING AND ADMINISTRATION, 2000, (1733): : 1 - 7
  • [23] An evolutionary approach to pickup and delivery problem with time windows
    Créput, JC
    Koukam, A
    Kozlak, J
    Lukasik, J
    COMPUTATIONAL SCIENCE - ICCS 2004, PT 3, PROCEEDINGS, 2004, 3038 : 1102 - 1108
  • [24] The multi-pickup and delivery problem with time windows
    Naccache, Salma
    Cote, Jean-Francois
    Coelho, Leandro C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (01) : 353 - 362
  • [25] Precedence constrained pickup and delivery with split loads
    Nowak, Maciek
    Hewitt, Mike
    White, Chelsea C., III
    INTERNATIONAL JOURNAL OF LOGISTICS-RESEARCH AND APPLICATIONS, 2012, 15 (01) : 1 - 14
  • [26] Profitable Pickup and Delivery Problem with Time Windows and Compatibility Constraints
    Cui, Shitong
    Wu, Yuehui
    Lin, Chang
    Sun, Liucheng
    CICTP 2021: ADVANCED TRANSPORTATION, ENHANCED CONNECTION, 2021, : 2472 - 2483
  • [27] Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
    Ropke, Stefan
    Cordeau, Jean-Francois
    TRANSPORTATION SCIENCE, 2009, 43 (03) : 267 - 286
  • [28] A multicommodity unpaired pickup and delivery vehicle routing problem with split loads and unloads
    Dongyang Xu
    Kunpeng Li
    Jiehui Yang
    Ligang Cui
    INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 2020, 120 (08) : 1565 - 1584
  • [29] Scheduling strategy for dynamic pickup and delivery problem with time windows
    Zhou Changfeng
    Liu Yan
    Tan Yuejin
    Liao Liangcai
    ICCSE'2006: Proceedings of the First International Conference on Computer Science & Education: ADVANCED COMPUTER TECHNOLOGY, NEW EDUCATION, 2006, : 746 - 749
  • [30] A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Nalepa, Jakub
    Blocho, Miroslaw
    2017 25TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING (PDP 2017), 2017, : 1 - 8