 Models and algorithms for multi-crane oriented scheduling method in container terminalsQingcheng Zeng, Zhongzhen Yang and Luyuan Lai Transport Policy, 2009, vol. 16, issue 5, 271-278 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: Container; terminals; Multi-oriented; scheduling; method; Yard; trailer; scheduling; Q-learning; algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:trapol:v:16:y:2009:i:5:p:271-278 Ordering information: This journal article can be ordered from Access Statistics for this article Transport Policy is currently edited by Y. Hayashi More articles in Transport Policy from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.