Abstract
In order to solve the berth allocation problem and improve the efficiency of the dock, a mixed integer nonlinear programming model is built with the length of port stay. The genetic-harmony search algorithm is used to solve it for the first time. Finally, the algorithm and Lingo are used to solve the large-scale berth allocation problem at the same time. Under the same data of arrival ships, several groups of experiments are designed to verify the algorithm. The results show that the genetic-harmony search algorithm can be used to solve the berth allocation problem. On the basis of the consistency between the genetic-harmony search algorithm and Lingo, the genetic-harmony search algorithm is faster and more efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IOP Conference Series: Materials Science and Engineering
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.