A New Simulated Annealing Based Method for the Container Relocation Problem

In container terminal yards, the Container Relocation Problem (CRP) aims to minimize the needed relocations of blocking containers above the container that would be retrieved. In this paper a simulated annealing based approach for the restricted version of the CRP is proposed. The proposed approach does not need any transformation of the problem input or output. The output solution is a vector of elements equal to the number of containers to be retrieved. The number of required relocations before retrieval of each container is generated. The idea of the algorithm evolves from accepting solutions with higher number of relocations at the beginning hopefully ending with minimum total number of movements. The computational experiments illustrate that the proposed algorithm is successful in generating optimal solutions for small size benchmark instances.

[1]  Amr B. Eltawil,et al.  A Proposed Heuristic for Solving the Container Pre-marshalling Problem , 2013 .

[2]  Tiziano Bacci,et al.  The bounded beam search algorithm for the block relocation problem , 2019, Comput. Oper. Res..

[3]  Cynthia Barnhart,et al.  Dynamic Stochastic Optimization of Relocations in Container Terminals , 2013 .

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

[5]  Amr B. Eltawil,et al.  AN INTEGER PROGRAMMING FORMULATION AND SOLUTION FOR THE CONTAINER PRE- MARSHALLING PROBLEM , 2014 .

[6]  Chin‐Yuan Chu,et al.  Determining container terminal capacity on the basis of an adopted yard handling system , 2005 .

[7]  Amr B. Eltawil,et al.  A Simulation Based Study Of The Effect Of Truck Arrival Patterns On Truck Turn Time In Container Terminals , 2016, ECMS.

[8]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[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]  Andreas Beham,et al.  New insights on the block relocation problem , 2018, Comput. Oper. Res..

[12]  Shixin Liu,et al.  Tree search procedures for the blocks relocation problem with batch moves , 2016 .

[13]  Ching-Jung Ting,et al.  A BEAM SEARCH ALGORITHM FOR MINIMIZING RESHUFFLE OPERATIONS AT CONTAINER YARDS , 2010 .

[14]  J. Tongzon,et al.  Port privatization, efficiency and competitiveness: Some empirical evidence from container ports (terminals) , 2005 .

[15]  Roberto Roberti,et al.  A Decomposition Method for Finding Optimal Container Stowage Plans , 2018, Transp. Sci..

[16]  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..

[17]  Basheer M. Khumawala,et al.  An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems , 1997 .

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

[19]  Amr B. Eltawil,et al.  Impact of Collaborative External Truck Scheduling on Yard Efficiency in Container Terminals , 2017, ICORES 2017.

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

[21]  Matthew E. H. Petering,et al.  Genetic algorithm-based simulation optimization of stacking algorithms for yard cranes to reduce fuel consumption at seaport container transshipment terminals , 2012, 2012 IEEE Congress on Evolutionary Computation.

[22]  Amr B. Eltawil,et al.  Solving the container pre-marshalling problem using variable length genetic algorithms , 2016 .

[23]  Ching-Jung Ting,et al.  APPLING TABU SEARCH FOR MINIMIZING RESHUFFLE OPERATIONS AT CONTAINER YARDS , 2009 .

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

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

[26]  Milan Tuba,et al.  An efficient ant colony optimization algorithm for the blocks relocation problem , 2019, Eur. J. Oper. Res..

[27]  Dusan Ku,et al.  Container relocation problem with time windows for container departure , 2016, Eur. J. Oper. Res..

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

[29]  Ching-Jung Ting,et al.  Optimizing container relocation operations at container yards with beam search , 2017 .

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

[31]  R. Asariotis,et al.  Review of Maritime Transport, 2014 , 2010 .

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

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

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

[35]  Emile H. L. Aarts,et al.  Performance of the simulated annealing algorithm , 1987 .

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