Abstract
Nowadays, Container terminals play an important role as members of a supply chain. As a consequence, the optimization of port operations is becoming highly needed in order to meet the requirements of the sector. For this reason, we focus our attention on the Berth Allocation Problem (BAP) considered as one of the most critical task encountered in container terminal. Especially, we study the Dynamic Berth Allocation Problem (DBAP) which incorporates in the planning, the vessels which haven't arrived yet in the port in order to program their berthing. So, we provide a multi-objective mathematical model that takes into account the length and the draft of each berth and each vessel. Then we solve the problem using Cplex solver. Finally, numerical experiments are conducted to prove the performance of our 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.
