Scheduling RMGs in a container terminal with determination of the intermediate location of containers

다국어 초록 (Multilingual Abstract)

This paper addresses the problem of scheduling the twin rail-mounted gantry (RMG) cranes used at automated container terminals. We consider this problem in a real-time situation and employ local search-based methods to optimize crane scheduling. The proposed method creates a schedule for the jobs requested within a given fixed-length horizon. To reflect changes in the situation, the method updates the crane schedule by rescheduling at fixed intervals. In the process of searching for the optimal schedule, the proposed method optimizes not just job assignment for each RMG and the sequence of job execution, but also the intermediate locations of containers. A simulation shows that the proposed method outperforms the previous methods it is compared with in terms of the waiting time of both the internal transportation vehicles (i.e. automated guided vehicles) and the external trucks.

목차 (Table of Contents)

• Abstract
• Introduction
• RMG scheduling problem
• Local search-based crane scheduling
• Experimental results
• Conclusion
• Acknowledgments
• References