Integrated dedicated berth allocation and specialised handling equipment assignment in bulk ports

被引:1
|
作者
Perez, Dolores [1 ]
Jin, Jian Gang [2 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Naval Architecture Ocean & Civil Engn, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Naval Architecture Ocean & Civil Engn, State Key Lab Ocean Engn, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
bulk port; berth allocation; handling equipment assignment; shipping logistics; QUAY CRANE ASSIGNMENT; SIMULATION-MODEL; SOLVE;
D O I
暂无
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses the berth allocation problem in bulk ports to enhance the operation efficiency of a bulk cargo terminal by integrating the berth allocation and handling equipment assignment decisions. Apart from deciding where to berth a bulk carrier, ports must allocate specialised equipment based on the type of cargo the vessel carries. The proposed mathematical optimisation model considers a discrete berth layout and specific transfer rates of handling equipment such as conveyor, pipelines, grab cranes and cement facilities, with the objective of minimising the overall port stay time. The developed optimisation model was tested with data retrieved from real-world bulk ports and it can be efficiently solved by the commercial solver CPLEX. Results show that it successfully assigns vessels to dedicated berths evading congestion. Furthermore, the model properly allocates berth positions and specialised handling equipment reducing the overall turnaround time, thus improving customer service.
引用
收藏
页码:543 / 562
页数:20
相关论文
共 50 条
  • [1] AN INTEGRATED BERTH ALLOCATION AND YARD ASSIGNMENT PROBLEM FOR BULK PORTS: FORMULATION AND CASE STUDY
    Al-Hammadi, Jasem
    Diabat, Ali
    [J]. RAIRO-OPERATIONS RESEARCH, 2017, 51 (01) : 267 - 284
  • [2] A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
    Robenek, Tomas
    Umang, Nitish
    Bierlaire, Michel
    Ropke, Stefan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (02) : 399 - 411
  • [3] A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports
    Krimi, Issam
    Benmansour, Rachid
    El Cadi, Abdessamad Ait
    Deshayes, Laurent
    Duvivier, David
    Elhachemi, Nizar
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2019, 10 (04) : 577 - 591
  • [4] An Integrated Planning, Scheduling, Yard Allocation and Berth Allocation Problem in Bulk Ports: Model and Heuristics
    Marques de Andrade, Joao Luiz
    Menezes, Gustavo Campos
    [J]. COMPUTATIONAL LOGISTICS (ICCL 2021), 2021, 13004 : 3 - 20
  • [5] Integrated optimization of berth allocation problem with berth shifting strategies and ballast water management for dry bulk ports
    Zheng, Hongxing
    Fan, Xin
    Tang, Chunyan
    [J]. OCEAN ENGINEERING, 2024, 309
  • [6] Integrated laycan and berth allocation problem with ship stability and conveyor routing constraints in bulk ports
    Bouzekri, Hamza
    Alpan, Gulgun
    Giard, Vincent
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 181
  • [7] Integration of Berth Allocation and Quay Crane Assignment in Tidal Container Ports
    陆志强
    吴文
    韩笑乐
    NIRAVONG Juliane
    [J]. Journal of Donghua University(English Edition), 2015, 32 (04) : 559 - 564
  • [8] Hybrid Berth Allocation for Bulk Ports with Unavailability and Stock Level Constraints
    Lyu, Xiaohuan
    Schulte, Frederik
    [J]. COMPUTATIONAL LOGISTICS (ICCL 2022), 2022, 13557 : 3 - 15
  • [9] A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports
    Bouzekri, Hamza
    Alpan, Gulgun
    Giard, Vincent
    [J]. ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: THE PATH TO DIGITAL TRANSFORMATION AND INNOVATION OF PRODUCTION MANAGEMENT SYSTEMS, PT I, 2020, 591 : 250 - 258
  • [10] Exact and heuristic methods to solve the berth allocation problem in bulk ports
    Umang, Nitish
    Bierlaire, Michel
    Vacca, Ilaria
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2013, 54 : 14 - 31