A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories

作     者：Xiuqin Shang Dayong Shen Fei-Yue Wang Timo R. Nyberg 

作者机构：the State Key Laboratory for Management and Control of Complex SystemsInstitute of AutomationChinese Academy of Sciences (CAS)Beijing 100190China the Qingdao Academy of Intelligent IndustriesQingdao 266109China IEEE the Beijing Enineering Research Center of Intelligent Systems and TechnologyInstitute of AutomationCASBeijing 100190China the Cloud Computing CenterCASDongguan 523808China the School of Science at Aalto UniversityAaltoFinland 

出 版 物：《IEEE/CAA Journal of Automatica Sinica》 (自动化学报（英文版）)

年 卷 期：2019年第6卷第4期

页      面：961-968页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

基　　金：supported in part by the National Key Research and Development Program of China(2018YFB1702701) the National Natural Science Foundation of China(61773381,61773382,61533019,61702519) Dongguan’s Innovation Talents Project(Gang Xiong) Guangdong’s Science and Technology Project(2017B090912001) Beijing Natural Science Foundation(4182065) Chinese Hunan’s Science and Technology Project(20181040) 

主　　题：Construction and improvement cutting and packing fabric spreading and cutting heuristic algorithm 

摘      要：We study the fabric spreading and cutting problem in apparel *** the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment *** reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be *** propose an iterated greedy algorithm for solving the fabric spreading and cutting *** algorithm contains a constructive procedure and an improving *** 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 *** improving loop will run until it cannot obtain any smaller lay set or the time limit is *** experiment results on 500 cases show that the proposed algorithm is effective and efficient.