Abstract
Abstract Decide when and where allocate incoming ships at a container terminal is among the main problem confronted by port operators. This problem often called the Berth Allocation Problem (BAP).In this work, we realize an analytical study on the major planning models presented in the literature for the berth allocation problem, namely dynamic and discrete berth allocation problem model (DDBAP), dynamic and continuous berth allocation problem model (DCBAP) and dynamic and hybrid berth allocation problem model (DHBAP). The objective of this study is determine which model among the mentioned above can be used as a standard model for all type of terminal layouts and which of them ensure satisfactory outcome at level of minimization of ships turnaround time in the port. A commercial solver (CPLEX) as well as an efficient sailfish-based algorithm (SFA) are used to solve each model. Finally, computational experiences and comparison have been presented to demonstrate the most suited planning model.
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.
