Clustering-reassigning approach for scheduling multiple yard cranes at container terminals
View/ Open
File version
Version of Record (VoR)
Author(s)
Wu, Y.
H Petering, Matthew
Li, Wenkai
Goh, Mark
Souza, Robert
Griffith University Author(s)
Year published
2006
Metadata
Show full item recordAbstract
Yard cranes are the most popular container handling equipment for loading
containers onto and unloading containers from yard trucks in container terminals.
In transshipment operations, the scheduling of such cranes can greatly affect box
throughput of the whole terminal. Therefore, good yard crane scheduling
algorithms are required to optimally order the sequence of storage/retrieval
operations in yard blocks so that faster container flows in the whole terminal can
be generated for better performance. This paper investigates the problem of
scheduling multiple yard cranes within a generic yard block. The difficulty of ...
View more >Yard cranes are the most popular container handling equipment for loading containers onto and unloading containers from yard trucks in container terminals. In transshipment operations, the scheduling of such cranes can greatly affect box throughput of the whole terminal. Therefore, good yard crane scheduling algorithms are required to optimally order the sequence of storage/retrieval operations in yard blocks so that faster container flows in the whole terminal can be generated for better performance. This paper investigates the problem of scheduling multiple yard cranes within a generic yard block. The difficulty of this problem is that a crane cannot access other jobs blocked by neighboring cranes. Further, even when one crane is not obstructed by another crane, the fact that each pair of cranes must keep apart for an operational safety distance renders the difficulty of the scheduling problem. We propose a clustering-reassigning approach for the multiple yard cranes scheduling problem. The algorithm considers the actual crane interference and calculates the crane traveling time realistically. Numerical experiments are conducted to check the algorithm performance and the results indicate that the algorithm works fast and effectively.
View less >
View more >Yard cranes are the most popular container handling equipment for loading containers onto and unloading containers from yard trucks in container terminals. In transshipment operations, the scheduling of such cranes can greatly affect box throughput of the whole terminal. Therefore, good yard crane scheduling algorithms are required to optimally order the sequence of storage/retrieval operations in yard blocks so that faster container flows in the whole terminal can be generated for better performance. This paper investigates the problem of scheduling multiple yard cranes within a generic yard block. The difficulty of this problem is that a crane cannot access other jobs blocked by neighboring cranes. Further, even when one crane is not obstructed by another crane, the fact that each pair of cranes must keep apart for an operational safety distance renders the difficulty of the scheduling problem. We propose a clustering-reassigning approach for the multiple yard cranes scheduling problem. The algorithm considers the actual crane interference and calculates the crane traveling time realistically. Numerical experiments are conducted to check the algorithm performance and the results indicate that the algorithm works fast and effectively.
View less >
Conference Title
Proceedings of the 11th International Symposium on Logistics
Copyright Statement
© 2006 Nottingham University. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.
Subject
Logistics and Supply Chain Management