A dynamic programming-based matheuristic for the dynamic berth allocation problem
| Year of publication: |
2020
|
|---|---|
| Authors: | Nishi, Tatsushi ; Okura, Tatsuya ; Lalla-Ruiz, Eduardo Anibal ; Voß, Stefan |
| Published in: |
Operations research and systems : XVIII Latin-Iberian-American conference on operations research, Claio 2016. - New York, NY, USA : Springer. - 2020, p. 391-410
|
| Subject: | Dynamic berth allocation problem | Matheuristic | Dynasearch | Lagrangian decomposition | Theorie | Theory | Containerterminal | Container terminal | Scheduling-Verfahren | Scheduling problem | Allokation | Allocation | Dekompositionsverfahren | Decomposition method |
-
Dynamic berth allocation problem for a novel hybrid berth system in container terminal
Lu, Bo, (2025)
-
Xi, Xiang, (2021)
-
Sun, Zhuo, (2024)
- More ...
-
Modeling the capacitated p-cable trench problem with facility costs
Schwarze, Silvia, (2021)
-
Hill, Alessandro, (2019)
-
Decision analytics in port and shipping logistics
Lalla-Ruiz, Eduardo Anibal, (2019)
- More ...