A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time

被引:204
作者
Han, Xiao-le [1 ]
Lu, Zhi-qiang [1 ]
Xi, Li-feng [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Ind Engn & Management, Shanghai 200240, Peoples R China
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Genetic Algorithm; Stochastic simulation; Berth and quay crane scheduling; Uncertainty; ALLOCATION PROBLEM; CONTAINER PORT; ALGORITHM;
D O I
10.1016/j.ejor.2010.07.018
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
For a container terminal system, efficient berth and quay crane (QC) schedules have great impact on the improvement of both operation efficiency and customer satisfaction. In this paper we address berth and quay crane scheduling problems in a simultaneous way, with uncertainties of vessel arrival time and container handling time. The berths are of discrete type and vessels arrive dynamically with different service priorities. QCs are allowed to move to other berths before finishing processing on currently assigned vessels, adding more flexibility to the terminal system. A mixed integer programming model is proposed, and a simulation based Genetic Algorithm (GA) search procedure is applied to generate robust berth and QC schedule proactively. Computational experiment shows the satisfied performance of our developed algorithm under uncertainty. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1327 / 1340
页数:14
相关论文
共 18 条
[1]   Executing production schedules in the face of uncertainties: A review and some future directions [J].
Aytug, H ;
Lawley, MA ;
McKay, K ;
Mohan, S ;
Uzsoy, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) :86-110
[2]   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
[3]   Berth allocation in a container port: using a continuous location space approach [J].
Imai, A ;
Sun, X ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :199-221
[4]   The dynamic berth allocation problem for a container port [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417
[5]   The simultaneous berth and quay crane allocation problem [J].
Imai, Akio ;
Chen, Hsieh Chia ;
Nishimura, Etsuko ;
Papadimitriou, Stratos .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (05) :900-920
[6]  
KADIPASAOGLU AY, 2009, Computers Industrial, V56, P106
[7]   Berth scheduling by simulated annealing [J].
Kim, KH ;
Moon, KC .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :541-560
[8]   Quay crane scheduling with non-interference constraints in port container terminals [J].
Lee, Der-Horng ;
Wang, Hui Qiu ;
Miao, Lixin .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (01) :124-135
[9]   A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning [J].
Liang, Chengji ;
Huang, Youfang ;
Yang, Yang .
COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (03) :1021-1028
[10]   Heuristics for the integration of crane productivity in the berth allocation problem [J].
Meisel, Frank ;
Bierwirth, Christian .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (01) :196-209