Advertisement

Modeling a Lot-Aware Slab Stack Shuffling Problem

  • Judith FechterEmail author
  • Andreas Beham
  • Stefan Wagner
  • Michael Affenzeller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9520)

Abstract

Stacking and shuffling problems are key logistics problems in various areas such as container shipping or steel industry. The aim of this paper is motivated by a real world instance arised in steel production. Slabs, continously but randomly casted, need to be arranged for transport while having a certain number of buffer stacks available. The optimization problem arising is assigning transport lotnumbers, regarding properties of slabs, as well as minimizing shuffling movements while arranging the slabs, regarding the implicitly given transport order. For that purpose, a combined optimization problem, being composed of two sub-problems is developed. Further computational studies are conducted in order to investigate the complexity of the problem. A combined solution approach is developed solving the problem in a sequential way using customized algorithms in order to make advantage of specialised algorithms.

Keywords

Solution Quality Variable Neighbourhood Search Container Terminal Integer Programming Model Cast Slab 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

The work described in this paper was done within the COMET Project Heuristic Optimization in Production and Logistics (HOPL), #843532 funded by the Austrian Research Promotion Agency (FFG).

References

  1. 1.
    Caserta, M., Schwarze, S., Voß, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219(1), 96–104 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    De Castillo, B., Daganzo, C.F.: Handling strategies for import containers at marine terminals. Transp. Res. Part B: Methodol. 27(2), 151–166 (1993)CrossRefGoogle Scholar
  3. 3.
    Fernandes, E.F.A., Freire, L., Passos, A.C., Street, A.: Solving the non-linear slab stack shuffling problem using linear binary integer programming. In: EngOpt 2012–3rd International Conference on Engineering Optimization (2012)Google Scholar
  4. 4.
    IBM, C. IBM Software. Retrieved from CPLEX Optimizer. http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/, 30 April 2015
  5. 5.
    Kang, J., Ryu, K.R., Kim, K.H.: Deriving stacking strategies for export containers with uncertain weight information. J. Intell. Manuf. 17, 399–410 (2006)CrossRefGoogle Scholar
  6. 6.
    Kim, K.H., Bae, J.W.: Re-marshalling export containers in port container terminals. Comput. Ind. Eng. 35, 655–658 (1998)CrossRefGoogle Scholar
  7. 7.
    König, F.G., Lübbecke, M., Möhring, R.H., Schäfer, G., Spenke, I.: Solutions to real-world instances of PSPACE-complete stacking. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 729–740. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  8. 8.
    Lee, Y., Hsu, N.Y.: An optimization model for the container pre-marshalling problem. Comput. Oper. Res. 34, 3295–3313 (2007)CrossRefzbMATHGoogle Scholar
  9. 9.
    Luo, J., Wu, Y., Halldorsson, A., Song, X.: Storage and stacking logistics problems in container terminals. OR Insight 24, 256–275 (2011)CrossRefGoogle Scholar
  10. 10.
    Singh, K.A., Srinivas, Tiwari, M.K.: Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved Parallel Genetic Algorithms. Int. J. Prod. Econ. 91, 135–147 (2004)CrossRefGoogle Scholar
  11. 11.
    Tang, L.X., Liu, J.Y., Rong, A.Y., Yang, Z.H.: An effective heuristic algorithm to minimise stack shuffle in selecting steel slabs from the slab yard for heating and rolling. J. Oper. Res. Soc. 52, 1091–1097 (2001)CrossRefzbMATHGoogle Scholar
  12. 12.
    Tang, L.X., Liu, J.Y., Rong, A.Y., Yang, Z.H.: Modelling and a genetic algorithm solution for the slab stack shuffling problem when implementing steel rolling schedules. Int. J. Prod. Res. 40(7), 1083–1095 (2002)CrossRefzbMATHGoogle Scholar
  13. 13.
    Tang, L., Ren, H.: Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem. Comput. Oper. Res. 37, 368–375 (2010)CrossRefzbMATHGoogle Scholar
  14. 14.
    Wagner, S., Kronberger, G., Beham, A., Kommenda, M., Scheibenpflug, A., Pitzer, E., Vonolfen, S., Kofler, M., Winkler, S., Dorfer, V., Affenzeller, M.: Architecture and design of the HeuristicLab optimization environment. Top. Intell. Eng. Inf. 6, 197–261 (2014)Google Scholar
  15. 15.
    Wagner, S.: Heuristic optimization software systems - modeling of heuristic optimization algorithms in the HeuristicLab software environment. Ph.D. Thesis, Johannes Kepler University Linz (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Judith Fechter
    • 1
    • 2
    Email author
  • Andreas Beham
    • 1
    • 2
  • Stefan Wagner
    • 1
  • Michael Affenzeller
    • 1
    • 2
  1. 1.Heuristic and Evolutionary Algorithms Laboratory School of Informatics, Communications and MediaUniversity of Applied Sciences Upper AustriaHagenbergAustria
  2. 2.Institute for Formal Models and VerificationJohannes Kepler University LinzLinzAustria

Personalised recommendations