Please use this identifier to cite or link to this item:
|Title:||Quay crane scheduling with non-crossing and safety distance constraints in port container terminals|
Port container terminal
Quay crane scheduling
|Citation:||Wang, H.Q.,Lee, D.-H.,Cao, Z.,Miao, L. (2006). Quay crane scheduling with non-crossing and safety distance constraints in port container terminals. 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 : 1209-1221. ScholarBank@NUS Repository.|
|Abstract:||The efficiency of port container terminals is often measured in terms of the time required to unload and load a container ship by quay cranes. This paper assumes that a container ship is divided into ship bays. The quay crane scheduling problem studied in this paper is to determine a handling sequence of ship bays for quay cranes assigned to a container ship in order to minimize the completion time of the container ship with consideration of non-crossing and safety distance constraints. This paper provides a mixed integer linear programming model for the quay crane scheduling problem that is NP-complete in nature. A genetic algorithm and a constructive algorithm that is currently adopted by port container terminals are proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed model and algorithms. The computational results show that the proposed genetic algorithm is effective and efficient in solving the considered quay crane scheduling problem and far outperforms the constructive algorithm. The proposed genetic algorithm can be considered as an appropriate approach to scheduling quay cranes instead of the constructive algorithm in port container terminals to enhance their efficiency.|
|Source Title:||36th International Conference on Computers and Industrial Engineering, ICC and IE 2006|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.