The multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis

TL;DR

This paper addresses a complex multi-port berth allocation problem by optimizing vessel speeds and collaboration strategies, introducing an exact solution method and analyzing benefits through cooperative game theory.

Contribution

It reformulates the multi-port berth allocation problem into a generalized set partitioning model and develops an advanced branch-and-cut-and-price algorithm that outperforms existing solvers.

Findings

Proposed a novel exact solution method for the problem.

Demonstrated improved performance on benchmark instances.

Showed mutual benefits for carriers and terminal operators through collaboration.

Abstract

We consider a variant of the berth allocation problem-i.e., the multi-port berth allocation problem-aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds between multiple ports, thereby exploiting the potentials of a collaboration between carriers (shipping lines) and terminal operators. Using a graph representation of the problem, we reformulate an existing mixed-integer problem into a generalized set partitioning problem, in which each variable refers to a sequence of feasible berths in the ports that the vessel visits. By integrating column generation and cut separation in a branch-and-cut-and-price procedure, our proposed method is able to outperform commercial solvers in a set of benchmark instances and adapt better to larger instances. In addition, we apply cooperative game theory methods to efficiently distribute the savings resulting from a potential collaboration and show that both carriers and terminal operators would benefit from collaborating.