Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Logistics

ICCL 2018: Computational Logistics pp 168–174Cite as

A New Lower Bound for the Block Relocation Problem

  • Conference paper
  • First Online:

  • 1398 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11184))

Abstract

In this paper we deal with the restricted Block (or Container) Relocation Problem. We present a polynomial time algorithm to calculate a new lower bound for the problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bacci, T., Mattia, S., Ventura, P.: Some complexity results for the minimum blocking items problem. In: Sforza, A., Sterle, C. (eds.) ODS 2017. PROMS, vol. 217, pp. 475–483. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67308-0_48

    Chapter  Google Scholar 

  2. Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45), 6261–6268 (2011)

    Article  MathSciNet  Google Scholar 

  3. Carlo, H., Vis, I., Roodbergen, K.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412–430 (2014)

    Article  Google Scholar 

  4. Caserta, M., Schwarze, S., Voß, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219, 96–104 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Günter, H.O., Kim, K.H.: Container Terminals and Automated Transport Systems. Springer, Heidelberg (2005). https://doi.org/10.1007/b137951

    Book  Google Scholar 

  7. Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180, 71–81 (2003)

    Article  MathSciNet  Google Scholar 

  8. Jovanovic, R., Voß, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79–86 (2014)

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Ku, D., Arthanari, T.: On the abstraction method for the container relocation problem. Comput. Oper. Res. 68(Suppl. C), 110–122 (2016)

    Article  MathSciNet  Google Scholar 

  11. Lee, Y., Lee, Y.L.: A heuristic for retrieving containers from a yard. Comput. Oper. Res. 47, 1139–1147 (2010)

    Article  Google Scholar 

  12. Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239, 297–312 (2014)

    Article  MathSciNet  Google Scholar 

  13. Tanaka, S., Takii, K.: A faster branch-and-bound algorithm for the block relocation problem. IEEE Trans. Autom. Sci. Eng. 13(1), 181–190 (2016)

    Article  Google Scholar 

  14. Unluyurt, T., Aydin, C.: Improved rehandling strategies for the container retrieval process. J. Adv. Transp. 46(4), 378–393 (2012)

    Article  Google Scholar 

  15. Wan, Y., Liu, J., Tsai, P.C.: The assignment of storage locations to containers for a container stack. Nav. Res. Logist. 56(8), 699–713 (2009)

    Article  MathSciNet  Google Scholar 

  16. Wu, K.C., Ting, C.J.: A beam search algorithm for minimizing reshuffle operations at container yards. In: International Conference on Logistics and Maritime Systems, Busan, Korea, 15–17 September 2010 (2010)

    Google Scholar 

  17. Zhu, W., Qin, H., Lim, A., Zhang, H.: Iterative deepening A* algorithms for the container relocation problem. IEEE Trans. Autom. Sci. Eng. 9, 710–722 (2012)

    Article  Google Scholar 

Download references

Acknowledgements

The authors have been partially supported by Ministry of Instruction University and Research (MIUR) with the program PRIN 2015, project “SPORT - Smart PORt Terminals”, code 2015XAPRKF; project “Nonlinear and Combinatorial Aspects of Complex Networks”, code 2015B5F27W; project “Scheduling cuts: new optimization models and algorithms for cutting, packing and nesting in manufacturing processes”, code 20153TXRX9.

Author information

Authors and Affiliations

  1. IASI - CNR, Via dei Taurini 19, 00185, Rome, Italy

    Tiziano Bacci, Sara Mattia & Paolo Ventura

Authors
  1. Tiziano Bacci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sara Mattia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Ventura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tiziano Bacci .

Editor information

Editors and Affiliations

  1. University of Salerno, Fisciano, Italy

    Raffaele Cerulli

  2. University of Salerno, Fisciano, Italy

    Andrea Raiconi

  3. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bacci, T., Mattia, S., Ventura, P. (2018). A New Lower Bound for the Block Relocation Problem. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00898-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00897-0

  • Online ISBN: 978-3-030-00898-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation