A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
Volume 6 Issue 4
Jul.  2019

IEEE/CAA Journal of Automatica Sinica

  • JCR Impact Factor: 11.8, Top 4% (SCI Q1)
    CiteScore: 17.6, Top 3% (Q1)
    Google Scholar h5-index: 77, TOP 5
Turn off MathJax
Article Contents
Xiuqin Shang, Dayong Shen, Fei-Yue Wang and Timo R. Nyberg, "A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories," IEEE/CAA J. Autom. Sinica, vol. 6, no. 4, pp. 961-968, July 2019. doi: 10.1109/JAS.2019.1911573
Citation: Xiuqin Shang, Dayong Shen, Fei-Yue Wang and Timo R. Nyberg, "A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories," IEEE/CAA J. Autom. Sinica, vol. 6, no. 4, pp. 961-968, July 2019. doi: 10.1109/JAS.2019.1911573

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

doi: 10.1109/JAS.2019.1911573
Funds:  This work was 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), and Chinese Hunan's Science and Technology Project (20181040)
More Information
  • 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.

     

  • loading
  • [1]
    H. Dyckhoff, " A typology of cutting and packing problems,” European J. Operational Research, vol. 44, no. 2, pp. 145–159, 1990. doi: 10.1016/0377-2217(90)90350-K
    [2]
    P. E. Sweeney and E. R. Paternoster, " Cutting and packing problems: a categorized, application-orientated research bibliography,” J. Operational Research Society, vol. 43, no. 7, pp. 691–706, 1992. doi: 10.1057/jors.1992.101
    [3]
    C. Jacobs-Blecha, J. C. Ammons, A. Schutte, and T. Smith, " Cut order planning for apparel manufacturing,” IIE Trans., vol. 30, no. 1, pp. 79–90, 1998. doi: 10.1080/07408179808966439
    [4]
    D. M. Rose and D. R. Shier, " Cut scheduling in the apparel industry,” Computers &Operations Research, vol. 34, no. 11, pp. 3209–3228, 2007.
    [5]
    D. B. Nascimento, J. N. D. 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. Production Economics, vol. 128, no. 1, pp. 379–392, 2010. doi: 10.1016/j.ijpe.2010.07.035
    [6]
    W. K. Wong, " Optimisation of apparel manufacturing resource allocation using a generic optimised table-planning model,” Int. J. Advanced Manufacturing Technology, vol. 21, no. 12, pp. 935–944, 2003.
    [7]
    G. Wascher, H. Haubner, and H. Schumann, " An improved typology of cutting and packing problems,” European J. Operational Research, vol. 183, no. 3, pp. 1109–1130, 2007. doi: 10.1016/j.ejor.2005.12.047
    [8]
    W. K. Wong, C. K. Chan, and W. H. Ip, " Optimization of spreading and cutting sequencing model in garment manufacturing,” Computers in Industry, vol. 43, no. 1, pp. 1–10, 2000. doi: 10.1016/S0166-3615(00)00057-9
    [9]
    Z. Degraeve and M. Vandebroek, " A mixed integer programming model for solving a layout problem in the fashion industry,” Management Science, vol. 44, no. 3, pp. 301–310, 1998. doi: 10.1287/mnsc.44.3.301
    [10]
    Z. Degraeve, W. chet, and R. Jansbc, " Alternative formulations for a layout problem in the fashion industry,” European J. Operational Research, vol. 143, no. 1, pp. 80–93, 2002. doi: 10.1016/S0377-2217(01)00330-7
    [11]
    A. Toscano, S. Rangel, and H. H. Yanasse, " A heuristic approach to minimize the number of saw cycles in small-scale furniture factories,” Annals of Operations Research, vol. 258, no. 2, pp. 719–746, 2017.
    [12]
    M. Vanzela, G. M. Melega, S. Rangel, and S. A. D. Araujo, " The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production,” Computers &Operations Research, vol. 79, pp. 148–160, 2017.
    [13]
    D. A. Wuttke and H. S. Heese, " Two-dimensional cutting stock problem with sequence dependent setup times,” European J. Operational Research, vol. 265, no. 1, pp. 303–315, 2018. doi: 10.1016/j.ejor.2017.07.036
    [14]
    H. Foerster and G. Wascher, " Pattern reduction in one-dimensional cutting stock problems,” Int. J. Production Research, vol. 38, pp. 1657–1676, 2000.
    [15]
    H. H. Yanasse and M. S. Limeira, " A hybrid heuristic to reduce the number of different patterns in cutting stock problems,” Computers &Operations Research, vol. 33, pp. 2744–2756, 2006.
    [16]
    Y. Cui, C. Zhong, and Y. Yao, " Pattern-set generation algorithm for the onedimensional cutting stock problem with setup cost,” European J. Operational Research, vol. 243, no. 2, pp. 540–546, 2015.
    [17]
    Y. Cui, Y. P. Cui, and L. Yang, " Heuristic for the two-dimensional arbitrary stock-size cutting stock problem,” Computers &Industrial Engineering, vol. 78, pp. 195–204, 2014.
    [18]
    N. Ma, Y. Liu, Z. L. Zhou, and C. B. Chu, " Combined cutting stock and lot-sizing problem with pattern setup,” Computers &Operations Research, vol. 95, pp. 44–55, 2018.
    [19]
    Y. Cui and Z. Zhao, " Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns,” European J. Operational Research, vol. 231, no. 2, pp. 288–298, 2013. doi: 10.1016/j.ejor.2013.05.042
    [20]
    R. Alvarez-Valdés, R. Mart, J. M. Tamarit, and A. Parajn, " GRASP and path relinking for the two-dimensional two-staged cutting stock problem,” INFORMS J. Computing, vol. 19, no. 2, pp. 261–272, 2007.
    [21]
    M. Hifi and R. M’Hallah, " An exact algorithm for constrained two dimensional two-staged cutting problems,” Operations Research, vol. 53, no. 1, pp. 140–150, 2005. doi: 10.1287/opre.1040.0154
    [22]
    M. Hifi and R. M’Hallah, " Strip generation algorithms for constrained twodimensional two-staged cutting problems,” European J. Operational Research, vol. 172, no. 2, pp. 515–527, 2006. doi: 10.1016/j.ejor.2004.10.020
    [23]
    M. Hifi, R. M’Hallah, and T. Saadi, " Algorithms for the constrained two staged two-dimensional cutting problem,” INFORMS J. Computing, vol. 20, pp. 212–221, 2008. doi: 10.1287/ijoc.1070.0233
    [24]
    J. Li, X. H. Meng, and X. Dai, " Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach,” IEEE/CAA J. Autom. Sinica, vol. 5, no. 1, pp. 139–147, 2018. doi: 10.1109/JAS.2017.7510415
    [25]
    X. Meng, J. Li, M. C. Zhou, X. Dai, and J. Dou, " Population-based incremental learning algorithm for a serial colored traveling salesman problem,” IEEE Trans. Systems,Man,and Cybernetics:Systems, vol. 48, no. 2, pp. 277–288, 2018. doi: 10.1109/TSMC.2016.2591267
    [26]
    X. W Guo, S. X. Liu, M. C. Zhou, and G. D. Tian, " Dual-objective program and scatter search for the optimization of disassembly sequences subject to multi-resource constraints,” IEEE Trans. Automation Science and Engineering, vol. 15, no. 3, pp. 1091–1013, 2018. doi: 10.1109/TASE.2017.2731981
    [27]
    J. Zhao, S. X, Liu, M. C. Zhou, and X. W. Guo, L Qi, " Modified cuckoo search algorithm to solve economic power dispatch optimization problems,” IEEE/CAA J. Automatic Sinica, vol. 5, no. 4, pp. 794–806, 2018. doi: 10.1109/JAS.2018.7511138
    [28]
    J. Zhao, S. X. Liu, M. C. Zhou, X. W. Guo, and L Qi, " An improved binary cuckoo search algorithm for solving unit commitment problem: method description,” IEEE Access, vol. 6, no. 4, pp. 43535–43545, 2018.
    [29]
    M. Delorme, M. Iori, and S. Martello, " Bin packing and cutting stock problems: Mathematical models and exact algorithms,” European J. Operational Research, vol. 255, no. 1, pp. 1–20, 2016. doi: 10.1016/j.ejor.2016.04.030

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(1)  / Tables(7)

    Article Metrics

    Article views (1418) PDF downloads(31) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return