Skip to main content
Springer Nature Link
Log in

A Greedy Look-Ahead Heuristic for the Container Relocation Problem

  • Conference paper
Recent Trends in Applied Artificial Intelligence (IEA/AIE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7906))

  • 4283 Accesses

Abstract

This paper addresses a classic problem in the container storage and transportation, the container relocation problem. For a given layout of a container bay, the containers should be retrieved in a predefined order, the best operation plan with fewest crane operations is going to be determined. We develop a greedy look-ahead heuristic for this particular purpose. Comparing with existing approaches presented from literature, our heuristic provides better solutions than best known solutions in shorter computational time.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33(4), 940–954 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Caserta, M., Voß, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectrum 33(4), 915–929 (2011)

    Article  MATH  Google Scholar 

  3. Caserta, M., Voß, S.: A cooperative strategy for guiding the corridor method. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds.) NICSO 2008. SCI, vol. 236, pp. 273–286. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Caserta, M., Voß, S.: Corridor selection and fine tuning for the corridor method. In: Stützle, T. (ed.) LION 3. LNCS, vol. 5851, pp. 163–175. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Zhu, W., Qin, H., Lim, A., Zhang, H.: Iterative deepening a* algorithms for the container relocation problem. IEEE Transactions on Automation Science and Engineering 9(4), 710–722 (2012)

    Article  Google Scholar 

  6. Forster, F., Bortfeldt, A.: A tree search procedure for the container relocation problem. Computers & Operations Research 39(2), 299–309 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee, Y., Lee, Y.J.: A heuristic for retrieving containers from a yard. Computers & Operations Research 37(6), 1139–1147 (2010)

    Article  MATH  Google Scholar 

  8. Bortfeldt, A., Forster, F.: A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research 217(3), 531–540 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong

    Bo Jin, Andrew Lim & Wenbin Zhu

Authors
  1. Bo Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenbin Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas State University, 78666, San Marcos, TX, USA

    Moonis Ali

  2. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081, Amsterdam, HV, The Netherlands

    Tibor Bosse

  3. Interactive Intelligence Group, Department of Intelligent Systems, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands

    Koen V. Hindriks  & Catholijn M. Jonker  & 

  4. Computational Intelligence Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Mark Hoogendoorn

  5. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Jan Treur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, B., Lim, A., Zhu, W. (2013). A Greedy Look-Ahead Heuristic for the Container Relocation Problem. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds) Recent Trends in Applied Artificial Intelligence. IEA/AIE 2013. Lecture Notes in Computer Science(), vol 7906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38577-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38577-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38576-6

  • Online ISBN: 978-3-642-38577-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics