A hybrid heuristic algorithm for integrated large-capacity quay crane scheduling problem
Authors:
- 1 March 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 309-312
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Quay crane scheduling with non-interference constraints in port container terminalsTransportation Research Part E: Logistics and Transportation Review, 2008
- A crane scheduling method for port container terminalsEuropean Journal of Operational Research, 2004
- Genetic algorithms to schedule container transfers at multimodal terminalsInternational Transactions in Operational Research, 1999
- The crane scheduling problemTransportation Research Part B: Methodological, 1989