Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1024106 | Transportation Research Part E: Logistics and Transportation Review | 2008 | 12 Pages |
Abstract
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.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Der-Horng Lee, Hui Qiu Wang, Lixin Miao,