Zobrazit v EDS

Muli-Quay Combined Berth and Quay Crane Allocation Using the Cuckoo Search Algorithm

Uloženo v:
Podrobná bibliografie
Název: Muli-Quay Combined Berth and Quay Crane Allocation Using the Cuckoo Search Algorithm
Autoři: Aslam, Sheraz, Michaelides, Michalis, Herodotou, Herodotos
Zdroj: Proceedings of the 10th International Conference on Vehicle Technology and Intelligent Transport Systems
Informace o vydavateli: SCITEPRESS - Science and Technology Publications, 2024.
Rok vydání: 2024
Témata: Cuckoo Search Algorithm, Engineering and Technology, Metaheuristic, Port Efficiency, Electrical Engineering - Electronic Engineering - Information Engineering, Berth and Quay Crane Allocation Problem
Popis: This study investigates the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) while considering a multi-quay setting. First, a mixed integer linear programming mathematical model is developed based on various constraints and real port settings. Then, the multi-quay combined BAP and QCAP is solved using both the exact method and a metaheuristic optimization method, namely, the cuckoo search algorithm (CSA). This analysis pertains to a one-week planning scenario, utilizing data from a real port. The results of the comparative analysis show that the proposed CSA can provide a near-optimal solution (< 1.02% from the optimal) at a fraction of the computational time (10 times faster), as compared to the exact solution. This makes it suitable for solving larger instances of the combined BAP and QCAP for bigger terminals and extended planning horizons.
This work was supported by the European Union’s Horizon Europe program for Research and Innovation through the aerOS project under Grant No. 101069732 as well as by the European Regional Development Fund and the Republic of Cyprus through the Cyprus Research and Innovation Foundation (MDigi-I: STRATEGIC INFRASTRUCTURES/1222/0113)
Druh dokumentu: Article
Conference object
DOI: 10.5220/0012553400003702
Přístupová URL adresa: https://hdl.handle.net/20.500.14279/32834
https://api.elsevier.com/content/abstract/scopus_id/85194102521
Přístupové číslo: edsair.doi.dedup.....7490baf17d160f28f761cb0fd58fa7d3
Databáze: OpenAIRE
Popis
Abstrakt:This study investigates the combined berth allocation problem (BAP) and quay crane allocation problem (QCAP) while considering a multi-quay setting. First, a mixed integer linear programming mathematical model is developed based on various constraints and real port settings. Then, the multi-quay combined BAP and QCAP is solved using both the exact method and a metaheuristic optimization method, namely, the cuckoo search algorithm (CSA). This analysis pertains to a one-week planning scenario, utilizing data from a real port. The results of the comparative analysis show that the proposed CSA can provide a near-optimal solution (< 1.02% from the optimal) at a fraction of the computational time (10 times faster), as compared to the exact solution. This makes it suitable for solving larger instances of the combined BAP and QCAP for bigger terminals and extended planning horizons.<br />This work was supported by the European Union’s Horizon Europe program for Research and Innovation through the aerOS project under Grant No. 101069732 as well as by the European Regional Development Fund and the Republic of Cyprus through the Cyprus Research and Innovation Foundation (MDigi-I: STRATEGIC INFRASTRUCTURES/1222/0113)
DOI:10.5220/0012553400003702