Models and algorithms for multi-crane oriented scheduling method in container terminals |
| |
Institution: | 1. Decision and Operation Technologies Group, Bielefeld University, 33615 Bielefeld, Germany;2. Institute for Liberal Arts and Sciences & Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, Kyoto City, 615–8510 Kyoto, Japan |
| |
Abstract: | “Multi-crane oriented” is a scheduling method that yard trailers can be shared by different quay cranes. In this paper, two models for this problem are developed. The first one is a model for an inter-ship-based sharing method. In this model, yard trailers can be shared by quay cranes of different ships. To solve the model, a two-phase Tabu search algorithm is designed. The second one is a model for a ship-based sharing method. In this model, yard trailers can only be shared by quay cranes of the same ship. Q-learning algorithm is designed to solve the model. Numerical tests show that the “multi-crane oriented” method can decrease the yard trailers’ travel distance, reduce the disequilibrium of different working lines, and thus improve the operation efficiency in container terminals. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|