期刊
ENGINEERING OPTIMIZATION
卷 40, 期 2, 页码 179-189出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/03052150701686366
关键词
port container terminal; quay crane scheduling; handling priority; genetic algorithm
The quay crane scheduling problem studied in this article is to determine a handling sequence of ship bays for quay cranes assigned to a container ship considering handling priority of every ship bay. This article provides a mixed integer programming model for the considered problem. A genetic algorithm (GA) is proposed to obtain near-optimal solutions. Computational experiments to examine the proposed model and solution algorithm are described. The computational results show that the proposed GA is effective and efficient in solving the considered quay crane scheduling problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据