A dynamic programming-based matheuristic for the dynamic berth allocation problem

Tatsushi Nishi (), Tatsuya Okura (), Eduardo Lalla-Ruiz () and Stefan Voß ()
Additional contact information
Tatsushi Nishi: Osaka University
Tatsuya Okura: Osaka University
Eduardo Lalla-Ruiz: University of Hamburg
Stefan Voß: University of Hamburg

Annals of Operations Research, 2020, vol. 286, issue 1, No 17, 410 pages

Abstract: Abstract 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.

Keywords: Dynamic berth allocation problem; Matheuristic; Dynasearch; Lagrangian decomposition (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2715-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-017-2715-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2715-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().