Abstract
The efficiency of yard crane scheduling is critical in increasing the throughput of a maritime terminal. This article studies the problem of scheduling multiple yard cranes in loading operations. The movements of yard cranes among container blocks and the sequencing of yard cranes within each block are studied at the same time. Potential interferences between yard cranes are considered. A mixed integer programming model is developed to formulate the problem. A genetic algorithm and a tabu search algorithm are proposed to obtain near-optimal solutions. Experimental tests are conducted to evaluate the performance of the two algorithms based on various data settings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
