Skip to main content
Log in

Applying the corridor method to a blocks relocation problem

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

In this paper, we present a corridor method inspired algorithm for a blocks relocation problem in block stacking systems. Typical applications of such problem are found in the stacking of container terminals in a yard, of pallets and boxes in a warehouse, etc. The proposed algorithm applies a recently proposed metaheuristic. In a method-based neighborhood we define a two-dimensional “corridor” around the incumbent blocks configuration by imposing exogenous constraints on the solution space of the problem and apply a dynamic programming algorithm capturing the state of the system after each block movement for exploring the neighborhoods. Computational results on medium- and large-size problem instances allow to draw conclusions about the effectiveness of the proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Ambrosino D, Sciomachen A, Tanfani E (2004) Stowing a containership: the master bay plan problem. Transp Res A 38: 81–99

    Article  Google Scholar 

  • Ambrosino D, Sciomachen A, Tanfani E (2006) A decomposition heuristics for the container ship stowage problem. J Heuristics 12: 211–233

    Article  Google Scholar 

  • Avriel M, Penn M, Shpirer N, Witteboon S (1998) Stowage planning for container ships to reduce the number of shifts. Ann Oper Res 76: 55–71

    Article  Google Scholar 

  • Avriel M, Penn M, Shpirer N (2000) Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl Math 103: 271–279

    Article  Google Scholar 

  • Castilho B, Daganzo C (1993) Handling strategies for import containers at marine terminals. Transp Res B 27: 151–166

    Article  Google Scholar 

  • Glover F, Laguna M (1997) Tabu Search. Kluwer, Boston

    Book  Google Scholar 

  • Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32: 701–711

    Article  Google Scholar 

  • Kim KH, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33: 940–954

    Article  Google Scholar 

  • Kim KH, Park YM, Ryu KR (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124: 89–101

    Article  Google Scholar 

  • Sniedovich M, Voß S (2006) The corridor method: a dynamic programming inspired metaheuristic. Control Cybern 35: 551–578

    Google Scholar 

  • Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectrum 30: 1–52

    Article  Google Scholar 

  • Steenken D, Voß S, Stahlbock R (2004) Container terminal operations and operations research—a classification and literature review. OR Spectrum 26: 3–49

    Article  Google Scholar 

  • Watanabe I (1991) Characteristics and analysis method of efficiencies of container terminal: an approach to the optimal loading/unloading method. Contain Age 3: 36–47

    Google Scholar 

  • Yang JH, Kim KH (2006) A grouped storage method for minimizing relocations in block stacking systems. J Intell Manuf 17: 453–463

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Voß.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caserta, M., Voß, S. & Sniedovich, M. Applying the corridor method to a blocks relocation problem. OR Spectrum 33, 915–929 (2011). https://doi.org/10.1007/s00291-009-0176-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-009-0176-5

Keywords

Navigation