Abstract
The quay crane dynamic scheduling problem based on berth schedules in container terminal involves the allocation of limited quay crane resources and the scheduling of loading and unloading tasks on each ship, with its berth time and location known, in order to reduce the total time of all the ships arriving at the terminal in the planning horizon. Under the real constraints of non-crossing of quay cranes and the sequence requires among tasks, the non-linear mathematical planning model is set up. A genetic algorithm is proposed according to the characteristics of the problem, and the chromosome representation is structured on the sequence of tasks. The model and the algorithm are proved effectiveness via the comparisons of scheduling results with results with literature on a single ship, the comparisons of scheduling results between multi-ships and single ship, and the simulation of quay crane dynamic scheduling among multi-ships.
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 callMore From: Journal of Transportation Systems Engineering and Information Technology
Disclaimer: 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.
