Container sequencing for quay cranes with internal reshuffles

被引:52
作者
Meisel, Frank [1 ]
Wichmann, Matthias [2 ]
机构
[1] Univ Halle Wittenberg, Sch Business & Econ, D-06108 Halle, Germany
[2] Tech Univ Carolo Wilhelmina Braunschweig, Inst Automot Management & Ind Prod, Braunschweig, Germany
关键词
Container terminal; Container sequencing problem; Double cycling; Internal reshuffle; GRASP; NON-CROSSING CONSTRAINT; SCHEDULING PROBLEM; TERMINALS; OPERATIONS; STOWAGE; SHIP; ALGORITHM;
D O I
10.1007/s00291-009-0191-6
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Fast handling of vessels is one of the most important goals in container terminal operations planning. In recent studies, quay crane double cycling has been investigated to accelerate the service of vessels. In our paper, we show that the service process can be further accelerated by changing the treatment of so-called reshuffle containers. Reshuffle containers have to be removed from their position in the vessel only to gain access to containers stacked below them. Our approach enables to reposition reshuffle containers directly within the bay of a vessel, referred to as internal reshuffles, instead of temporarily unloading them. A mathematical problem formulation and a heuristic solution method, namely a greedy randomized adaptive search procedure, are provided for planning crane operations under internal reshuffles. Computational tests prove that the consideration of internal reshuffles leads to a further shortening of vessel handling times compared to a sole application of crane double cycling.
引用
收藏
页码:569 / 591
页数:23
相关论文
共 26 条
[1]   Stowing a containership: the master bay plan problem [J].
Ambrosino, D ;
Sciomachen, A ;
Tanfani, E .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2004, 38 (02) :81-99
[2]  
Ambrosino D., 2003, Maritime Economics & Logistics, V5, P285
[3]   EXACT AND APPROXIMATE SOLUTIONS OF THE CONTAINER SHIP STOWAGE PROBLEM [J].
AVRIEL, M ;
PENN, M .
COMPUTERS & INDUSTRIAL ENGINEERING, 1993, 25 (1-4) :271-274
[4]  
Bendall H.B., 1996, MARIT POL MANAG, V23, P187, DOI [10.1080/03088839600000075, DOI 10.1080/03088839600000075]
[5]   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
[6]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[7]  
Caserta M, 2008, MATH FORMULATION BLO
[8]  
Chu C. Y., 2002, MARIT POLICY MANAG, V29, P341, DOI DOI 10.1080/03088830210144314
[9]   THE CRANE SCHEDULING PROBLEM [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175
[10]   Crane double cycling in container ports: Planning methods and evaluation [J].
Goodchild, A. V. ;
Daganzo, C. F. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2007, 41 (08) :875-891