The Multi-port Continuous Berth Allocation Problem with Speed Optimization

Bernardo Martin-Iradi, Dario Pacino, Stefan Ropke

Abstract: We study the multi-port continuous berth allocation problem with speed optimization. This problem integrates vessel scheduling with berth allocation at multiple terminals in a collaborative setting. We propose a graph-based formulation and a branch-and-price method to solve the problem. The results show that the branch-and-price procedure outperforms the baseline solver. In our computational study, we highlight the trade-off between solution quality and computational complexity, as a function of the segment length used to model a continuous quay.