Models for the discrete berth allocation problem: A computational comparison

In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe three main models of the discrete dynamic berth allocation problem, improve the performance of one model, and, through extensive numerical tests, compare all models from a computational perspective. The results indicate that a generalized set-partitioning model outperforms all other existing models.

Research highlights
► We investigate several mixed integer models for the dynamic berth allocation problem.
► The best of the models can solve a large number of previously unsolved instances.
► The quality of existing heuristics for the problem is evaluated using the new results.