Skip to main content
Springer Nature Link
Log in

An Investigation of IDA* Algorithms for the Container Relocation Problem

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

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

  • 2319 Accesses

Abstract

The container relocation problem, where containers that are stored in bays are retrieved in a fixed sequence, is a crucial port operation. Existing approaches using branch and bound algorithms are only able to optimally solve small cases in a practical time frame. In this paper, we investigate iterative deepening A* algorithms (rather than branch and bound) using new lower bound measures and heuristics, and show that this approach is able to solve much larger instances of the problem in a time frame that is suitable for practical application.

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. Ashar, A.: On selectivity and accessibility. Cargo Systems, 44–45 (June 1991)

    Google Scholar 

  2. Kim, K.H.: Evaluation of the number of rehandles in container yards. Comput. Ind. Eng. 32(4), 701–711 (1997)

    Article  Google Scholar 

  3. Kim, K.H., Park, Y.M., Ryu, K.R.: Deriving decision rules to locate export containers in container yards. European Journal of Operational Research 124(1), 89–101 (2000)

    Article  MATH  Google Scholar 

  4. Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33(4), 940–954 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Watanabi, I.: Selection process. Cargo Systems, 35–36 (March 1991)

    Google Scholar 

  6. Aydin, C.: Improved rehandling strategies for container retrieval process. Master’s thesis, Graduate School of Engineering and Natural Sciences, Sabanci University (August 2006)

    Google Scholar 

  7. de Castillo, B., Daganzo, C.F.: Handling strategies for import containers at marine terminals. Transportation Research Part B: Methodological 27(2), 151–166 (1993)

    Article  Google Scholar 

  8. Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76(0), 55–71 (1998)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, Guangdong, PR China, (510275)

    Huidong Zhang & Songshan Guo

  2. Department of Computer Science and Engineering, School of Engineering, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong S.A.R.

    Wenbin Zhu

  3. Department of Management Sciences, College of Business, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong S.A.R.

    Andrew Lim & Brenda Cheang

Authors
  1. Huidong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Songshan Guo
    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

  4. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Brenda Cheang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Guo, S., Zhu, W., Lim, A., Cheang, B. (2010). An Investigation of IDA* Algorithms for the Container Relocation Problem. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13022-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13022-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13021-2

  • Online ISBN: 978-3-642-13022-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics