Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5110495 | Transportation Research Part E: Logistics and Transportation Review | 2017 | 31 Pages |
Abstract
This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Lingxiao Wu, Weimin Ma,