Real-time scheduling for non-crossing stacking cranes in an automated container terminal

Authors:
Ri Choe;Taejin Park;Seung Min Ok;Kwang Ryel Ryu
Affiliations:
Department of Computer Engineering, Pusan National University, Busan, Korea;Department of Computer Engineering, Pusan National University, Busan, Korea;Department of Computer Engineering, Pusan National University, Busan, Korea;Department of Computer Engineering, Pusan National University, Busan, Korea
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 2
Cited 1

Re-marshaling export containers in port container terminals

ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach

Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a local-search-based real-time scheduling method for non-crossing stacking cranes in an automated container terminal. Considering the dynamic property of the yard crane operation and real-time constraints, the method builds a new crane schedule for a fixed-length look-ahead horizon whenever a new crane job is requested. One difficulty in crane scheduling is that sometimes additional crane operations need to be done to complete a requested job, especially when other containers are stacked on top of the requested container. We use a redundant and variable-length representation of a candidate solution for search to accommodate those additional operations. Simulation experiment shows that the local-search-based method outperforms heuristic-based method in real-time situations.