Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10479-017-2715-9 | Annals of Operations Research |
Keywords | Field | DocType |
Dynamic berth allocation problem, Matheuristic, Dynasearch, Lagrangian decomposition | Dynamic programming,Mathematical optimization,Berth allocation problem,Operator (computer programming),Lagrangian decomposition,Market share,Mathematics,Service time | Journal |
Volume | Issue | ISSN |
286 | 1 | 1572-9338 |
Citations | PageRank | References |
3 | 0.38 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tatsushi Nishi | 1 | 156 | 21.84 |
| Tatsuya Okura | 2 | 3 | 0.38 |
| Eduardo Lalla-Ruiz | 3 | 150 | 18.82 |
| Stefan Voß | 4 | 592 | 46.77 |