A* Algorithm for Optimal Intra-bay Container Pre-marshalling Plan

In most container terminals, containers are piled up and stored in a yard in order to utilize the space efficiently. Hence, it requires unproductive container-handling operations to retrieve a container that is not placed on the top of a container stack. As a result, to streamline container-loading operations by which containers are transferred from a yard to a vessel, it is necessary to pre-marshal (i.e., shuffle in advance) containers in accordance with container-loading plan. We propose algorithm to find the optimal container-relocation sequence for the intra-bay container pre-marshalling problem. To work out the heuristic estimate for the proposed algorithm, we introduce the container rearrangement problem and obtain the lower bound of the length of the optimal relocation sequence. The performance of the algorithm is validated extensively by the numerical experiments on the problem instances that are given in the previous studies and generated randomly with various parameters.

[1]  Kap Hwan Kim,et al.  Load Scheduling Using a Genetic Algorithm in Port Container Terminals , 1997 .

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

[3]  Kwang-Tae Kim,et al.  Metaheuristics of the Rail Crane Scheduling Problem , 2011 .

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

[5]  Kap Hwan Kim,et al.  Yard Planning Considering the Load Profile of Resources in Container Terminals , 2009 .

[6]  Kap Hwan Kim,et al.  A note on a dynamic space-allocation method for outbound containers , 2003, Eur. J. Oper. Res..

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

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

[9]  Kap Hwan Kim,et al.  Deriving stacking strategies for export containers with uncertain weight information , 2006, J. Intell. Manuf..

[10]  Kwang Ryel Ryu,et al.  Generating a rehandling-free intra-block remarshaling plan for an automated container yard , 2011, J. Intell. Manuf..

[11]  Young-Man Park,et al.  A slot assignment method in the container yard for export containers considering their weights , 1996 .

[12]  Akio Imai,et al.  Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks , 2006, Eur. J. Oper. Res..

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

[14]  Shi W. Lee.  A Genetic Algorithm for the Container Pick-Up Problem , 2011 .

[15]  Jiyin Liu,et al.  The assignment of storage locations to containers for a container stack , 2009 .

[16]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .

[17]  Nils J. Nilsson,et al.  Artificial Intelligence: A New Synthesis , 1997 .

[18]  Kap Hwan Kim.  Decision-making Problems for the Operation of Container Terminals , 2007 .

[19]  Shan-Huen Huang,et al.  Heuristic algorithms for container pre-marshalling problems , 2012, Comput. Ind. Eng..

[20]  Kap Hwan Kim,et al.  A Simulation Study on a Workload-based Operation Planning Method in Container Terminals , 2012 .

[21]  Kap Hwan Kim,et al.  A beam search algorithm for the load sequencing of outbound containers in port container terminals , 2004 .

[22]  Loo Hay Lee,et al.  An optimisation framework for yard planning in a container terminal: case with automated rail-mounted gantry cranes , 2010, OR Spectr..

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

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

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