Simulation analysis of multi-objective one-dimensional cutting problems

Anett Rácz; Ákos Szabó

doi:10.65112/tcmis.10063

Authors

Anett Rácz Department of Applied Mathematics and Probability Theory, University of Debrecen, Debrecen, Hungary https://orcid.org/0000-0002-6373-3194
Ákos Szabó Department of Applied Mathematics and Probability Theory, University of Debrecen, Debrecen, Hungary https://orcid.org/0009-0006-2903-0483

DOI:

https://doi.org/10.65112/tcmis.10063

Keywords:

Mixed integer programming, one-dimensional cutting problems, simulation

Abstract

In this paper, we compare published studies about optimization models for multi-objective one-dimensional cutting problems. Although all of the models address multiple objectives, they implement these goals in different ways. Some focus primarily on minimizing the amount of waste while setting limits on reusable bars returned to stock, whereas others combine these criteria with additional factors, such as the number of affected bars and the number of cuts. First, we provide a brief overview of these mathematical models, including one developed and published by the authors earlier, as well as three others from the existing literature that pursue objectives very similar to ours. In addition to comparing the models based on the included objectives such as the number of cuts, the amount of waste, and the number of reusable bars, our goal was also to analyse the computational requirements and limitations of the models in case of large-scale problems.

Downloads

Download data is not yet available.

References

[1] A.A. Shahin and O.M. Salem. ”Using genetic algorithms in solving the one-dimensional cutting stock problem in the construction industry.” Canadian Journal of Civil Engineering, vol. 31, no. 2, 2004, pp. 321-332. https://doi.org/10.1139/l03-101 DOI: https://doi.org/10.1139/l03-101

[2] D. Tanır, O. Ugurlu, A. Guler and U. Nuriyev. ”One-dimensional cutting stock problem with divisible items: A case study in steel industry.” TWMS Journal of Applied and Engineering Mathematics, vol. 9, no. 3, 2019, pp. 473-484.

[3] G.A. Ogunranti and A.E. Oluleye. ”Minimizing waste (off-cuts) using cutting stock model: The case of one dimensional cutting stock problem in wood working industry.” Journal of Industrial Engineering and Management (JIEM), vol. 9, no. 3, 2016, pp. 834-859. https://doi.org/10.3926/jiem.1653 DOI: https://doi.org/10.3926/jiem.1653

[4] Z. Wang, et al. ”Minimization of rebar cutting waste using BIM and cutting pattern-oriented multiobjective optimization.” Journal of Construction Engineering and Management, vol. 150, no. 11, 2024, 04024166. https://doi.org/10.1061/JCEMD4.COENG-15104 DOI: https://doi.org/10.1061/JCEMD4.COENG-15104

[5] B.S.C. Campello, et al. ”A multiobjective integrated model for lot sizing and cutting stock problems.” Journal of the Operational Research Society, vol. 71, no. 9, 2020, pp. 1466-1478. https://doi.org/10.1080/01605682.2019.1619892 DOI: https://doi.org/10.1080/01605682.2019.1619892

[6] G.G. Guimaraes, K.C. Poldi and M. Martin. ”Mathematical models for the one-dimensional cutting stock problem with setups and open stacks.” Journal of Combinatorial Optimization, vol. 49, no. 3, 2025, pp. 43. https://doi.org/10.1007/s10878-025-01276-5 DOI: https://doi.org/10.1007/s10878-025-01276-5

[7] V. Senergues, N. Brahimi, A.C. Cherri, F. Klein and O. P´eton, ”Cutting stock problem with usable leftovers: A review.” European Journal of Operational Research, vol. 328, no. 1, 2026, pp. 1-14. https://doi.org/10.1016/j.ejor.2025.03.014 DOI: https://doi.org/10.1016/j.ejor.2025.03.014

[8] A.C. Cherri, M.N. Arenales, H.H. Yanasse, K.C. Poldi and A.C.G. Vianna. ”The one- dimensional cutting stock problem with usable leftovers-A survey.” European Journal of Operational Research, vol. 236, no. 2, 2014, pp. 395-402. https://doi.org/10.1016/j.ejor.2013.11.026 DOI: https://doi.org/10.1016/j.ejor.2013.11.026

[9] Y. Ma, J. Zhang, X. Yang, J. Li, X. Su and H. Chen. ”Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry.” European Journal of Operational Research, vol. 326, no. 2, 2025, pp. 207-219. https://doi.org/10.1016/j.ejor.2025.04.036 DOI: https://doi.org/10.1016/j.ejor.2025.04.036

[10] L.J. Montiel-Arrieta, et al. ”Minimizing the total waste in the one-dimensional cutting stock problem with the African buffalo optimization algorithm.” PeerJ Computer Science, 9, 2023, e1728. https://doi.org/10.7717/peerj-cs.1728 DOI: https://doi.org/10.7717/peerj-cs.1728

[11] G.M. Bressan, M.H. Pimenta-Zanon and F. Sakuray. ”A tree-based heuristic for the one- dimensional cutting stock problem optimization using leftovers.” Materials, vol. 16, no. 22, 2023, 7133. https://doi.org/10.3390/ma16227133 DOI: https://doi.org/10.3390/ma16227133

[12] E. de Araujo Silva Oliveira, et al. ”A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs.” Journal of Heuristics, vol. 31, no. 1, 2025, 16. https://doi.org/10.1007/s10732-025-09547-4 DOI: https://doi.org/10.1007/s10732-025-09547-4

[13] A. Racz. ”A MILP model for one dimensional cutting stock problem with adjustable leftover threshold and cutting cost.” An International Journal of Optimization and Control: Theories & Applications, vol. 15, no. 2, 2025, pp. 215-224. https://doi.org/10.36922/ijocta.1660 DOI: https://doi.org/10.36922/ijocta.1660

[14] A. Abuabara and R. Morabito. ”Cutting optimization of structural tubes to build agricultural light aircrafts.” Annals of Operations Research, vol. 169, no. 1, 2009, pp. 149-165. https://doi.org/10.1007/s10479-008-0438-7 DOI: https://doi.org/10.1007/s10479-008-0438-7

[15] P. Trkman and M. Gradisar. ”One-dimensional cutting stock optimization in consecutive time periods.” European Journal of Operational Research, vol. 179, no. 2, 2007, pp. 291-301. https://doi.org/10.1016/j.ejor.2006.03.02 DOI: https://doi.org/10.1016/j.ejor.2006.03.027