Heuristics for quay crane scheduling at indented berth

被引：31

作者：

Chen, Jiang Hang ^{[1
]}

Lee, Der-Horng ^{[1
]}

Cao, Jin Xin ^{[2
]}

机构：

[1] Natl Univ Singapore, Dept Civil Engn, Singapore 117548, Singapore

[2] Inner Mongolia Univ, Dept Transportat Engn, Hohhot, Peoples R China

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2011年 / 47卷 / 06期

关键词：

Quay crane scheduling; Indented berth; Heuristics;

D O I：

10.1016/j.tre.2011.04.004

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：1005 / 1020

页数：16

共 14 条

[1] 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

[2] A fast heuristic for quay crane scheduling with interference constraints [J].

Bierwirth, Christian ;

Meisel, Frank .

JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360

[3]

Chae J.-W., 2008, INT C COAST ENG HAMB

[4]

Chen J.H., 2010, 89 TRANSP RES BOARD

[5] Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach [J].

Ghirardi, M ;

Potts, CN .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) :457-467

[6] HEURISTICS FOR SCHEDULING UNRELATED PARALLEL MACHINES [J].

HARIRI, AMA ;

POTTS, CN .

COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (03) :323-331

[7] A crane scheduling method for port container terminals [J].

Kim, KH ;

Park, YM .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :752-768

[8] The Berth planning problem [J].

Lim, A .

OPERATIONS RESEARCH LETTERS, 1998, 22 (2-3) :105-110

[9]

Lim A., 2004, 9 SCAND WORKSH ALG T, P323

[10] A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal [J].

Moccia, L ;

Cordeau, JF ;

Gaudioso, M ;

Laporte, G .

NAVAL RESEARCH LOGISTICS, 2006, 53 (01) :45-59

← 1 2 →