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

Abstract

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.