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

Research output: Contribution to journalArticleScientificpeer-review

Researchers

  • Xiuqin Shang
  • Dayong Shen
  • Fei Yue Wang
  • Timo R. Nyberg

Research units

  • CAS - Institute of Automation
  • Qingdao Academy of Intelligent Industries
  • Chinese Academy of Sciences

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.

Details

Original languageEnglish
Article number8753753
Pages (from-to)961-968
Number of pages8
JournalIEEE/CAA Journal of Automatica Sinica
Volume6
Issue number4
Publication statusPublished - 1 Jul 2019
MoE publication typeA1 Journal article-refereed

    Research areas

  • Construction and improvement, Cutting and packing, Fabric spreading and cutting, Heuristic algorithm

ID: 35589610