Skip to main content
SpringerLink
Log in

Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The irregular strip packing problem consists of cutting a set of convex and non-convex two-dimensional polygonal pieces from a board with a fixed height and infinite length. Owing to the importance of this problem, a large number of mathematical models and solution methods have been proposed. However, only few papers consider that the pieces can be rotated at any angle in order to reduce the board length used. Furthermore, the solution methods proposed in the literature are mostly heuristic. This paper proposes a novel mixed integer quadratically-constrained programming model for the irregular strip packing problem considering continuous rotations for the pieces. In the model, the pieces are allocated on the board using a reference point and its allocation is given by the translation and rotation of the pieces. To reduce the number of symmetric solutions for the model, sets of symmetry-breaking constraints are proposed. Computational experiments were performed on the model with and without symmetry-breaking constraints, showing that symmetry elimination improves the quality of solutions found by the solution methods. Tests were performed with instances from the literature. For two instances, it was possible to compare the solutions with a previous model from the literature and show that the proposed model is able to obtain numerically accurate solutions in competitive computational times.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Alvarez-Valdes, R., Martinez, A., Tamarit, J.: A branch & bound algorithm for cutting and packing irregularly shaped pieces. Int. J. Prod. Econ. 145(2), 463–477 (2013)

    Article  Google Scholar 

  2. Bennell, J., Scheithauer, G., Stoyan, Y., Romanova, T., Pankratov, A.: Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3), 497–524 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: a tutorial. Eur. J. Oper. Res. 184(2), 397–415 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bussieck, M.R., Meeraus, A.: General algebraic modeling system (GAMS). In: Kallrath, J. (ed.) Modeling Languages in Mathematical Optimization, Applied Optimization, vol. 88, pp. 137–157. Springer, New York (2004)

    Chapter  Google Scholar 

  5. Carravilla, M.A., Ribeiro, C., Oliveira, J.F.: Solving nesting problems with non-convex polygons by constraint logic programming. Int. Trans. Oper. Res. 10, 651–663 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chernov, N., Stoyan, Y., Romanova, T.: Mathematical model and efficient algorithms for object packing problem. Comput. Geom. 43(5), 535–553 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Elkeran, A.: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering. Eur. J. Oper. Res. 231(3), 757–769 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fischetti, M., Luzzi, I.: Mixed-integer programming models for nesting problems. J. Heuristics 15(3), 201–226 (2009)

    Article  MATH  Google Scholar 

  10. Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett. 12(3), 133–137 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fujita, K., Akagi, S., Hirokawa, N.: Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm. In: Proceedings of the 19th Annual ASME Design Automation Conference, Part 1, pp. 477–484 (1993)

  12. Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141(2), 359–370 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gottschalk, S.: Collision queries using oriented bounding boxes. PhD thesis, The University of North Carolina at Chapel Hill (2000)

  14. Greene, D.H.: The decomposition of polygons into convex parts. Comput. Geom. 1, 235–259 (1983)

    MathSciNet  Google Scholar 

  15. Jones, D.R.: A fully general, exact algorithm for nesting irregular shapes. J. Glob. Optim. 59(2–3), 367–404 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim. 43(2), 299–328 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Leão, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A.: A semi-continuous MIP model for the irregular strip packing problem. Int. J. Prod. Res. 54, 1–10 (2015)

    Google Scholar 

  18. Liao, X., Ma, J., Ou, C., Long, F., Liu, X.: Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm. Adv. Mech. Eng. 8(6), 1–15 (2016)

    Article  Google Scholar 

  19. Rocha, P., Rodrigues, R., Toledo, F.M.B., Gomes, A.M.: Circle covering using medial axis. IFAC Proc. Vol. 46(7), 402–407 (2013)

    Article  Google Scholar 

  20. Rocha, P., Rodrigues, R., Gomes, A.M., Toledo, F.M.B., Andretta, M.: Two-phase approach to the nesting problem with continuous rotations. IFAC PapersOnLine 48(3), 501–506 (2015)

    Article  Google Scholar 

  21. Stoyan, Y., Pankratov, A., Romanova, T.: Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization. J. Oper. Res. Soc. 67(5), 786–800 (2016)

    Article  Google Scholar 

  22. Toledo, F.M.B., Carravilla, M.A., Ribeiro, C., Oliveira, J.F., Gomes, A.M.: The dotted-board model: a new mip model for nesting irregular shapes. Int. J. Prod. Econ. 145(2), 478–487 (2013)

    Article  Google Scholar 

Download references

Acknowledgements

This research was sponsored and funded by FAPESP (2015/24987-4, 2015/03066-8 and 2013/07375-0) and CNPq (477481/2013-2).

Author information

Authors and Affiliations

  1. University of São Paulo, Av. Trabalhador São-carlense, 400, São Carlos, SP, 13566-590, Brazil

    Luiz H. Cherri

  2. Universidade Estadual Paulista, Av. Eng. Luiz Edmundo Carrijo Coube, 14-01, Bauru, SP, 17033-360, Brazil

    Adriana C. Cherri & Edilaine M. Soler

  3. Optimized Decision Making (ODM), Rua Alfredo Lopes 1717, Sala E10, São Carlos, SP, 13560-460, Brazil

    Luiz H. Cherri

Authors
  1. Luiz H. Cherri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adriana C. Cherri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Edilaine M. Soler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luiz H. Cherri.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cherri, L.H., Cherri, A.C. & Soler, E.M. Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. J Glob Optim 72, 89–107 (2018). https://doi.org/10.1007/s10898-018-0638-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-018-0638-x

Keywords

Search

Navigation