A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals

被引:115
作者
Meisel, Frank [1 ,2 ]
Bierwirth, Christian [1 ]
机构
[1] Univ Halle Wittenberg, Sch Business & Econ, D-06108 Halle, Germany
[2] Interuniv Res Ctr Enterprise Networks Logist & Tr, Montreal, PQ H3C 3J7, Canada
关键词
berth allocation; quay crane assignment; quay crane scheduling; integrated planning; SCHEDULING PROBLEM; EVOLUTIONARY ALGORITHM; PRODUCTIVITY; HEURISTICS; BRANCH;
D O I
10.1287/trsc.1120.0419
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In seaport container terminals, berth allocation, quay crane assignment, and quay crane scheduling problems are solved sequentially. However, this sequential way of planning the seaside operations often hinders obtaining a sufficient resource utilization and service quality at low cost. This paper provides a framework for aligning all decisions that have to be made in an integrative manner. The framework is laid down in three phases. Phase I estimates productivity rates for the cranes from the vessels' stowage plans. The productivity rates are used in Phase II to make berthing decisions and to assign crane capacity to vessels. Phase III determines detailed crane schedules and aligns the decisions made. The framework supports using well-known heuristics for solving the contained subproblems. Computational tests reveal that the integrated planning is computationally tractable for problem scenarios of realistic size. It is also demonstrated that the new approach balances the cost drivers of a terminal much better than the conventional way of operations planning does and that it enables significant cost reductions.
引用
收藏
页码:131 / 147
页数:17
相关论文
共 33 条
[1]  
Ak A., 2006, WORKING PAPER
[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]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[4]   Integrating berth allocation and quay crane assignments [J].
Chang, Daofang ;
Jiang, Zuhua ;
Yan, Wei ;
He, Junliang .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (06) :975-990
[5]   A multi-objective evolutionary algorithm for berth allocation in a container port [J].
Cheong, C. Y. ;
Lin, C. J. ;
Tan, K. C. ;
Liu, D. K. .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :927-+
[6]   Multiship Crane Sequencing with Yard Congestion Constraints [J].
Choo, Shawn ;
Klabjan, Diego ;
Simchi-Levi, David .
TRANSPORTATION SCIENCE, 2010, 44 (01) :98-115
[7]  
Chu C. Y., 2002, MARIT POLICY MANAG, V29, P341, DOI DOI 10.1080/03088830210144314
[8]   Models and tabu search heuristics for the Berth-allocation problem [J].
Cordeau, JF ;
Laporte, G ;
Legato, P ;
Moccia, L .
TRANSPORTATION SCIENCE, 2005, 39 (04) :526-538
[9]   THE CRANE SCHEDULING PROBLEM [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175
[10]  
Dragovic B., 2006, MARIT POLICY MANAG, V33, P281