A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations

The goal of the berth allocation problem under time-dependent limitations is to assign and schedule incoming vessels to berthing positions taking into account tidal and water depth constraints. In order to solve this problem, we propose a POPMUSIC approach (Partial Optimization Metaheuristic Under S...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 253; no. 2; pp. 871 - 897
Main Authors Lalla-Ruiz, Eduardo, Voß, Stefan, Expósito-Izquierdo, Christopher, Melián-Batista, Belén, Moreno-Vega, J. Marcos
Format Journal Article
LanguageEnglish
Published New York Springer US 01.06.2017
Springer
Subjects
Business and Management
Combinatorics
Container ports
Management research
Operations Research/Decision Theory
Scheduling (Management)
Theory of Computation
Metaheuristics
POPMUSIC
Maritime shipping
Berth allocation
Matheuristics
Online AccessGet full text

Cover

More Information
Summary:The goal of the berth allocation problem under time-dependent limitations is to assign and schedule incoming vessels to berthing positions taking into account tidal and water depth constraints. In order to solve this problem, we propose a POPMUSIC approach (Partial Optimization Metaheuristic Under Special Intensification Conditions) which includes the resolution of an appropriate mathematical programming formulation as an embedded procedure. This method is tested over realistic problem instances proposed in the literature. The computational experiments as well as the comparison with a reference algorithm for this problem reported in the related literature reveal that our approach is suitable to be used in real-world environments.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-015-2055-6