Maximizing the number of dual-cycle operations of quay cranes in container terminals

Abstract

An important objective of all schedules in a port is to minimize turnaround time of vessels. An operation schedule for Quay Cranes (QCs) can significantly affect the turnaround time of a vessel. Recently dual cycling techniques have already been used for reducing the number of operation cycles of QCs in some advanced container terminals. This study attempts to minimize the number of operation cycles of a QC for discharging and loading containers in a ship-bay, which is equivalent to maximizing the number of dual cycle operations. A formulation in QC scheduling problems is proposed as a mixed integer programming model. A hybrid heuristic approach is proposed to solve this model. The algorithm applied in this study takes two types of sequencing into account, i.e. inter-stage sequencing (hatch sequencing) and intra-stage sequencing (stack sequencing in the same hatch). This approach hybridizes a certain reconstructive Johnson’s rule with an effective local search method. Finally, certain data in real cases are used to evaluate the effectiveness of the proposed approach.