The Quay Crane Scheduling Problem

被引:41
作者
Al-Dhaheri, Noura [1 ]
Diabat, Ali [1 ]
机构
[1] Masdar Inst Sci & Technol, Dept Engn Syst & Management, Abu Dhabi, U Arab Emirates
关键词
Quay Crane Scheduling; MIP formulation; Container terminals; Maritime logistics; ASSIGNMENT;
D O I
10.1016/j.jmsy.2015.02.010
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The recent growth in worldwide container terminals' traffic resulted in a crucial need for optimization models to manage the seaside operations and resources. Along with the recent increase in ship size and the container volume, the advancements in the field of Quay Crane Scheduling introduced the need for new modeling approaches. This is the motivation behind the current paper, which focuses on developing a novel yet simple formulation to address the Quay Crane Scheduling Problem (QCSP). The objective of the problem is to determine the sequence of discharge operations of a vessel that a set number of quay cranes will perform so that the completion time of the operations is minimized. The major contribution is attributed to the way that minimization is performed, which is by minimizing the differences between the container loads stacked over a number of bays and by maintaining a balanced load across the bays. Furthermore, important considerations are taken into account, such as the bidirectional movement of cranes and the ability to travel between bays even before completion of all container tasks. These realistic assumptions usually increase model complexity; however, in the current work this is offset by the novel simple objective. This paper presents a mixed-integer programming (MIP) formulation for the problem, which has been validated through multiple test runs with different parameters. Results demonstrate that the problem is solved extremely efficiently, especially for small problem sizes. (C) 2015 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:87 / 94
页数:8
相关论文
共 26 条
[1]  
Al Zaabi S., RAIRO OPERA IN PRESS
[2]   Optimising the container transhipment hub location in northern Europe [J].
Baird, Alfred J. .
JOURNAL OF TRANSPORT GEOGRAPHY, 2006, 14 (03) :195-214
[3]   A survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627
[4]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[5]   Multiship Crane Sequencing with Yard Congestion Constraints [J].
Choo, Shawn ;
Klabjan, Diego ;
Simchi-Levi, David .
TRANSPORTATION SCIENCE, 2010, 44 (01) :98-115
[6]   A modified genetic algorithm for quay crane scheduling operations [J].
Chung, S. H. ;
Choy, K. L. .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (04) :4213-4221
[7]   THE CRANE SCHEDULING PROBLEM [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175
[8]   An Integrated Quay Crane Assignment and Scheduling Problem [J].
Diabat, Ali ;
Theodorou, Effrosyni .
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 73 :115-123
[9]   A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem [J].
Fu, Yi-Min ;
Diabat, Ali .
APPLIED MATHEMATICAL MODELLING, 2015, 39 (3-4) :1194-1201
[10]   A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach [J].
Fu, Yi-Min ;
Diabat, Ali ;
Tsai, I-Tsung .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (15) :6959-6965