Comparative analysis of optimization methods for cut order planning in apparel manufacturing

Yulison Herry  Chrisnanto; Julian Evan Chrisnanto; Jeremia  Oktavian

doi:10.30656/jsmi.v9i2.10502

Authors

Yulison Herry Chrisnanto Universitas Jenderal Achmad Yani https://orcid.org/0000-0002-3491-3049
Julian Evan Chrisnanto Universitas Padjadjaran https://orcid.org/0009-0005-4657-6472
Jeremia Oktavian Hokkaido University https://orcid.org/0000-0003-2514-496X

DOI:

https://doi.org/10.30656/jsmi.v9i2.10502

Keywords:

Cut order planning, Gradient descent, Genetic algorithm, Machine learning

Abstract

This study seeks to address the complicated optimization challenge inherent in cut order planning (COP) in the clothing manufacturing business, emphasising fabric consumption, computational economy, and production accuracy. Three optimization approaches were compared: adaptive heuristic scoring optimizer (AHOPS), hybrid metaheuristic optimization with simulated annealing (HIMOSA), and gradient-based penalty-driven (GBPD). The results show that the GBPD method achieved the highest fabric utilization (87.13%), the fewest amount of fabric layers (12), and the maximum computational efficiency (0.022 seconds), significantly outperforming both conventional methods and alternative advanced approaches. AHOPS and HIMOSA, on the other hand, required more layers (15) and produced lower fabric utilization (around 69.70%), with HIMOSA demonstrating noticeably greater computational needs (0.527 seconds). The adaptive heuristic scoring mechanism and the combination of gradient descent and machine learning predictions, which successfully handled the combinatorial difficulties of COP, are responsible for GBPD's exceptional performance. These results offer useful information to manufacturers looking for scalable, effective optimization solutions. They also point to potential avenues for future research, such as extending the applicability of GBPD to more intricate production scenarios and further honing machine learning models for increased efficiency and adaptability.

Downloads

Download data is not yet available.

References

[1] W. K. Wong and S. Y. S. Leung, “Optimizing cut order planning in apparel production using evolutionary strategies,” in Optimizing Decision Making in the Apparel Supply Chain Using Artificial Intelligence (AI), Elsevier, 2013, pp. 81–105. doi: https://doi.org/10.1533/9780857097842.81.

[2] Y.-C. Tsao, T.-L. Vu, and L.-W. Liao, “Hybrid heuristics for the cut ordering planning problem in apparel industry,” Comput. Ind. Eng., vol. 144, p. 106478, Jun. 2020, doi: https://doi.org/10.1016/j.cie.2020.106478.

[3] R. M’Hallah and A. Bouziri, “Heuristics for the combined cut order planning two‐dimensional layout problem in the apparel industry,” Int. Trans. Oper. Res., vol. 23, no. 1–2, pp. 321–353, Jan. 2016, doi: https://doi.org/10.1111/itor.12104.

[4] S. Al-Mahmud, J. A. Cano, E. A. Campo, and S. Weyers, “Optimizing cut order planning: A comparative study of heuristics, metaheuristics, and MILP algorithms,” Int. J. Prod. Manag. Eng., vol. 13, no. 1, pp. 1–26, Jan. 2025, doi: https://doi.org/10.4995/ijpme.2025.22196.

[5] M. Karimi-Mamaghan, M. Mohammadi, P. Meyer, A. M. Karimi-Mamaghan, and E.-G. Talbi, “Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art,” Eur. J. Oper. Res., vol. 296, no. 2, pp. 393–422, Jan. 2022, doi: https://doi.org/10.1016/j.ejor.2021.04.032.

[6] T. Zhang, S. Yao, Q. Liu, L. Wei, and H. Zhang, “Heuristic approaches for the cutting path problem,” Expert Syst. Appl., vol. 237, p. 121567, Mar. 2024, doi: https://doi.org/10.1016/j.eswa.2023.121567.

[7] S. T. Hora, C.-M. Gruescu, C. Bungau, and R. Bodea, “Innovative approaches to optimized cutting planning in the garment industry,” Ind. Textila, vol. 75, no. 04, pp. 441–447, Aug. 2024, doi: https://doi.org/10.35530/IT.075.04.202386.

[8] Y.-C. Tsao, M. Delicia, and T.-L. Vu, “Marker planning problem in the apparel industry: Hybrid PSO-based heuristics,” Appl. Soft Comput., vol. 123, p. 108928, Jul. 2022, doi: https://doi.org/10.1016/j.asoc.2022.108928.

[9] Z. Wang, X. Li, J. Wang, and Y. Kuang, “Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model,” in ICLR 2023, 2023, pp. 1–28. [Online]. Available: https://arxiv.org/pdf/2302.00244

[10] K. Wang, S. Zhang, Y. Wu, and F. Jiang, “Cutting path planning using reinforcement learning with adaptive sequence adjustment and attention mechanisms,” Int. J. Adv. Manuf. Technol., vol. 136, no. 11–12, pp. 5599–5612, Feb. 2025, doi: https://doi.org/10.1007/s00170-025-15200-y.

[11] A. Deza and E. B. Khalil, “Machine Learning for Cutting Planes in Integer Programming: A Survey,” in International Joint Conference on Artificial Intelligence (IJCAI-23), 2023, pp. 6592–6600. [Online]. Available: https://www.ijcai.org/proceedings/2023/0739.pdf

[12] J. Wang et al., “Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programming,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 46, no. 12, pp. 9697–9713, Dec. 2024, doi: https://doi.org/10.1109/TPAMI.2024.3432716.

[13] C. R. Reeves, “Feature Article—Genetic Algorithms for the Operations Researcher,” INFORMS J. Comput., vol. 9, no. 3, pp. 231–250, Aug. 1997, doi: https://doi.org/10.1287/ijoc.9.3.231.

[14] R. P. Abeysooriya and T. G. I. Fernando, “Canonical Genetic Algorithm To Optimize Cut Order Plan Solutions in Apparel Manufacturing,” J. Emerg. Trends Comput. Inf. Sci., vol. 3, no. 2, pp. 150–154, 2012, [Online]. Available: https://www.researchgate.net/publication/275716958

[15] B. A. Junior, G. N. de Carvalho, M. C. Santos, P. R. Pinheio, and J. W. L. Celedonio, “Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem,” Appl. Sci., vol. 13, no. 18, p. 10133, Sep. 2023, doi: https://doi.org/10.3390/app131810133.

[16] W. K. Wong and S. Y. S. Leung, “Genetic optimization of fabric utilization in apparel manufacturing,” Int. J. Prod. Econ., vol. 114, no. 1, pp. 376–387, Jul. 2008, doi: https://doi.org/10.1016/j.ijpe.2008.02.012.

[17] R. N. M. P. Ranaweera, R. M. K. T. Rathnayaka, and L. L. G. Chathuranga, “Optimal Cut Order Planning Solutions using Heuristic and Meta-Heuristic Algorithms: A Systematic Literature Review,” KDU J. Multidiscip. Stud., vol. 5, no. 1, pp. 86–97, Jul. 2023, doi: https://doi.org/10.4038/kjms.v5i1.66.

[18] C. Ünal and A. D. Yüksel, “Cut order planning optimisation in the apparel industry,” Fibres Text. East. Eur., vol. 28, no. 1, pp. 8–13, Feb. 2020, doi: https://doi.org/10.5604/01.3001.0013.5851.

[19] X. Shang, D. Shen, F. Wang, and T. R. Nyberg, “A heuristic algorithm for the fabric spreading and cutting problem in apparel factories,” IEEE/CAA J. Autom. Sin., vol. 6, no. 4, pp. 961–968, Jul. 2019, doi: https://doi.org/10.1109/JAS.2019.1911573.

[20] Y. Xu, S. Thomassey, and X. Zeng, “Optimization of garment sizing and cutting order planning in the context of mass customization,” Int. J. Adv. Manuf. Technol., vol. 106, no. 7–8, pp. 3485–3503, Feb. 2020, doi: https://doi.org/10.1007/s00170-019-04866-w.

[21] W. Alsamarah, B. Younes, and M. Yousef, “Reducing waste in garment factories by intelligent planning of optimal cutting orders,” J. Text. Inst., vol. 113, no. 9, pp. 1917–1925, Sep. 2022, doi: https://doi.org/10.1080/00405000.2021.1956711.

[22] C.-L. Yang, R.-H. Huang, and H.-L. Huang, “Elucidating a layout problem in the fashion industry by using an ant optimisation approach,” Prod. Plan. Control, vol. 22, no. 3, pp. 248–256, Apr. 2011, doi: https://doi.org/10.1080/09537287.2010.498600.

[23] A. Dere, “Cut Order Planning Optimisation in the Apparel Industry,” vol. 1, no. 139, pp. 8–13, 2020, doi: https://doi.org/10.5604/01.3001.0013.5851.

[24] C. Jacobs-blecha et al., “Cut order planning for apparel manufacturing,” no. December 2014, pp. 37–41, 1998, doi: https://doi.org/10.1080/07408179808966439.

[25] L. Yan-mei, Y. Shao-cong, and Z. Shu-ting, “Research on Cut Order Planning for Apparel Mass Customization,” H. Deng, D. Miao, F. L. Wang, and J. Lei, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 267–271. doi: https://doi.org/10.1007/978-3-642-24282-3_36.

[26] Y. Tsao, C.-C. Liu, P.-R. Chen, and T.-L. Vu, “Design heuristics for cut order planning problems in the apparel industry,” Int. J. Cloth. Sci. Technol., 2024, doi: https://doi.org/10.1108/IJCST-07-2022-0087.

[27] A. G. Gad, Particle Swarm Optimization Algorithm and Its Applications : A Systematic Review, vol. 29, no. 5. Springer Netherlands, 2022. doi: https://doi.org/10.1007/s11831-021-09694-4.

[28] M. Saif, “An adaptive heuristic optimization algorithm based on politics,” Intell. Decis. Technol., vol. 11, no. May, 2017, doi: https://doi.org/10.3233/IDT-160282.

[29] T. Lazebnik, “Pulling the carpet below the learner’s feet: Genetic algorithm to learn ensemble machine learning model during concept drift,” Eng. Appl. Artif. Intell., vol. 152, p. 110772, 2025, doi: https://doi.org/10.1016/j.engappai.2025.110772.

[30] E. Garduno, E. Rosado-Tamariz, M. A. Zuniga-Garcia, and R. Batres, “A Hybrid Metaheuristic Optimization Approach for the Synthesis of Operating Procedures for Optimal Drum-Boiler Startups,” Appl. Sci., vol. 11, no. 11, p. 5085, May 2021, doi: https://doi.org/10.3390/app11115085.

[31] X. Tang et al., “Workflow scheduling based on asynchronous advantage actor–critic algorithm in multi-cloud environment,” Expert Syst. Appl., vol. 258, no. August, p. 125245, Dec. 2024, doi: https://doi.org/10.1016/j.eswa.2024.125245.

[32] D. B. Nascimento, J. Neiva de Figueiredo, S. F. Mayerle, P. R. Nascimento, and R. M. Casali, “A state-space solution search method for apparel industry spreading and cutting,” Int. J. Prod. Econ., vol. 128, no. 1, pp. 379–392, Nov. 2010, doi: https://doi.org/10.1016/j.ijpe.2010.07.035.

[33] M. Delorme, “Mathematical models and decomposition algorithms for cutting and packing problems,” 4OR, vol. 16, no. 2, pp. 229–230, 2018, doi: https://doi.org/10.1007/s10288-017-0365-z.