Abstract
We study the multi-port continuous berth allocation problem with speed optimization. This problem integrates vessel scheduling with berth allocation at multiple terminals in a collaborative setting. We propose a graph-based formulation and a branch-and-price method to solve the problem. The results show that the branch-and-price procedure outperforms the baseline solver. In our computational study, we highlight the trade-off between solution quality and computational complexity, as a function of the segment length used to model a continuous quay.
Original language | English |
---|---|
Title of host publication | Proceedings of the 13th International Conference Computational Logistics |
Editors | Jesica de Armas, Helena Ramalhinho, Stefan Voß |
Number of pages | 13 |
Publisher | Springer Science and Business Media Deutschland GmbH |
Publication date | 2022 |
Pages | 31-43 |
ISBN (Print) | 9783031165788 |
DOIs | |
Publication status | Published - 2022 |
Event | 13th International Conference on Computational Logistics - Universitat Pompeu Fabra, Barcelona, Spain Duration: 21 Sept 2022 → 23 Sept 2022 Conference number: 13 https://eventum.upf.edu/78123/detail/international-conference-on-computational-logistics-iccl-2022.html |
Conference
Conference | 13th International Conference on Computational Logistics |
---|---|
Number | 13 |
Location | Universitat Pompeu Fabra |
Country/Territory | Spain |
City | Barcelona |
Period | 21/09/2022 → 23/09/2022 |
Internet address |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 13557 LNCS |
ISSN | 0302-9743 |
Keywords
- Container terminal
- Exact methods
- Maritime logistics
- Transportation