This paper addresses the well-known dynamic berth allocation problem (DBAP), which finds numerous applications at container terminals aiming to allocate and schedule incoming container vessels into berthing positions along the quay. Due to its impact on ports’ performance, having efficient DBAP formulations is of great importance, especially for determining optimal schedules in quick time as well as aiding managers and developers in the assessment of solution strategies and approximate approaches. In this work, we propose two novel formulations, a time-indexed formulation and an arc-flow one, to efficiently tackle the DBAP. Additionally, to improve computational performance, we propose problem-based modeling enhancements and a variable-fixing procedure that allows to discard some variables by considering their reduced costs. By means of these contributions, we improve the models’ performance in those instances where the optimal solutions were already known, and we solve to optimality for the first time other instances from the literature.

Novel formulations and modeling enhancements for the dynamic berth allocation problem / Kramer, Arthur; Lalla-Ruiz, Eduardo; Iori, Manuel; Voß, Stefan. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 278:1(2019), pp. 170-185. [10.1016/j.ejor.2019.03.036]

Novel formulations and modeling enhancements for the dynamic berth allocation problem

Iori, Manuel;
2019

Abstract

This paper addresses the well-known dynamic berth allocation problem (DBAP), which finds numerous applications at container terminals aiming to allocate and schedule incoming container vessels into berthing positions along the quay. Due to its impact on ports’ performance, having efficient DBAP formulations is of great importance, especially for determining optimal schedules in quick time as well as aiding managers and developers in the assessment of solution strategies and approximate approaches. In this work, we propose two novel formulations, a time-indexed formulation and an arc-flow one, to efficiently tackle the DBAP. Additionally, to improve computational performance, we propose problem-based modeling enhancements and a variable-fixing procedure that allows to discard some variables by considering their reduced costs. By means of these contributions, we improve the models’ performance in those instances where the optimal solutions were already known, and we solve to optimality for the first time other instances from the literature.
28-mar-2019
278
1
170
185
Novel formulations and modeling enhancements for the dynamic berth allocation problem / Kramer, Arthur; Lalla-Ruiz, Eduardo; Iori, Manuel; Voß, Stefan. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 278:1(2019), pp. 170-185. [10.1016/j.ejor.2019.03.036]
Kramer, Arthur; Lalla-Ruiz, Eduardo; Iori, Manuel; Voß, Stefan
File in questo prodotto:
File Dimensione Formato  
DBAP_EJOR.pdf

accesso aperto

Descrizione: Versione pre print
Tipologia: Pre-print dell'autore (bozza pre referaggio)
Dimensione 413.98 kB
Formato Adobe PDF
413.98 kB Adobe PDF Visualizza/Apri
1-s2.0-S0377221719302942-main.pdf

non disponibili

Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 896.27 kB
Formato Adobe PDF
896.27 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1174499
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? 18
social impact