Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
A prescriptive analytics approach to solve the continuous berth allocation and yard assignment problem using integrated carbon emissions policies. |
| Συγγραφείς: |
Jauhar, Sunil Kumar1 (AUTHOR) sunil.jauhar@iimkashipur.ac.in, Pratap, Saurabh2 (AUTHOR) s.pratapiitkgp@gmail.com, Kamble, Sachin3 (AUTHOR) sachin.kamble@edhec.edu, Gupta, Shivam4 (AUTHOR) shivam.gupta@neoma-bs.fr, Belhadi, Amine5 (AUTHOR) belhadi.amine@outlook.com |
| Πηγή: |
Annals of Operations Research. Apr2026, Vol. 359 Issue 1, p157-188. 32p. |
| Θεματικοί όροι: |
*Maritime shipping, *Mathematical models, *Data analytics, Carbon emissions, Assignment problems (Programming), Metaheuristic algorithms, Container terminals |
| Περίληψη: |
As industrialization continues, the world faces issues related to increased energy consumption and massive carbon emissions. Given the growing complexity of maritime transport operations, whose role in the global trading system has grown significantly over the last few decades, this has resulted in an increase in carbon emissions from vessels and quay cranes alike. The efficiency of maritime transport operations is critical, and proposing a prescriptive analytics-based comprehensive approach to improving it is vital. The expansion of container terminals has resulted in increased global container traffic, which has increased carbon emissions from both vessels and quay cranes. This paper aims to provide a comprehensive, prescriptive, analytics-based approach to the integrated planning decision of the dynamic berth allocation problem (DBAP) while reducing carbon emissions. We investigate the implications of consecutive berths and yard assignments for carbon emissions during port handling and sea operations. We created a mathematical model to reduce handling operations, anchorage waiting time costs, demurrage costs, costs incurred due to deviations from vessels' preferred positions, and carbon tax costs. We propose two kinds of solutions: (i) ILOG CPLEX Solver and (ii) meta-heuristics i.e., particle swarm optimization (PSO), advanced PSO (APSO), shuffled complex evolution (SCE), and the shuffled frog leaping algorithm (SFLA). The SFLA performs better than other meta-heuristics Algorithm in all the instances. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |