Optimizing container relocation operations at container yards with beam search

Container relocation problem (CRP) involves the retrieval of all containers from the container yard with a minimum number of relocations. The CRP is an NP-hard problem such that the large-scale instances cannot be solved to optimality by exact solution methods within a reasonable computational time. This article proposes a beam search (BS) algorithm embedded with heuristics to evaluate the problems. The proposed beam search is tested on benchmark instances and compared with other leading heuristics from the literature. Computational results demonstrate that the beam search algorithm is compatible with other heuristics and can obtain good solutions in short time.

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

[2]  Chung Yee Lee,et al.  A mathematical formulation and efficient heuristics for the dynamic container relocation problem , 2014 .

[3]  Anne Goodchild,et al.  The impact of truck arrival information on container terminal rehandling , 2010 .

[4]  Katta G. Murty,et al.  Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System , 2005, Interfaces.

[5]  Ihsan Sabuncuoglu,et al.  Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling , 2008, Eur. J. Oper. Res..

[6]  Yusin Lee,et al.  The container retrieval problem with respect to relocation , 2015 .

[7]  Tonguç Ünlüyurt,et al.  Improved Rehandling Strategies for the Container Retrieval Process , 2012 .

[8]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

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

[10]  Andrew Lim,et al.  Solving the container relocation problem by an improved greedy look-ahead heuristic , 2015, Eur. J. Oper. Res..

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

[12]  Belén Melián-Batista,et al.  An exact approach for the Blocks Relocation Problem , 2015, Expert Syst. Appl..

[13]  Sigrid Knust,et al.  Loading, unloading and premarshalling of stacks in storage areas: Survey and classification , 2014, Eur. J. Oper. Res..

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

[15]  Matthew E. H. Petering,et al.  A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem , 2013, Eur. J. Oper. Res..

[16]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

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

[18]  Stefan Voß,et al.  A chain heuristic for the Blocks Relocation Problem , 2014, Comput. Ind. Eng..

[19]  Stefan Voß,et al.  Container Rehandling at Maritime Container Terminals , 2011 .

[20]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[21]  Stephen F. Smith,et al.  Viewing scheduling as an opportunistic problem-solving process , 1988 .

[22]  Huiling Zhu,et al.  Optimization of loading sequence and rehandling strategy for multi-quay crane operations in container terminals , 2015 .

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

[24]  Leyuan Shi,et al.  A note on deriving decision rules to locate export containers in container yards , 2010, Eur. J. Oper. Res..

[25]  Belén Melián-Batista,et al.  A domain-specific knowledge-based heuristic for the Blocks Relocation Problem , 2014, Adv. Eng. Informatics.

[26]  João Pedro Pedroso,et al.  Heuristic search for the stacking problem , 2012, Int. Trans. Oper. Res..

[27]  Andrew Lim,et al.  Iterative Deepening A* Algorithms for the Container Relocation Problem , 2012, IEEE Transactions on Automation Science and Engineering.

[28]  Lixin Tang,et al.  Research into container reshuffling and stacking problems in container terminal yards , 2015 .

[29]  Kees Jan Roodbergen,et al.  Storage yard operations in container terminals: Literature overview, trends, and research directions , 2014, Eur. J. Oper. Res..

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

[31]  Kap Hwan Kim,et al.  A grouped storage method for minimizing relocations in block stacking systems , 2006, J. Intell. Manuf..

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

[33]  Stefan Voß,et al.  A mathematical formulation and complexity considerations for the blocks relocation problem , 2012, Eur. J. Oper. Res..

[34]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[35]  Dominique Feillet,et al.  Branch and price approach for the container relocation problem , 2013 .

[36]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .