Metaheuristic Approaches for the Berth Allocation Problem

Nataša Kovač

Berth Allocation Problem incorporates some of the most important decisions that have to be made in order to achieve maximum efficiency in a port. Terminal man- ager of a port has to assign incoming vessels to the available berths, which need to be loaded/unloaded in such a way that some objective function is optimized. It is well known that even simpler variants of Berth Allocation Problem are NP-hard, and thus, metaheuris- tic approaches are more convenient than exact methods since they provide high quality solutions in reasonable computational time. Metaheuristics are general frameworks used to build heuristic algorithms for hard optimization problems. In this paper, an overview of promising and widely used metaheuristic methods in solving different variants of Berth Allocation Problem is presented.