Models for continuous berth allocation and quay crane assignment: Computational comparison

摘要

This paper reviews the state-of-the-art models for the continuous and dynamic berth allocation and quay crane assignment problem. This problem arises at the seaside of the container terminals, and it is mostly studied at the operational level. The problem aims at determining a berthing position in a k^{th-meter partitioned continuous berth, a berthing start and end time, and a quay crane assignment for each vessel calling the terminal. The quay crane assignment includes the number of quay cranes allocated to each vessel at each time period. The state-of-the-art models are run with same settings and benchmark. The results indicate that set-partitioning model and an enhanced compact model outperform the remainder.}