Constraints

, Volume 17, Issue 1, pp 39–50 | Cite as

Solving steel mill slab design problems

  • Stefan Heinz
  • Thomas Schlechte
  • Rüdiger Stephan
  • Michael Winkler
Letter

Abstract

The steel mill slab design problem from the CSPLIB is a combinatorial optimization problem motivated by an application of the steel industry. It has been widely studied in the constraint programming community. Several methods were proposed to solve this problem. A steel mill slab library was created which contains 380 instances. A closely related binpacking problem called the multiple knapsack problem with color constraints, originated from the same industrial problem, was discussed in the integer programming community. In particular, a simple integer program for this problem has been given by Forrest et al. (INFORMS J Comput 18:129–134, 2006). The aim of this paper is to bring these different studies together. Moreover, we adapt the model of Forrest et al. (INFORMS J Comput 18:129–134, 2006) for the steel mill slab design problem. Using this model and a state-of-the-art integer program solver all instances of the steel mill slab library can be solved efficiently to optimality. We improved, thereby, the solution values of 76 instances compared to previous results (Schaus et al., Constraints 16:125–147, 2010). Finally, we consider a recently introduced variant of the steel mill slab design problem, where within all solutions which minimize the leftover one is interested in a solution which requires a minimum number of slabs. For that variant we introduce two approaches and solve all instances of the steel mill slab library with this slightly changed objective function to optimality.

Keywords

Steel mill slab design problem Multiple knapsack problem with color constraints Integer programming Set partitioning Binpacking with side constraints 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achterberg, T. (2007). Constraint integer programming. PhD thesis, Technische Universität Berlin.Google Scholar
  2. 2.
    Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46, 316–329.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Dawande, M., Kalagnanam, J., & Sethuraman, J. (2001). Variable sized bin packing with color constraints. Electronic Notes in Discrete Mathematics, 7, 154–157.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Forrest, J. J. H., Kalagnanam, J., & Ladányi, L. (2006). A column-generation approach to the multiple knapsack problem with color constraints. INFORMS Journal on Computing, 18, 129–134.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Frisch, A. M., Miguel, I., & Walsh, T. (2001). Modelling a steel mill slab design problem. In Proceedings of the IJCAI-01 workshop on modelling and solving problems with constraints (pp. 39–45).Google Scholar
  6. 6.
    Frisch, A. M., Miguel, I., & Walsh, T. (2001). Symmetry and implied constraints in the steel mill slab design problem. In Proceedings of CP’01 workshop on modelling and problem formulation (pp. 8–15).Google Scholar
  7. 7.
    Gargani, A., & Refalo, P. (2007). An efficient model and strategy for the steel mill slab design problem. In C. Bessiere (Ed.), Principles and practice of Constraint Programming—CP 2007, LNCS (Vol. 4741, pp. 77–89).Google Scholar
  8. 8.
    Heinz, S., Schlechte, T., & Stephan, R. (2009). Solving steel mill slab problems with branch-and-price. ZIB-Report 09-14, Zuse Institute Berlin.Google Scholar
  9. 9.
    Heinz, S., Schlechte, T., Stephan, R., & Winkler, M. (2011). Solving steel mill slab design problems. ZIB-Report 11-38, Zuse Institute Berlin.Google Scholar
  10. 10.
    Hnich, B., Kiziltan, Z., Miguel, I., & Walsh, T. (2004). Hybrid modelling for robust solving. Annals of Operations Research, 130, 19–39.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Kalagnanam, J. R., Dawande, M. W., Trumbo, M., & Lee, H. S. (2000). The surplus inventory matching problem in the process industry. Operations Research, 48, 505–516.CrossRefGoogle Scholar
  12. 12.
    Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., et al. (2011). MIPLIB 2010. Mathematical Programming Computation (Vol. 3).Google Scholar
  13. 13.
    Prestwich, S., & Beck, J. C. (2004). Exploiting dominance in three symmetric problems. In Fourth international workshop on symmetry and constraint satisfaction problems (pp. 63–70).Google Scholar
  14. 14.
    Schaus, P., Van Hentenryck, P., Monette, J.-N., Coffrin, C., Michel, L., & Deville, Y. (2010). Solving steel mill slab problems with constraint-based techniques: CP, LNS, and CBLS. Constraints, 16, 125–147.CrossRefGoogle Scholar
  15. 15.
    Steel mill slab library. http://becool.info.ucl.ac.be/steelmillslab. Accessed Sept 2011.
  16. 16.
    Van Hentenryck, P., & Michel, L. (2008). The steel mill slab design problem revisited. In L. Perron & M. A. Trick (Eds.), Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), LNCS (Vol. 5015, pp. 377–381).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Stefan Heinz
    • 1
  • Thomas Schlechte
    • 1
  • Rüdiger Stephan
    • 2
  • Michael Winkler
    • 1
  1. 1.Zuse Institute BerlinBerlinGermany
  2. 2.Technische Universität BerlinInstitut für MathematikBerlinGermany

Personalised recommendations