Simulated Annealing Algorithm for the Quay Crane Scheduling Problem

The Quay Crane Scheduling Problem (QCSP) is the critical issue for the efficient management of container terminals. This paper proposes simulated annealing algorithm for the quay crane scheduling problem that aims to find an optimal solution of the quay crane scheduling. A computational study demonstrates the effectiveness of the proposed algorithm.