A heuristic algorithm for the fabric spreading and cutting problem in apparel factories

Research output: Contribution to journalArticle

Standard

A heuristic algorithm for the fabric spreading and cutting problem in apparel factories. / Shang, Xiuqin; Shen, Dayong; Wang, Fei Yue; Nyberg, Timo R.

In: IEEE/CAA Journal of Automatica Sinica, Vol. 6, No. 4, 8753753, 01.07.2019, p. 961-968.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Shang, Xiuqin ; Shen, Dayong ; Wang, Fei Yue ; Nyberg, Timo R. / A heuristic algorithm for the fabric spreading and cutting problem in apparel factories. In: IEEE/CAA Journal of Automatica Sinica. 2019 ; Vol. 6, No. 4. pp. 961-968.

Bibtex - Download

@article{076a17547c5a4bb7bc46fa7088519e12,
title = "A heuristic algorithm for the fabric spreading and cutting problem in apparel factories",
abstract = "We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set. The improving loop will run until it cannot obtain any smaller lay set or the time limit is due. The experiment results on 500 cases show that the proposed algorithm is effective and efficient.",
keywords = "Construction and improvement, Cutting and packing, Fabric spreading and cutting, Heuristic algorithm",
author = "Xiuqin Shang and Dayong Shen and Wang, {Fei Yue} and Nyberg, {Timo R.}",
year = "2019",
month = "7",
day = "1",
doi = "10.1109/JAS.2019.1911573",
language = "English",
volume = "6",
pages = "961--968",
journal = "IEEE - CAA Journal of Automatica Sinica",
issn = "2329-9266",
publisher = "IEEE",
number = "4",

}

RIS - Download

TY - JOUR

T1 - A heuristic algorithm for the fabric spreading and cutting problem in apparel factories

AU - Shang, Xiuqin

AU - Shen, Dayong

AU - Wang, Fei Yue

AU - Nyberg, Timo R.

PY - 2019/7/1

Y1 - 2019/7/1

N2 - We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set. The improving loop will run until it cannot obtain any smaller lay set or the time limit is due. The experiment results on 500 cases show that the proposed algorithm is effective and efficient.

AB - We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set. The improving loop will run until it cannot obtain any smaller lay set or the time limit is due. The experiment results on 500 cases show that the proposed algorithm is effective and efficient.

KW - Construction and improvement

KW - Cutting and packing

KW - Fabric spreading and cutting

KW - Heuristic algorithm

UR - http://www.scopus.com/inward/record.url?scp=85068789723&partnerID=8YFLogxK

U2 - 10.1109/JAS.2019.1911573

DO - 10.1109/JAS.2019.1911573

M3 - Article

VL - 6

SP - 961

EP - 968

JO - IEEE - CAA Journal of Automatica Sinica

JF - IEEE - CAA Journal of Automatica Sinica

SN - 2329-9266

IS - 4

M1 - 8753753

ER -

ID: 35589610