Yard Crane Scheduling Method Based on Deep Reinforcement Learning for the Automated Container Terminal

被引:0
|
作者
Wang W. [1 ]
Huang Z. [1 ]
Zhuang Z. [1 ]
Fang H. [2 ]
Qin W. [1 ]
机构
[1] Institute of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai
[2] Shanghai International Port (Group) Co., Ltd., Shanghai
关键词
automated container terminal; deep reinforcement learning; yard; yard crane scheduling;
D O I
10.3901/JME.2024.06.044
中图分类号
学科分类号
摘要
As the core working machinery of automated terminal yard, the dispatching of yard crane is the key to improve the efficiency of container operation. In order to minimize the waiting time of AGVs and external container trucks, a mathematical programming model for the yard crane scheduling problem is established considering complex spatio-temporal coupling characteristics and high dynamic, and a novel deep reinforcement learning method is proposed to solve the problem. The algorithm describes the yard environment close to reality through the agent definition, and improves the ability of extracting hidden state patterns through pointer network, attention mechanism and A-C architecture in the interaction design between the agent and the environment. Experiments are carried out on examples of different scales based on the actual data of Yangshan Phase IV Automated Terminal. The results show that the proposed algorithm can provide an approximately optimal crane scheduling scheme in a relatively short time, and the performance of it is about 17% better compared with state-of-art heuristic rule algorithms. Therefore, the proposed scheduling method is effective and superior, and it can provide dynamic decision support for yard operation in practice. © 2024 Chinese Mechanical Engineering Society. All rights reserved.
引用
收藏
页码:44 / 57
页数:13
相关论文
共 26 条
  • [1] HUANG Zizhao, ZHUANG Zilong, TENG Hao, Et al., Optimization of outbound container space assignment in automated container terminals based on hyper-heuristic[J], Computer Integrated Manufacturing Systems, 28, 8, pp. 2619-2632, (2022)
  • [2] BOYSEN N, BRISKORN D, MEISEL F., A generalized classification scheme for crane scheduling with interference[J], European journal of operational research, 258, 1, pp. 343-357, (2017)
  • [3] NOSSACK J, BRISKORN D, PESCH E., Container dispatching and conflict-free yard crane routing in an automated container terminal[J], Transportation Science, 52, 5, pp. 1059-1076, (2018)
  • [4] EILKEN A., A Decomposition-based approach to the scheduling of identical automated yard cranes at container terminals[J], Journal of Scheduling, 22, 5, pp. 1-25, (2019)
  • [5] KRESS D,, DORNSEIFER J, JAEHN F., An exact solution approach for scheduling cooperative gantry cranes[J], European Journal of Operational Research, 273, 1, pp. 82-101, (2019)
  • [6] CORDEAU J F, LEGATO P, MAZZA R M, Et al., Simulation-based optimization for housekeeping in a container transshipment terminal[J], Computers & Operations Research, 53, pp. 81-95, (2015)
  • [7] GHAREHGOZLI A H, VERNOOIJ F G,, ZAERPOUR N., A simulation study of the performance of twin automated stacking cranes at a seaport container terminal[J], European Journal of Operational Research, 261, 1, pp. 108-128, (2017)
  • [8] JAEHN F, KRESS D., Scheduling cooperative gantry cranes with seaside and landside jobs[J], Discrete Applied Mathematics, 242, pp. 53-68, (2018)
  • [9] EHLEITER A, JAEHN F., Scheduling crossover cranes at container terminals during seaside peak times[J], Journal of Heuristics, 24, 6, pp. 899-932, (2018)
  • [10] GHAREHGOZLI A H,, LAPORTE G, YU Y, Et al., Scheduling twin yard cranes in a container block[J], Transportation Science, 49, 3, pp. 686-705, (2015)