https://orcid.org/http://orcid.org/0000-0003-1296-4221
https://orcid.org/http://orcid.org/0000-0003-1296-4221
The increasing maritime traffic forces terminal operators to efficiently reduce the container ships’ service time in order to maintain or increase their market share. This situation gives rise to the well-known berth allocation problem. Its goal is to determine the allocation and the berthing time of container ships arriving to the port with the aim of minimizing the total service time. For tackling this problem, we propose a dynamic programming-based matheuristic that allows to derive lower and upper bounds, and therefore, evaluate the optimality of the provided solutions. Its behavior is assessed on realistic problem instances from the related literature as well as on a new set of larger instances with 150 ships and 15 berths. The results indicate that our proposed approach shows a competitive performance.
A dynamic programming-based matheuristic for the dynamic berth allocation problem
Ann Oper Res
Annals of Operations Research ; 286 , 1-2 ; 391-410
01.03.2020
20 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The dynamic berth allocation problem for a container port
| Elsevier | 2001
The dynamic berth allocation problem for a container port
| Online Contents | 2001
A Rolling Horizon-Based Constraint Programming Method for Continuous Berth Allocation Problem
| Springer Verlag | 2024
The stochastic discrete berth allocation problem
| Online Contents | 2019
Integrated Laycan and Berth Allocation Problem
| IEEE | 2019