Optimizing Multi-Quay Berth Allocation using the Cuckoo Search Algorithm

Abstract

Proper utilization of port resources and efficient berth planning play a crucial role in minimizing port congestion and overall handling costs. Therefore, this study focuses on efficient berth planning in maritime container terminals composed of multiple quays. In particular, this study addresses the Multi-Quay Berth Allocation Problem (MQ-BAP), where a continuous berthing layout is considered along with dynamic ship arrivals and practical constraints such as safety time windows and safety distances between ships. Since MQ-BAP is an NP-hard problem, this study proposes a metaheuristic-based approach, the Cuckoo Search Algorithm (CSA) for solving the problem. A comparative study is also performed using real data instances collected from the Port of Limassol, Cyprus, against a genetic algorithm solution proposed in the recent literature, as well as the optimal exact solution implemented using MILP. The results of the experiments show the effectiveness of our proposed CSA approach in handling real-world berth allocation in ports with multiple quays while also considering practical constraints.