Real-time twin automated double cantilever rail crane scheduling problem for the U-shaped automated container terminal using deep reinforcement learning

The real-time twin automated double cantilever rail crane scheduling problem (RADCRCSP) is crucial for the newly proposed U-shaped automated container terminal (ACT) to improve operation efficiency and minimize energy consumption. However, the complexities and dynamics inherent in the system introduce significant challenges in solving the RADCRCSP. To address the challenge, this study proposes a deep reinforcement learning (DRL) based scheduling model for the RADCRCSP by formulating it as a Markov decision process (MDP) and designing novel rewards, efficient actions, and relevant state features. Then, a DRL-based real-time scheduling optimization (DRL-RSO) framework is developed to solve the RADCRCSP. This framework integrates the double deep Q-network (DDQN) algorithm with simulation techniques to learn optimal mixed rule policies (OMRPs) for task selection in the simulated dynamic complex environment of the twin ADCRCs operation. Experimental results demonstrate that the OMRPs outperform traditional heuristic scheduling rules for import and export blocks in the U-shaped ACT, demonstrating the effectiveness of the DRL-RSO framework. The findings offer decision support for enhancing efficiency and reducing energy consumption of the U-shaped ACT.

Authors

Publication Details

Journal
Advanced Engineering Informatics
Published
2025-02-15
DOI
https://doi.org/10.1016/j.aei.2025.103193
Citations
12
Primary Topic
Maritime Ports and Logistics
Type
article
Field-Weighted Citation Impact
14.91
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Real-time twin automated double cantilever rail crane scheduling problem for the U-shaped automated container terminal using deep reinforcement learning

Zhonghan Zhen, Yanxin Guo, Zhuoyao Zhao, Zhuo Fang et al.
12 citations
Advanced Engineering Informatics
Maritime Ports and Logistics
14.91
article

Real-time twin automated double cantilever rail crane scheduling problem for the U-shaped automated container terminal using deep reinforcement learning

Zhonghan Zhen, Yanxin Guo, Zhuoyao Zhao, Zhuo Fang, Qi Yue, Guolei Tang, Mengxin Li
article en
12 citations

Abstract

The real-time twin automated double cantilever rail crane scheduling problem (RADCRCSP) is crucial for the newly proposed U-shaped automated container terminal (ACT) to improve operation efficiency and minimize energy consumption. However, the complexities and dynamics inherent in the system introduce significant challenges in solving the RADCRCSP. To address the challenge, this study proposes a deep reinforcement learning (DRL) based scheduling model for the RADCRCSP by formulating it as a Markov decision process (MDP) and designing novel rewards, efficient actions, and relevant state features. Then, a DRL-based real-time scheduling optimization (DRL-RSO) framework is developed to solve the RADCRCSP. This framework integrates the double deep Q-network (DDQN) algorithm with simulation techniques to learn optimal mixed rule policies (OMRPs) for task selection in the simulated dynamic complex environment of the twin ADCRCs operation. Experimental results demonstrate that the OMRPs outperform traditional heuristic scheduling rules for import and export blocks in the U-shaped ACT, demonstrating the effectiveness of the DRL-RSO framework. The findings offer decision support for enhancing efficiency and reducing energy consumption of the U-shaped ACT.

Advanced Engineering InformaticsVol. 65
Openalex Percentile: Top 1%
Maritime Ports and Logistics
14.91
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.