In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a set of ships simultaneously in multiple ports while also considering the sailing speed of ships between ports. Due to the highly combinatorial character of the problem, exact methods struggle to scale to large-size instances, which points to exploring heuristic methods. We present a mixed-integer problem formulation for the MCBAP and introduce an adaptive large neighborhood search (ALNS) algorithm enhanced with a local search procedure to solve it. The computational results highlight the method's suitability for larger instances by providing high-quality solutions in short computational times. Practical insights indicate that the carriers’ and terminal operators’ operational costs are impacted in different ways by fuel prices, external ships at port, and the modeling of a continuous quay.
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
2024-01-01
Martin-Iradi , B , Pacino , D & Ropke , S 2024 , ' An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem ' , European Journal of Operational Research , vol. 316 , no. 1 , pp. 152-167 . https://doi.org/10.1016/j.ejor.2024.02.003
Article (Journal)
Electronic Resource
English
DDC: | 000 |
The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution
Online Contents | 2010
|The dynamic berth allocation problem for a container port
Online Contents | 2001
|Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals
DOAJ | 2022
|An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
Online Contents | 2016
|Port berth allocation method based on two-dimensional boxing problem
European Patent Office | 2023
|