An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports

被引：86

作者：

Tavakkoli-Moghaddam, R. ^{[1
]}

Makui, A. ^{[2
]}

Salahi, S. ^{[3
]}

Bazzazi, M. ^{[4
]}

Taheri, F. ^{[4
]}

机构：

[1] Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran

[2] Iran Univ Sci & Technol, Dept Ind Engn, Tehran, Iran

[3] Islamic Azad Univ, Dept Ind Engn, Sci & Res Branch, Tehran, Iran

[4] Mazandaran Univ Sceince & Technol, Dept Ind Engn, Babol Sar, Iran

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2009年 / 56卷 / 01期

关键词：

BERTH ALLOCATION;

D O I：

10.1016/j.cie.2008.05.011

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：241 / 248

页数：8