An innovative framework for optimizing discrete berth allocation and quay crane assignment problems

Xi Xiang, Xuqiang Chang, Lin Gong*, Xin Liu

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

摘要

This paper delves into the complexities linked with discrete berth allocation and quay crane assignment within automated container terminals, analyzing scenarios that involve both time-invariant and time-variant considerations. We propose a novel approach, redefining discrete berth allocation and time-invariant quay crane assignment problems as resource-constrained project scheduling problems, which are addressed with an efficient branch and cut algorithm. Furthermore, our investigation extends to the domain of time-variant specific quay crane assignment, introducing a purpose-designed two-stage algorithm for effective resolution. Numerical experiments affirm the efficacy of these algorithms in effectively addressing the intricate yet pivotal challenges inherent in automated terminal operations.

源语言英语
文章编号110827
期刊Computers and Industrial Engineering
200
DOI
出版状态已出版 - 2月 2025

指纹

探究 'An innovative framework for optimizing discrete berth allocation and quay crane assignment problems' 的科研主题。它们共同构成独一无二的指纹。

引用此

Xiang, X., Chang, X., Gong, L., & Liu, X. (2025). An innovative framework for optimizing discrete berth allocation and quay crane assignment problems. Computers and Industrial Engineering, 200, 文章 110827. https://doi.org/10.1016/j.cie.2024.110827