TY - JOUR
T1 - A dynamic programming-based matheuristic for the dynamic berth allocation problem
AU - Nishi, Tatsushi
AU - Okura, Tatsuya
AU - Lalla-Ruiz, Eduardo
AU - Voß, Stefan
N1 - Funding Information:
This work was partially supported by Japan Society for the Promotion of Science (Grant No. 15H02971). Also, this work was partially funded by the Spanish Ministry of Economy and Competitiveness with FEDER funds (Project TIN2015- 70226-R).
Publisher Copyright:
© 2017, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2020/3/1
Y1 - 2020/3/1
N2 - 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.
AB - 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.
KW - Dynamic berth allocation problem
KW - Dynasearch
KW - Lagrangian decomposition
KW - Matheuristic
UR - http://www.scopus.com/inward/record.url?scp=85034566603&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034566603&partnerID=8YFLogxK
U2 - 10.1007/s10479-017-2715-9
DO - 10.1007/s10479-017-2715-9
M3 - Article
AN - SCOPUS:85034566603
SN - 0254-5330
VL - 286
SP - 391
EP - 410
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1-2
ER -