期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
卷 44, 期 1, 页码 124-135出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2006.08.001
关键词
port container terminal; quay crane scheduling; NP-completeness; genetic algorithm
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据