A hybrid heuristic algorithm for integrated large-capacity quay crane scheduling problem

This paper proposed a hybrid heuristic algorithm for the integrated large-capacity quay crane scheduling which has two-quay-crane with non-interference constraints, and this model is decomposed into two types of sequencing, i.e. interstage sequencing (hatch sequencing) and intra-stage sequencing (stack sequencing in the same hatch).The stack sequencing problem is solved by a certain reconstructive Johnson´s rule with an effective local search capability. While a discrete particle swarm optimization is used to generate the solution of the hatch sequencing problem. Finally, numerical experiment was conducted and the simulation results show that the hybrid heuristic algorithm is able to solve the QC scheduling problem, especially for large sizes.