Solving the hybrid berth allocation problem using a bat-inspired algorithm

In this paper, we developed a new metaheuristic based on the bat-inspired algorithm for solving the Berth Allocation Problem (BAP). This problem consists generally on planning a vessel assignment to the berth, with the objective of minimizing the time spent by vessels in port. In our study, we consider a hybrid berth's type where two vessels can be moored at the same time if their total length is less or equal to the overall length of the berth. Indeed, this hybrid case is rarely taken into account by the other studies which always supposed that a berth can serve just one vessel at the same time. A mathematical model is presented which in addition to assigning a given berth to each vessel calling at the port, aims to minimize its staying cost at the terminal. Different computational experiments based on the traffic data observed from Tangier container terminal in Morocco are realized to show the effectiveness of our results.