Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry

被引:10
|
作者
Salem, Khadija Hadj [1 ]
Silva, Elsa [1 ]
Oliveira, Jose Fernando [2 ]
Carravilla, Maria Antonia [2 ]
机构
[1] INESC TEC, CEGI, Porto, Portugal
[2] Univ Porto, Fac Engn, INESC TEC, Porto, Portugal
关键词
Cutting stock problem; Variable-Sized stock; Integer linear programming; Bi-Objective optimization problem; Home textile industry; PACKING PROBLEMS; EXACT ALGORITHMS; PRICE ALGORITHM; BIN-PACKING; DECOMPOSITION; 3-STAGE; NUMBER; TYPOLOGY;
D O I
10.1016/j.ejor.2022.08.018
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider the two-dimensional Variable-Sized Cutting Stock Problem (2D-VSCSP) with guillotine constraint, applied to the home textile industry. This is a challenging class of real-world prob-lems where, given a set of predefined widths of fabric rolls and a set of piece types, the goal is to de-cide the widths and lengths of the fabric rolls to be produced, and to generate the cutting patterns to cut all demanded pieces. Each piece type considered has a rectangular shape with a specific width and length and a fixed demand to be respected. The main objective function is to minimize the total amount of the textile materials produced/cut to satisfy the demand. According to Wascher, Hau ss ner, & Schu-mann (2007), the addressed problem is a Cutting Stock Problem (CSP), as the demand for each item is greater than one. However, in the real-world application at stake, the demand for each item type is not very high (below ten for all item types). Therefore, addressing the problem as a Bin-Packing Problem (BPP), in which all items are considered to be different and have a unitary demand, was a possibility. For this reason, two approaches to solve the problems were devised, implemented, and tested: (1) a CSP model, based on the well-known Lodi and Monaci (2003) model (3 variants), and (2) an original BPP-based model. Our research shows that, for this level of demand, the new BPP model is more competitive than CSP models. We analyzed these different models and described their characteristics, namely the size and the quality of the linear programming relaxation bound for solving the basic mono-objective variant of the problem. We also propose an epsilon-constraint approach to deal with a bi-objective extension of the problem, in which the number of cutting patterns used must also be minimized. The quality of the models was evaluated through computational experiments on randomly generated instances, yielding promising results.(c) 2022 Published by Elsevier B.V.
引用
收藏
页码:549 / 566
页数:18
相关论文
共 50 条
  • [21] Heuristics for the two-dimensional cutting stock problem with usable leftover
    Chen, Qiulian
    Chen, Yan
    INTELLIGENT DATA ANALYSIS, 2024, 28 (02) : 591 - 611
  • [22] A PRACTICAL SOLUTION TO A FUZZY TWO-DIMENSIONAL CUTTING STOCK PROBLEM
    VASKO, FJ
    WOLF, FE
    STOTT, KL
    FUZZY SETS AND SYSTEMS, 1989, 29 (03) : 259 - 275
  • [23] Heuristic for the two-dimensional arbitrary stock-size cutting stock problem
    Cui, Yaodong
    Cui, Yi-Ping
    Yang, Liu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 78 : 195 - 204
  • [24] Two dimensional guillotine cutting stock and scheduling problem in printing industry
    Mostajabdaveh, Mahdi
    Salman, F. Sibel
    Tahmasbi, Nadia
    COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [25] A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size
    Dusberger, Frederico
    Raidl, Guenther R.
    COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2015, 2015, 9520 : 384 - 392
  • [26] Improvement in the Herz recursive algorithm for the two-dimensional cutting stock problem
    Hifi, M
    Zissimopoulos, V
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1996, 30 (02): : 111 - 125
  • [27] Two-dimensional cutting stock problem with sequence dependent setup times
    Wuttke, David A.
    Heese, H. Sebastian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (01) : 303 - 315
  • [28] A near-optimal solution to a two-dimensional cutting stock problem
    Kenyon, C
    Rémila, E
    MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (04) : 645 - 656
  • [29] The two-dimensional cutting stock problem with usable leftovers and uncertainty in demand
    Nascimento, Douglas Nogueira
    Cherri, Adriana Cristina
    Oliveira, Jose Fernando
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 186
  • [30] A sequential heuristic procedure for the two-dimensional cutting-stock problem
    Suliman, SMA
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 177 - 185