An integrated model for berth and yard planning in container terminals with multi-continuous berth layout

被引:0
|
作者
H. L. Ma
S. H. Chung
H. K. Chan
Li Cui
机构
[1] The Hong Kong Polytechnic University,Department of Industrial and Systems Engineering
[2] University of Nottingham Ningbo China,Nottingham University Business School China
[3] Dalian University of Technology,Business School
[4] Hang Seng Management College,Supply Chain and Information Managment
来源
关键词
Berth allocation problem; Yard storage allocation problem; Multi-continuous berth layout; Guided neighborhood search;
D O I
暂无
中图分类号
学科分类号
摘要
Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved.
引用
收藏
页码:409 / 431
页数:22
相关论文
共 50 条
  • [21] Tactical berth and yard template design at container transshipment terminals: A column generation based approach
    Jin, Jian Gang
    Lee, Der-Horng
    Hu, Hao
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 73 : 168 - 184
  • [22] A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
    Abtin Nourmohammadzadeh
    Stefan Voß
    Annals of Mathematics and Artificial Intelligence, 2022, 90 : 831 - 853
  • [23] Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea
    Kim, Armi
    Park, Hyun-Ji
    Park, Jin-Hyoung
    Cho, Sung-Won
    JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2021, 9 (05)
  • [24] A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
    Nourmohammadzadeh, Abtin
    Voss, Stefan
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2022, 90 (7-9) : 831 - 853
  • [25] Integrating optimization method for continuous berth and quay crane scheduling in container terminals
    Lu, Z.-Q. (zhiqianglu@tongji.edu.cn), 1600, Shanghai Jiaotong University (47):
  • [26] Disruption recovery model for berth and quay crane scheduling in container terminals
    Zeng, Qingcheng
    Yang, Zhongzhen
    Hu, Xiangpei
    ENGINEERING OPTIMIZATION, 2011, 43 (09) : 967 - 983
  • [27] Integrated discrete berth allocation and quay crane scheduling in port container terminals
    Lee, Der-Horng
    Wang, Hui Qiu
    ENGINEERING OPTIMIZATION, 2010, 42 (08) : 747 - 761
  • [28] Priority control of berth allocation problem in container terminals
    Evrim Ursavas
    Annals of Operations Research, 2022, 317 : 805 - 824
  • [29] An Integrated Planning, Scheduling, Yard Allocation and Berth Allocation Problem in Bulk Ports: Model and Heuristics
    Marques de Andrade, Joao Luiz
    Menezes, Gustavo Campos
    COMPUTATIONAL LOGISTICS (ICCL 2021), 2021, 13004 : 3 - 20
  • [30] A dynamic discrete berth allocation problem for container terminals
    Gargari, Masoud Moharami
    Niasar, Mohammad Saeid Fallah
    MARITIME-PORT TECHNOLOGY AND DEVELOPMENT, 2015, : 11 - 18