Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
The Berth Allocation Problem (BAP) is one of the most important operational logistic problems encountered in a container terminal. It aims to assign vessels to berthing areas along the quay and it depends generally on two main factors the type of ships arrival (static or dynamic) and the type of berth space (discrete, continuous or hybrid). In this study, we addressed the problem in the dynamic hybrid case and we developed a recent meta-heuristic Based on the Bat-inspired Algorithm (BA) as a resolution approach. Finally, computational experiments and comparisons are realized to demonstrate the quality of our results.
How to cite this article:
El Hammouti Issam, Lajjam Azza and El Merouani Mohamed. A New Meta-Heuristic Approach to Solve the Hybrid Berth Allocation Problem.
DOI: https://doi.org/10.36478/jeasci.2019.4132.4138
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2019.4132.4138