Abstract
In this paper, we study the continuous berth allocation problem for the container terminals with assumption of quay crane being dynamically allocated and propose new berth allocation model. Based on brother-son method, we develop algorithm to solve the berth allocation problem with presetting the position of the vessels and quay crane being dynamically allocated in the right position without crossing. Computing experiments show that our model and algorithm are more efficient.
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.
