Advertisement

A New Lower Bound for the Block Relocation Problem

  • Tiziano BacciEmail author
  • Sara Mattia
  • Paolo Ventura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Block relocation Container relocation Lower bound 

Notes

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.

References

  1. 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_48CrossRefGoogle Scholar
  2. 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)MathSciNetCrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Caserta, M., Voß, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectr. 33(4), 915–929 (2011)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Günter, H.O., Kim, K.H.: Container Terminals and Automated Transport Systems. Springer, Heidelberg (2005).  https://doi.org/10.1007/b137951CrossRefGoogle Scholar
  7. 7.
    Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180, 71–81 (2003)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Jovanovic, R., Voß, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79–86 (2014)CrossRefGoogle Scholar
  9. 9.
    Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33, 940–954 (2006)CrossRefGoogle Scholar
  10. 10.
    Ku, D., Arthanari, T.: On the abstraction method for the container relocation problem. Comput. Oper. Res. 68(Suppl. C), 110–122 (2016)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lee, Y., Lee, Y.L.: A heuristic for retrieving containers from a yard. Comput. Oper. Res. 47, 1139–1147 (2010)CrossRefGoogle Scholar
  12. 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)MathSciNetCrossRefGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 14.
    Unluyurt, T., Aydin, C.: Improved rehandling strategies for the container retrieval process. J. Adv. Transp. 46(4), 378–393 (2012)CrossRefGoogle Scholar
  15. 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)MathSciNetCrossRefGoogle Scholar
  16. 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. 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)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.IASI - CNRRomeItaly

Personalised recommendations