Space reservation and remarshalling operations for outbound containers in marine terminals

被引:3
|
作者
Kim, Kap Hwan [1 ]
Woo, Youn Ju [1 ]
Kim, Jae Gwan [2 ]
机构
[1] Pusan Natl Univ, Dept Ind Engn, Busandaehak Ro 63,Beon Gil 2, Busan 46241, South Korea
[2] Pusan Natl Univ, Dept Comp Engn, Busan, South Korea
关键词
Remarshalling; Container terminals; Storage systems; Outbound containers; Genetic algorithm;
D O I
10.1057/s41278-019-00125-7
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Outbound containers begin to arrive 7-15 days before the corresponding vessel. To reduce the use of yard space, they are stacked in a temporary storage area in the early stages of arrival, and a permanent storage area is subsequently allocated to all containers to be loaded on a certain vessel. Containers arriving before the allocation are moved to the allocated permanent storage area, which is called "remarshalling". This paper proposes a method to determine the right time to remarshal outbound containers, as well as the amount of space reservation required, considering the handling effort for remarshalling and the efficiency of the loading operation. Mathematical formulations and solution algorithms are developed both for a single vessel and for multiple vessels. A simple procedure is proposed for the problem involving only a single vessel, and a genetic algorithm is developed for the multiple vessel problem. Through numerical experiments, it is found that as the remarshalling cost per container increases, ship operating and total costs tend to increase, too, while remarshalling costs do not show any conclusive trend. We also find that an increase in the available space, relative to space requirements, has a higher impact on the reduction of remarshalling costs than on the reduction of ship operating costs. Our results can support yard managers in container terminals to manage efficiently space reservations and remarshalling operations.
引用
收藏
页码:154 / 178
页数:25
相关论文
共 38 条
  • [1] Space reservation and remarshalling operations for outbound containers in marine terminals
    Kap Hwan Kim
    Youn Ju Woo
    Jae Gwan Kim
    [J]. Maritime Economics & Logistics, 2021, 23 : 154 - 178
  • [2] Estimating space requirements for outbound containers in port container terminals
    Woo, Youn Ju
    Kim, Kap Hwan
    [J]. Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 415 - 415
  • [3] Deriving guidelines of space planning for outbound containers in port container terminals
    Jung, Sung Ho
    Kim, Kap Hwan
    [J]. Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 413 - 413
  • [4] Pricing storage of outbound containers in container terminals
    Youn Ju Woo
    Jang-Ho Song
    Kap Hwan Kim
    [J]. Flexible Services and Manufacturing Journal, 2016, 28 : 644 - 668
  • [5] Optimization of yard remarshalling operations in automated container terminals
    Wang, Yu
    He, Junliang
    Yu, Hang
    Guo, Yongkai
    [J]. ADVANCED ENGINEERING INFORMATICS, 2024, 61
  • [6] Pricing storage of outbound containers in container terminals
    Woo, Youn Ju
    Song, Jang-Ho
    Kim, Kap Hwan
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2016, 28 (04) : 644 - 668
  • [7] Conservative allocation models for outbound containers in container terminals
    Zhang, Canrong
    Wu, Tao
    Kim, Kap Hwan
    Miao, Lixin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (01) : 155 - 165
  • [8] Yard Space Allocation Algorithm for Unloading Containers at Marine Terminals
    Wang, Xingyu
    Zhao, Ning
    Mi, Chao
    [J]. JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2023, 11 (11)
  • [9] Novel models and algorithms for location assignment for outbound containers in container terminals
    Zhang, Canrong
    Wang, Qi
    Yuan, Guoping
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (02) : 722 - 737
  • [10] OCBLA: A Storage Space Allocation Method for Outbound Containers
    Chen, Xinyu
    Hu, Wenbin
    [J]. ADVANCES IN E-BUSINESS ENGINEERING FOR UBIQUITOUS COMPUTING, 2020, 41 : 450 - 463