Abstract
This work considers the one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. We show that a multiobjective criteria to classify the solutions could be more accurate than previous classifications attempts, also we give a heuristic algorithm and two meta-heuristic approaches to the problem and we use them to solve practical and randomly generated instances from the literature. The results obtained by the computational experiments are quite good for all the tested instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
We use the standard domination criterion, in which a solution dominates another one if it is not worse in any of the objective functions and also it is better in at least one of the objectives.
References
Abuabara, A., Morabito, R.: Cutting optimization of structural tubes to build agricultural light aircrafts. Ann. OR 169, 149–165 (2009). https://doi.org/10.1007/s10479-008-0438-7
Andrade, R., Birgin, E., Morabito, R.: Two-stage two-dimensional guillotine cutting stock problems with usable leftover. Int. Trans. Oper. Res. 23(1–2), 121–145 (2016). https://doi.org/10.1111/itor.12077
Andrade, R., Birgin, E.G., Morabito, R., Ronconi, D.P.: MIP models for two-dimensional non-guillotine cutting problems with usable leftovers. J. Oper. Res. Soc. 65(11), 1649–1663 (2014). https://doi.org/10.1057/jors.2013.108
Arenales, M.N., Cherri, A.C., Nascimento, D.N., Vianna, A.: A new mathematical model for the cutting stock/leftover problem. Pesqui. Oper. 35, 509–522 (2015). https://doi.org/10.1590/0101-7438.2015.035.03.0509
Cherri, A., Arenales, M., Yanasse, H.: The one-dimensional cutting stock problem with usable leftover—a heuristic approach. Eur. J. Oper. Res. 196, 897–908 (2009). https://doi.org/10.1016/j.ejor.2008.04.039
Cherri, A., Arenales, M., Yanasse, H.: The usable leftover one-dimensional cutting stock problem—a priority-in-use heuristic. Int. Trans. Oper. Res. 20, 189–199 (2013). https://doi.org/10.1111/j.1475-3995.2012.00868.x
Cherri, A.C., Arenales, M.N., Yanasse, H.H., Poldi, K.C., Vianna, A.C.G.: The one-dimensional cutting stock problem with usable leftovers—a survey. Eur. J. Oper. Res. 236(2), 395–402 (2014). https://doi.org/10.1016/j.ejor.2013.11.026
Cui, Y., Yang, Y.: A heuristic for the one-dimensional cutting stock problem with usable leftover. Eur. J. Oper. Res. 204(2), 245–250 (2010). https://doi.org/10.1016/j.ejor.2009.10.028
Eschenauer, H., Koski, J., Osyczka, A.: Multicriteria Design Optimization. Springer, Berlin (1990). https://doi.org/10.1007/978-3-642-48697-5
Feifei, G., Lin, L., Jun, P., Xiazi, Z.: Study of one-dimensional cutting stock problem with multi-objective optimization. In: International Conference on Computer Science and Information Processing (CSIP), pp. 571–574 (2012). https://doi.org/10.1109/CSIP.2012.6308918
Gradišar, M., Erjavec, J., Tomat, L.: One-dimensional cutting stock optimization with usable leftover: a case of low stock-to-order ratio. Int. J. Decis. Supp. Syst. Technol. 3, 54–66 (2011). https://doi.org/10.4018/jdsst.2011010104
Gradišar, M., Jesenko, J., Resinovič, G.: Optimization of roll cutting in clothing industry. Comput. Oper. Res. 24(10), 945–953 (1997). https://doi.org/10.1016/S0305-0548(97)00005-1
Gradišar, M., Kljajić, M., Resinovič, G., Jesenko, J.: A sequential heuristic procedure for one-dimensional cutting. Eur. J. Oper. Res. 114(3), 557–568 (1999). https://doi.org/10.1016/S0377-2217(98)00140-4
Gradišar, M., Trkman, P.: A combined approach to the solution to the general one-dimensional cutting stock problem. Comput. Oper. Res. 32(7), 1793–1807 (2005). https://doi.org/10.1016/j.cor.2003.11.028
Ogunranti, G.A., Oluleye, A.E.: Minimizing waste (off-cuts) using cutting stock model: the case of one dimensional cutting stock problem in wood working industry. J. Ind. Eng. Manag. 9(3), 834–859 (2016). https://doi.org/10.3926/jiem.1653
Poldi, K.C., Arenales, M.N.: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Comput. Oper. Res. 36(6), 2074–2081 (2009). https://doi.org/10.1016/j.cor.2008.07.001
Ravelo, S.V., Meneses, C.N., Santos, M.O.: Mathematical programming models for the one-dimensional cutting stock problem with usable leftover. XLII SBPO (2010)
Tam, V.W.Y., Tam, C.M., Chan, J.K.W., Ng, W.C.Y.: Cutting construction wastes by prefabrication. Int. J. Constr. Manag. 6(1), 15–25 (2006). https://doi.org/10.1080/15623599.2006.10773079
Tomat, L., Gradišar, M.: One-dimensional stock cutting: optimization of usable leftovers in consecutive orders. CEJOR 25(2), 473–489 (2017). https://doi.org/10.1007/s10100-017-0466-y
Šajn, N.: Environmental impact of the textile and clothing industry: What consumers need to know. European Parliamentary Research Service (2019)
Wattanasiriseth, P., Krairit, A.: An application of cutting-stock problem in green manufacturing: a case study of wooden pallet industry. IOP Conf. Ser.: Mater. Sci. Eng. 530, 012005 (2019). https://doi.org/10.1088/1757-899x/530/1/012005
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). https://doi.org/10.1016/j.ejor.2005.12.047
Acknowledgements
This work was partially supported by the Brazilian National Council for Scientific and Technological Development (CNPq) under grant 312206/2015-1.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ravelo, S.V., Meneses, C.N. & Santos, M.O. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. J Heuristics 26, 585–618 (2020). https://doi.org/10.1007/s10732-020-09443-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-020-09443-z