A tree search procedure for the container pre-marshalling problem

In the container pre-marshalling problem (CPMP) n items are given that belong to G different item groups (g=1,…,G) and that are piled up in up to S stacks with a maximum stack height H. A move can shift one item from one stack to another one. A sequence of moves of minimum length has to be determined that transforms the initial item distribution so that in each of the stacks the items are sorted by their group index g in descending order. The CPMP occurs frequently in container terminals of seaports. It has to be solved when export containers, piled up in stacks, are sorted in a pre-marshalling process so that they can be loaded afterwards onto a ship faster and more efficiently. This article presents a heuristic tree search procedure for the CPMP. The procedure is compared to solution approaches for the CPMP that were published so far and turns out to be very competitive. Moreover, computational results for new and difficult CPMP instances are presented.

[1]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[2]  Andreas Bortfeldt,et al.  A tree search procedure for the container relocation problem , 2012, Comput. Oper. Res..

[3]  Kap Hwan Kim,et al.  Deriving decision rules to locate export containers in container yards , 2000, Eur. J. Oper. Res..

[4]  Yusin Lee,et al.  A neighborhood search heuristic for pre-marshalling export containers , 2009, Eur. J. Oper. Res..

[5]  Kap Hwan Kim,et al.  The optimal determination of the space requirement and the number of transfer cranes for import containers , 1998 .

[6]  Kap Hwan Kim,et al.  Re-marshaling export containers in port container terminals , 1998 .

[7]  Michael R. Bussieck,et al.  Scheduling trams in the morning , 1999, Math. Methods Oper. Res..

[8]  Stefan Voß,et al.  A Cooperative Strategy for Guiding the Corridor Method , 2008, NICSO.

[9]  Yusin Lee,et al.  A heuristic for retrieving containers from a yard , 2010, Comput. Oper. Res..

[10]  Stefan Voß,et al.  A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic , 2009, EvoCOP.

[11]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

[12]  Kap Hwan Kim,et al.  Segregating space allocation models for container inventories in port container terminals , 1999 .

[13]  Tongtong Chen.  Yard operations in the container terminal-a study in the ‘unproductive moves’ , 1999 .

[14]  Yusin Lee,et al.  An optimization model for the container pre-marshalling problem , 2007, Comput. Oper. Res..

[15]  Stefan Voß,et al.  A Corridor Method-Based Algorithm for the Pre-marshalling Problem , 2009, EvoWorkshops.

[16]  Stefan Voß,et al.  Corridor Selection and Fine Tuning for the Corridor Method , 2009, LION.

[17]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[18]  Stefan Voß,et al.  Applying the corridor method to a blocks relocation problem , 2011, OR Spectr..

[19]  Kap Hwan Kim,et al.  A heuristic rule for relocating blocks , 2006, Comput. Oper. Res..

[20]  Frank Meisel,et al.  Container sequencing for quay cranes with internal reshuffles , 2010, OR Spectr..

[21]  Kap Hwan Kim,et al.  Evaluation of the number of rehandles in container yards , 1997 .