Storage space allocation and multi-yard cranes scheduling in terminal yard with container delivery time uncertain

被引：0
|
作者：
Fan H. [1 ]
Kong L. [1 ]
Ma M. [1 ]
Guo Z. [1 ]
机构：
[1] Transportation Engineering College, Dalian Maritime University, Dalian
来源：
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2021年 / 41卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Container; Memetic heuristic algorithm; Multi-yard cranes scheduling; Storage space allocation; Uncertain container delivery time;
D O I：
10.12011/SETP2019-0866
中图分类号：
学科分类号：
摘要：
The efficiency of containers stacking and yard crane scheduling have an important impact on the loading efficiency. In order to avoid reshuffle, a new stacking strategy is proposed from the perspective of loading and booking information. We establish an integrated optimization model of containers stacking and multi-yard cranes scheduling considering the regional workload balance planning strategy, uncertainty containers arrival sequence and the safety distance between yard cranes to minimize the working time of yard cranes when port loading. A memetic algorithm is designed to solve the model, which local search is added and the local search ability is enhanced. Through numerical experiments, the validity of the adopted algorithm and stacking strategy is verified. The results prove that the detailedity and accuracy of the containers' arrival information have an important impact on the yard scheduling. The research is conducive to improving the efficiency of loading operations. © 2021, Editorial Board of Journal of Systems Engineering Society of China. All right reserved.
引用
收藏
页码：1294 / 1306
页数：12
相关论文
共 28 条
  • [1] Han X L., Routing problem of transfer crane at cotainer terminals, Journal of Shanghai Maritime University, 26, 2, pp. 39-41, (2005)
  • [2] Guo W W, Ji M J, Zhu H L, Et al., Joint optimization of loading sequence and yard crane travel route in container terminals, Journal of Transportation Systems Engineering and Information Technology, 18, 4, pp. 178-187, (2018)
  • [3] Gharehgozli A H, Yu Y, Koster R D, Et al., An exact method for scheduling a yard crane, European Journal of Operational Research, 235, 2, pp. 431-447, (2014)
  • [4] He J, Huang Y, Yan W., Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption, Advanced Engineering Informatics, 29, 1, pp. 59-75, (2015)
  • [5] Chang D F, Jiang Z H, Yan W, Et al., Developing a dynamic rolling-horizon decision strategy for yard crane scheduling, Advanced Engineering Informatics, 25, 3, pp. 485-494, (2011)
  • [6] Gharehgozli A H, Laporte G, Yu Y., Scheduling twin yard cranes in a container block, Transportation Science, 49, 3, pp. 686-705, (2015)
  • [7] Li W, Wu Y, Goh M., Discrete time model and algorithms for container yard crane scheduling, European Journal of Operational Research, 198, 1, pp. 165-172, (2009)
  • [8] Le M L, Lin Y Y, Fan Z Q., Research on multi-yard-crane scheduling problem based on two-phase heuristic algorithm, Journal of Wuhan University of Technology, 34, 1, pp. 60-65, (2012)
  • [9] Zhao L, Hu Z H, Li S Q., Container yard crane scheduling for operations balance between yard cranes, Journal of Wuhan University of Technology, 35, 1, pp. 69-74, (2013)
  • [10] Zheng H X, Yu K., Yard crane scheduling in the mixture storage block base on hybrid genetic algorithm, Journal of Transportation System Engineering and Information Technology, 13, 5, pp. 130-158, (2013)
123