Journal of Global Optimization

, Volume 71, Issue 4, pp 935–955 | Cite as

A customized branch-and-bound approach for irregular shape nesting

  • Akang Wang
  • Christopher L. Hanselman
  • Chrysanthos E. GounarisEmail author


We study the Nesting Problem, which aims to determine a configuration of a set of irregular shapes within a rectangular sheet of material of fixed width, such that no overlap among the shapes exists, and such that the length of the sheet is minimized. When both translation and rotation of the shapes are allowed, the problem can be formulated as a nonconvex quadratically constrained programming model that approximates each shape by a set of inscribed circles and enforces that circle pairs stemming from different shapes do not overlap. However, despite many recent advances in today’s global optimization solvers, solving this nonconvex model to guaranteed optimality remains extremely challenging even for the state-of-the-art codes. In this paper, we propose a customized branch-and-bound approach to address the Nesting Problem to guaranteed optimality. Our approach utilizes a novel branching scheme to deal with the reverse convex quadratic constraints in the quadratic model and incorporates a number of problem-specific algorithmic tweaks. Our computational studies on a suite of 64 benchmark instances demonstrate the customized algorithm’s effectiveness and competitiveness over the use of general-purpose global optimization solvers, including for the first time the ability to find global optimal nestings featuring five polygons under free rotation.


Nesting Problem Irregular strip packing Global optimization Reverse convex quadratic constraints 



This work is dedicated to the memory of our academic father and grandfather, Professor Christodoulos A. Floudas. While his untimely passing has left us all with sorrow, his lasting impact on the field of Global Optimization shall remain a source of inspiration.


  1. 1.
    Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1–41 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.: Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35(4), 1065–1083 (2008)CrossRefzbMATHGoogle Scholar
  3. 3.
    Alvarez-Valdes, R., Martinez, A., Tamarit, J.M.: A branch and bound algorithm for cutting and packing irregularly shaped pieces. Int. J. Prod. Econ. 145(2), 463–477 (2013)CrossRefGoogle Scholar
  4. 4.
    Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397–415 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur. J. Oper. Res. 172(3), 814–837 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Burke, E., Hellier, R., Kendall, G., Whitwell, G.: A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. 54(3), 587–601 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Castillo, I., Kampas, F.J., Pintér, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Cherri, L.H., Mundim, L.R., Andretta, M., Toledo, F.M., Oliveira, J.F., Carravilla, M.A.: Robust mixed-integer linear programming models for the irregular strip packing problem. Eur. J. Oper. Res. 253(3), 570–583 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Daniels, K., Milenkovic, V.J.: Multiple translational containment: approximate and exact algorithms. In: Clarkson, K. (ed.) Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 205–214 (1995)Google Scholar
  10. 10.
    Fischetti, M., Luzzi, I.: Mixed-integer programming models for nesting problems. J. Heuristics. 15(3), 201–226 (2009)CrossRefzbMATHGoogle Scholar
  11. 11.
    Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171(3), 811–829 (2006)CrossRefzbMATHGoogle Scholar
  12. 12.
    Hillestad, R.J., Jacobsen, S.E.: Reverse convex programming. Appl. Math. Optim. 6, 63–78 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Hopper, E., Turton, B.C.: A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16(4), 257–300 (2001)CrossRefzbMATHGoogle Scholar
  14. 14.
    Jones, D.R.: A fully general, exact algorithm for nesting irregular shapes. J. Global Optim. 59, 367–404 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Lindo Systems Inc.: LINDOGlobal 11.0 (2017)Google Scholar
  16. 16.
    Milenkovic, V.J.: Rotational polygon containment and minimum enclosure using only robust 2D constructions. Comput. Geometry 13, 3–19 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Global Optim. 57(1), 3–50 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Oliveira, J.F., Gomes, A.M., Ferreira, J.S.: TOPOS: a new constructive algorithm for nesting problems. OR Spektrum 22(2), 263–284 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Rocha, P., Rodrigues, R., Gomes, A.M., Toledo, F.M.B., Andretta, M.: Circle covering representation for nesting problems with continuous rotations. IFAC Proc. Vol. 47(3), 5235–5240 (2014)CrossRefGoogle Scholar
  20. 20.
    Rodrigues, M.O., Cherri, L.H., Mundim, L.R.: MIP models for the irregular strip packing problem: new symmetry breaking constraints. ITM Web Conf. 14, 00005 (2017)CrossRefGoogle Scholar
  21. 21.
    Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225–249 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Chemical EngineeringCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations