To read this content please select one of the options below:

Design heuristics for cut order planning problems in the apparel industry

Yu-Chung Tsao (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan)
Chia-Chen Liu (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan)
Pin-Ru Chen (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan)
Thuy-Linh Vu (Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan)

International Journal of Clothing Science and Technology

ISSN: 0955-6222

Article publication date: 17 May 2024

Issue publication date: 4 July 2024

68

Abstract

Purpose

In recent years, the demand for garments has significantly increased, requiring manufacturers to speed up their production to attract customers. Cut order planning (COP) is one of the most important processes in the apparel manufacturing industry. The appropriate stencil arrangement can reduce costs and fabric waste. The COP problem focuses on determining the size combination for a pattern, which is determined by the length of the cutting table, width, demand order, and height of the cutting equipment.

Design/methodology/approach

This study proposes new heuristics: genetic algorithm (GA), symbiotic organism search, and divide-and-search-based Lite heuristic and a One-by-One (ObO) heuristic to address the COP problem. The objective of the COP problem is to determine the optimal combination of stencils to meet demand requirements and minimize the total fabric length.

Findings

A comparison between our proposed heuristics and other simulated annealing and GA-based heuristics, and a hybrid approach (conventional algorithm + GA) was conducted to demonstrate the effectiveness and efficiency of the proposed heuristics. The test results show that the ObO heuristic can significantly improve the solution efficiency and find the near optimal solution for extreme demands.

Originality/value

This paper proposes a new heuristic, the One-by-One (ObO) heuristic, to solve the COP problem. The results show that the proposed approaches overcome the long operation time required to determine the fitting arrangement of stencils. In particular, our proposed ObO heuristic can significantly improve the solution efficiency, i.e. finding the near optimal solution for extreme demands within a very short time.

Keywords

Acknowledgements

This paper is supported in part by the National Science and Technology Council, Taiwan, under grant 112-2628-E-011-009, and the National Taiwan University of Science and Technology under grant NTUST- DROXO TECH- No. 10050.

Citation

Tsao, Y.-C., Liu, C.-C., Chen, P.-R. and Vu, T.-L. (2024), "Design heuristics for cut order planning problems in the apparel industry", International Journal of Clothing Science and Technology, Vol. 36 No. 4, pp. 662-686. https://doi.org/10.1108/IJCST-07-2022-0087

Publisher

:

Emerald Publishing Limited

Copyright © 2024, Emerald Publishing Limited

Related articles