Document Open Access Logo

Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability

Authors Manuel Chastenay , Xavier Zwingmann , Claude-Guy Quimper , Jonathan Gaudreault

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.CP.2025.7.pdf
  • Filesize: 1.97 MB
  • 21 pages
HTML5 Logo HTML (experimental)
LIPIcs.CP.2025.7.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
Keywords
  • Combinatorial optimization
  • constraint programming
  • 2D bin packing

Metrics

Abstract

In industrial settings, cutting predefined pieces from one or multiple sheets of material is a common optimization challenge. This problem can be formulated as a variant of the 2D bin packing problem, where the edges of the pieces define the cut lines. This paper presents a constraint programming model developed in collaboration with an industrial partner in construction to minimize scrap waste generated when cutting insulation pieces. The model introduces an objective function designed to maximize the reusability of leftover material. To fully leverage the model’s efficiency, an initial process transforms irregular insulation pieces into rectangles using one of four processing methods. A comparative analysis is conducted to evaluate the impact of these methods, as well as to benchmark the model’s results against the partner’s manual approach.

Cite As Get BibTex

Manuel Chastenay, Xavier Zwingmann, Claude-Guy Quimper, and Jonathan Gaudreault. Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CP.2025.7

Author Details

Manuel Chastenay
  • Lab-Usine - Joint Research Unit for Advanced Manufacturing, Université Laval, Québec, Canada
  • SOKÏO Industrie, Saint-Augustin-de-Desmaures, Canada
Xavier Zwingmann
  • Lab-Usine - Joint Research Unit for Advanced Manufacturing, Université Laval, Québec, Canada
  • SOKÏO Industrie, Saint-Augustin-de-Desmaures, Canada
Claude-Guy Quimper
  • Lab-Usine - Joint Research Unit for Advanced Manufacturing, Université Laval, Québec, Canada
Jonathan Gaudreault
  • Lab-Usine - Joint Research Unit for Advanced Manufacturing, Université Laval, Québec, Canada

Funding

This research is funded by SOKÏO jointly with the Mitacs Accelerate and NSERC Alliance grants. Manuel Chastenay and Xavier Zwingmann receive a FRQNT Master Scholarship and Xavier Zwingmann also receives an NSERC Graduate Research Scholarship – Master’s program.

Acknowledgements

We thank SOKÏO for their support and for providing the benchmark.

References

  1. Ranga Prasad Abeysooriya. Cutting patterns for efficient production of irregular-shaped pieces. PhD thesis, University of Southampton, 2017. URL: https://eprints.soton.ac.uk/414693/1/23._Final_submission_of_thesis.pdf.
  2. Abderrahmane Aggoun and Nicolas Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. In Jean-Paul Delahaye, Philippe Devienne, Philippe Mathieu, and Pascal Yim, editors, JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France, volume 17, page 51, 1992. URL: https://doi.org/10.1016/0895-7177(93)90068-A.
  3. Brenda S. Baker, Edward G. Coffman Jr., and Ronald L. Rivest. Orthogonal packings in two dimensions. SIAM J. Comput., 9(4):846-855, November 1980. URL: https://doi.org/10.1137/0209064.
  4. N Beldiceanu and E Contejean. Introducing global constraints in chip. Mathematical and Computer Modelling, 20(12):97-123, 1994. URL: https://doi.org/10.1016/0895-7177(94)90127-9.
  5. Nicolas Beldiceanu, Qi Guo, and Sven Thiel. Non-overlapping constraints between convex polytopes. In Toby Walsh, editor, Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, volume 2239 of Lecture Notes in Computer Science, pages 392-407. Springer, Springer, 2001. URL: https://doi.org/10.1007/3-540-45578-7_27.
  6. Julia A. Bennell and José Fernando Oliveira. A tutorial in irregular shape packing problems. J. Oper. Res. Soc., 60(S1):S93-S105, 2009. URL: https://doi.org/10.1057/jors.2008.169.
  7. David W. Cantrell, Erich Friedman, et al. Packing unit squares in squares: A survey and new results. The Electronic Journal of Combinatorics, 5(DS7), 1998. URL: https://www.combinatorics.org/files/Surveys/ds7/ds7v1-1998.pdf.
  8. CH Cheng, BR Feiring, and TCE Cheng. The cutting stock problem—a survey. International Journal of Production Economics, 36(3):291-305, 1994. URL: https://doi.org/10.1016/0925-5273(94)00045-X.
  9. Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, and Prasad Tetali. Approximation and online algorithms for multidimensional bin packing: A survey. Comput. Sci. Rev., 24:63-79, 2017. URL: https://doi.org/10.1016/j.cosrev.2016.12.001.
  10. Geoffrey Chu. Improving combinatorial optimization. PhD thesis, University of Melbourne, Australia, 2011. URL: https://hdl.handle.net/11343/36679.
  11. Emir Demirovic, Geoffrey Chu, and Peter J. Stuckey. Solution-based phase saving for CP: A value-selection heuristic to simulate local search behavior in complete solvers. In John N. Hooker, editor, Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, volume 11008 of Lecture Notes in Computer Science, pages 99-108. Springer, Springer, 2018. URL: https://doi.org/10.1007/978-3-319-98334-9_7.
  12. Andreas A. Falkner, Alois Haselböck, Gerfried Krames, Gottfried Schenner, and Richard Taupe. Constraint solver requirements for interactive configuration. In Lothar Hotz, Michel Aldanondo, and Thorsten Krebs, editors, Proceedings of the 21st Configuration Workshop, Hamburg, Germany, September 19-20, 2019, volume 2467 of CEUR Workshop Proceedings, pages 65-72. CEUR-WS.org, 2019. URL: https://ceur-ws.org/Vol-2467/paper-12.pdf.
  13. Thibaut Feydy, Adrian Goldwaser, Andreas Schutt, Peter J Stuckey, and Kenneth D Young. Priority search with minizinc. In ModRef 2017: The Sixteenth International Workshop on Constraint Modelling and Reformulation, 2017. URL: https://ozgurakgun.github.io/ModRef2017/files/ModRef2017_PrioritySearchWithMiniZinc.pdf.
  14. M. R. Garey and David S. Johnson. "strong" np-completeness results: Motivation, examples, and implications. J. ACM, 25(3):499-508, July 1978. URL: https://doi.org/10.1145/322077.322090.
  15. M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979. Google Scholar
  16. Paul C Gilmore and Ralph E Gomory. A linear programming approach to the cutting-stock problem. Operations research, 9(6):849-859, 1961. URL: https://doi.org/10.1287/opre.9.6.849.
  17. Mikael Z. Lagerkvist, Martin Nordkvist, and Magnus Rattfeldt. Laser cutting path planning using CP. In Christian Schulte, editor, Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, volume 8124 of Lecture Notes in Computer Science, pages 790-804, Berlin, Heidelberg, 2013. Springer. URL: https://doi.org/10.1007/978-3-642-40627-0_58.
  18. Andrea Lodi, Silvano Martello, and Michele Monaci. Two-dimensional packing problems: A survey. Eur. J. Oper. Res., 141(2):241-252, September 2002. URL: https://doi.org/10.1016/S0377-2217(02)00123-6.
  19. Andrea Lodi, Silvano Martello, and Daniele Vigo. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput., 11(4):345-357, 1999. URL: https://doi.org/10.1287/ijoc.11.4.345.
  20. MiniZinc Documentation. Redundant Constraints. URL: https://docs.minizinc.dev/en/stable/efficient.html#redundant-constraints.
  21. Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck, and Guido Tack. Minizinc: Towards a standard CP modelling language. In Christian Bessiere, editor, Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, volume 4741 of Lecture Notes in Computer Science, pages 529-543. Springer, Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74970-7_38.
  22. Óscar Oliveira, Dorabela Gamboa, and Elsa Silva. An introduction to the two-dimensional rectangular cutting and packing problem. Int. Trans. Oper. Res., 30(6):3238-3266, November 2023. URL: https://doi.org/10.1111/itor.13236.
  23. Laurent Perron and Vincent Furnon. Or-tools. URL: https://developers.google.com/optimization/.
  24. Andreas Schutt, Peter J. Stuckey, and Andrew R. Verden. Optimal carpet cutting. In Jimmy Ho-Man Lee, editor, Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, volume 6876 of Lecture Notes in Computer Science, pages 69-84, Berlin, Heidelberg, 2011. Springer. URL: https://doi.org/10.1007/978-3-642-23786-7_8.
  25. Helmut Simonis and Barry O'Sullivan. Search strategies for rectangle packing. In Peter J. Stuckey, editor, Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, volume 5202 of Lecture Notes in Computer Science, pages 52-66, Berlin, Heidelberg, 2008. Springer. URL: https://doi.org/10.1007/978-3-540-85958-1_4.
  26. The MiniZinc Team. The MiniZinc Handbook. URL: https://docs.minizinc.dev/en/latest/index.html.
  27. Gerhard Wäscher, Heike Haußner, and Holger Schumann. An improved typology of cutting and packing problems. Eur. J. Oper. Res., 183(3):1109-1130, December 2007. URL: https://doi.org/10.1016/j.ejor.2005.12.047.
  28. Linda L Zhang. Product configuration: a review of the state-of-the-art and future research. International Journal of Production Research, 52(21):6381-6398, November 2014. URL: https://doi.org/10.1080/00207543.2014.942012.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact