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 条
  • [31] A pattern combination based approach to two-dimensional Cutting Stock Problem
    Wan, JM
    Wu, YD
    Dai, HW
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 332 - 336
  • [32] Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
    Becker, Henrique
    Martin, Mateus
    Araujo, Olinto
    Buriol, Luciana S. S.
    Morabito, Reinaldo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 3010 - 3035
  • [33] MINIMIZATION OF THE WOOD WASTES FOR AN INDUSTRY OF FURNISHING: A TWO DIMENSIONAL CUTTING STOCK PROBLEM
    Bouaine, Amine
    Lebbar, Maria
    Ha, Mohamed Ait
    MANAGEMENT AND PRODUCTION ENGINEERING REVIEW, 2018, 9 (02) : 42 - 51
  • [34] Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
    Guimaraes, Gabriel Gazzinelli
    Poldi, Kelly Cristina
    Martin, Mateus
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (03)
  • [35] Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
    Kelly Cristina Poldi
    Silvio Alexandre de Araujo
    Annals of Operations Research, 2016, 238 : 497 - 520
  • [36] Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
    Poldi, Kelly Cristina
    de Araujo, Silvio Alexandre
    ANNALS OF OPERATIONS RESEARCH, 2016, 238 (1-2) : 497 - 520
  • [37] Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
    Kwon, Sue-Jeong
    Joung, Seulgi
    Lee, Kyungsik
    COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 159 - 169
  • [38] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    M. Dodge
    S. A. MirHassani
    F. Hooshmand
    Natural Computing, 2021, 20 : 145 - 159
  • [39] A Hybrid Genetic Algorithm for Optimization of Two-Dimensional Cutting-Stock Problem
    Mellouli, Ahmed
    Masmoudi, Faouzi
    Kacem, Imed
    Haddar, Mohamed
    INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2010, 1 (02) : 34 - 49
  • [40] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    Dodge, M.
    MirHassani, S. A.
    Hooshmand, F.
    NATURAL COMPUTING, 2021, 20 (01) : 145 - 159