Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 44, Issue 1, Pages 124-135Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2006.08.001
Keywords
port container terminal; quay crane scheduling; NP-completeness; genetic algorithm
Ask authors/readers for more resources
The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed model and solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the considered quay crane scheduling problem. (C) 2006 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available