Document Open Access Logo

VRP-Inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling

Authors Konstantinos Karathanasis , Spyros Kontogiannis , Asterios Pegos , Vasileios Sofianos , Christos Zaroliagis

PDF

File

Thumbnail PDF
PDF
OASIcs.ATMOS.2025.6.pdf
  • Filesize: 0.75 MB
  • 21 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Theory and algorithms for application domains
Keywords
  • Berth Allocation and Scheduling
  • Heuristics
  • Metaheuristics
  • Mixed Integer Linear Programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The Berth Allocation and Scheduling Problem (BASP) is a critical optimization challenge in maritime logistics, aiming to assign arriving vessels to berths efficiently, while adhering to practical constraints. Exploiting the connection of BASP with the Heterogeneous Vehicle Routing Problem with Time Windows (HVRPTW), we propose a mixed integer linear programming (MILP) formulation for a variant of BASP which is of utmost importance in real-world scenarios: the Dynamic Discrete Berth Allocation and Scheduling Problem with Time Windows (DDBASPTW). Consequently, inspired by the wealth of constructive and improvement heuristics for VRP, we design, implement and experimentally evaluate three constructive heuristics, Nearest Neighbour (NN), Insertion (INS), a quick-and-dirty variant of Insertion (qd-INS), as well as two improvement heuristics, Swap and Reinsert, taking into consideration both the online and the offline scenario with respect to vessel arrivals. Finally, we propose, implement and experimentally evaluate, custom-tailored variants for DDBASPTW of a single-solution metaheuristic, the Adaptive Large Neighborhood Search (ALNS), and of two population-based metaheuristics, the Genetic Algorithm (GA) and the Cuckoo Search Algorithm (CSA), which are aimed to solve the offline version of the problem. An extensive experimental evaluation compares these techniques against a generic state-of-the-art MILP solver. Results demonstrate that certain variants of INS not only are extremely fast and deliver competitive solutions, achieving a practical trade-off between execution times and quality of solutions. The improvement heuristics further refine the initial solutions, especially for weaker constructive approaches, offering a lightweight yet effective enhancement mechanism. The metaheuristics consistently yield high-quality solutions with significantly lower computational times compared to the exact MILP solver, making them well-suited for use in real-time or large-scale operational environments.

Cite As Get BibTex

Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasileios Sofianos, and Christos Zaroliagis. VRP-Inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.ATMOS.2025.6

Author Details

Konstantinos Karathanasis
  • Department of Computer Engineering and Informatics, University of Patras, Greece
  • PIKEI New Technologies, Patras, Greece
Spyros Kontogiannis
  • Department of Computer Engineering and Informatics, University of Patras, Greece
  • Computer Technology Institute and Press Diophantus, Patras, Greece
Asterios Pegos
  • Department of Computer Engineering and Informatics, University of Patras, Greece
  • PIKEI New Technologies, Patras, Greece
Vasileios Sofianos
  • Department of Computer Engineering and Informatics, University of Patras, Greece
  • PIKEI New Technologies, Patras, Greece
Christos Zaroliagis
  • Department of Computer Engineering and Informatics, University of Patras, Greece
  • Computer Technology Institute and Press Diophantus, Patras, Greece

Funding

This work is partially supported by the EU I3 Instrument under GA No 101115116 (project AMBITIOUS) and by the University of Patras under GA No 83770 (programme "MEDICUS").

References

  1. Sheraz Aslam, Michalis Michaelides, and Herodotos Herodotou. Optimizing multi-quay berth allocation using the cuckoo search algorithm. In Optimizing Multi-Quay Berth Allocation using the Cuckoo Search Algorithm, March 2022. URL: https://doi.org/10.5220/0011081200003191.
  2. Sheraz Aslam, Michalis P. Michaelides, and Herodotos Herodotou. Enhanced berth allocation using the cuckoo search algorithm. SN Comput. Sci., 3(4):325, 2022. URL: https://doi.org/10.1007/S42979-022-01211-Z.
  3. Katja Buhrkal, Sara Zuglian, Stefan Ropke, Jesper Larsen, and Richard Lusby. Models for the discrete berth allocation problem: A computational comparison. Transportation Research Part E: Logistics and Transportation Review, 47:461-473, July 2011. URL: https://doi.org/10.1016/j.tre.2010.11.016.
  4. Juan F. Correcher, Federico Perea, and Ramon Alvarez-Valdes. The berth allocation and quay crane assignment problem with crane travel and setup times. Computers & Operations Research, 162:106468, 2024. URL: https://doi.org/10.1016/j.cor.2023.106468.
  5. Maxim A. Dulebenets, Masoud Kavoosi, Olumide Abioye, and Junayed Pasha. A self-adaptive evolutionary algorithm for the berth scheduling problem: Towards efficient parameter control. Algorithms, 11(7), 2018. URL: https://doi.org/10.3390/a11070100.
  6. Michel Gendreau, Jean-Yves Potvin, et al. Handbook of metaheuristics, volume 2. Springer, 2010. Google Scholar
  7. Bokang Li, Zeinab Elmi, Ashley Manske, Edwina Jacobs, Yui-yip Lau, Qiong Chen, and Maxim A. Dulebenets. Berth allocation and scheduling at marine container terminals: A state-of-the-art review of solution approaches and relevant scheduling attributes. J. Comput. Des. Eng., 10(4):1707-1735, 2023. URL: https://doi.org/10.1093/JCDE/QWAD075.
  8. Andrew Lim. The berth planning problem. Operations Research Letters, 22(2):105-110, 1998. URL: https://doi.org/10.1016/S0167-6377(98)00010-8.
  9. Fei Liu, Chengyu Lu, Lin Gui, Qingfu Zhang, Xialiang Tong, and Mingxuan Yuan. Heuristics for vehicle routing problem: A survey and recent advances. CoRR, abs/2303.04147, 2023. URL: https://doi.org/10.48550/arXiv.2303.04147.
  10. United Nations Conference on Trade and Development (UNCTAD). Handbook of statistics, 2023. Google Scholar
  11. World Trade Organization. World trade statistical review, 2023. Google Scholar
  12. Piraeus Container Terminal S.A. Piraeus Container Terminal, 2025. URL: https://www.pct.com.gr.
  13. Luigi Pio Prencipe and Mario Marinelli. A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the bee colony optimisation algorithm. Applied Intelligence, 51(7):4127-4142, July 2021. URL: https://doi.org/10.1007/S10489-020-02062-Y.
  14. Franco P. Preparata and Michael Ian Shamos. Computational Geometry - An Introduction. Texts and Monographs in Computer Science. Springer, 1985. URL: https://doi.org/10.1007/978-1-4612-1098-6.
  15. Lingyu Ran, Boning Liu, Guiqing Zhang, and Yongxi Cheng. An improved particle swarm optimization algorithm for berth allocation and time-variant quay crane scheduling problem during an emergency. Expert Syst. Appl., 269:126406, 2025. URL: https://doi.org/10.1016/J.ESWA.2025.126406.
  16. Stefan Ropke and David Pisinger. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40:455-472, November 2006. URL: https://doi.org/10.1287/trsc.1050.0135.
  17. Paolo Toth, Daniele Vigo, Paolo Toth, and Daniele Vigo. Vehicle Routing: Problems, Methods, and Applications, Second Edition. Society for Industrial and Applied Mathematics, USA, 2014. Google Scholar
  18. Setyo Tri Windras Mara, Rachmadi Norcahyo, Panca Jodiawan, Luluk Lusiantoro, and Achmad Pratama Rifai. A survey of adaptive large neighborhood search algorithms and applications. Computers & Operations Research, 146:105903, 2022. URL: https://doi.org/10.1016/j.cor.2022.105903.
  19. Xin-She Yang and Suash Deb. Cuckoo search via levy flights, 2010. URL: https://arxiv.org/abs/1003.1594.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact