期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 56, 期 1, 页码 241-248出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2008.05.011
关键词
-
资金
- University of Tehran [8106043/1/06]
This paper presents a novel, mixed-integer programming (MIP) model for the quay crane (QC) scheduling and assignment problem, namely QCSAP, in a container port (terminal). Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper, thus, proposes a genetic algorithm (GA) to solve the above-mentioned QCSAP for the real-world situations. Further, the efficiency of the proposed CA is compared against the LINGO software package in terms of computational times for small-sized problems. Our computational results suggest that the proposed CA is able to solve the QCSAP, especially for large sizes. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据