Quayside Operations Planning Under Uncertainty

Abstract

The quayside operation problem is one of the key components in the management system for a container terminal. This work focuses on three important problems that represent a bottleneck on terminal operations: Berth Allocation Problem (BAP), Quay Crane Assignment and Scheduling Problems (QCASP).The state-of-art models mostly rely on forecasted, deterministic vessel arrivals, and they mostly assume that uniform QC operations is maintained. However, in reality, these parameters are mostly random. In this study, we present a stochastic programming approach based on a decomposition algorithm to solve this problem under uncertainty. The preliminary results show that our approach efficiently solves the problem compared to deterministic equivalent formulation