The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches

被引:5
|
作者
do Nascimento, Douglas Nogueira [1 ]
Cherri, Adriana Cristina [1 ]
Oliveira, Jose Fernando [2 ]
机构
[1] Sao Paulo State Univ, UNESP, Bauru, SP, Brazil
[2] Univ Porto, Porto, Portugal
基金
巴西圣保罗研究基金会;
关键词
Two-dimensional cutting stock problem; Usable leftovers; Mathematical modelling; Exact methods; Heuristic procedure; LINEAR-PROGRAMMING APPROACH; ALGORITHMS;
D O I
10.1007/s12351-022-00735-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Different variations of the classic cutting stock problem (CSP) have emerged and presented increasingly complex challenges for scientists and researchers. One of these variations, which is the central subject of this work, is the two-dimensional cutting stock problem with usable leftovers (2D-CSPUL). In these problems, leftovers can be generated to reduce waste. This technique has great practical importance for many companies, with a strong economic and environmental impact. In this paper, a non-linear mathematical model and its linearization are proposed to represent the 2D-CSPUL. Due to the complexity of the model, a heuristic procedure was also proposed. Computational tests were performed with instances from the literature and randomly generated instances. The results demonstrate that the proposed model and the heuristic procedure satisfactorily solve the problem, proving to be adequate and beneficial tools when applied to real situations.
引用
收藏
页码:5363 / 5403
页数:41
相关论文
共 50 条
  • [1] The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches
    Douglas Nogueira do Nascimento
    Adriana Cristina Cherri
    José Fernando Oliveira
    Operational Research, 2022, 22 : 5363 - 5403
  • [2] 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
  • [3] The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers
    Birgin, E. G.
    Romao, O. C.
    Ronconi, D. P.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (03) : 1392 - 1418
  • [4] New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers
    Cui, Yaodong
    Song, Xiang
    Chen, Yan
    Cui, Yi-Ping
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2017, 68 (03) : 269 - 280
  • [5] Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints
    Bertolinia, Massimo
    Mezzogoria, Davide
    Zammorib, Francesco
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2024, 15 (01) : 149 - 170
  • [6] The one-dimensional cutting stock problem with usable leftovers - A survey
    Cherri, Adriana Cristina
    Arenales, Marcos Nereu
    Yanasse, Horacio Hideki
    Poldi, Kelly Cristina
    Goncalves Vianna, Andrea Carla
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) : 395 - 402
  • [7] Heuristics for the two-dimensional cutting stock problem with usable leftover
    Chen, Qiulian
    Chen, Yan
    INTELLIGENT DATA ANALYSIS, 2024, 28 (02) : 591 - 611
  • [8] 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
  • [9] Prototyping the One-Dimensional Cutting Stock Problem with Usable Leftovers for the Furniture Industry
    Oliveira, Oscar
    Gamboa, Dorabela
    Fernandes, Pedro
    NEW CONTRIBUTIONS IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, PT 1, 2015, 353 : 671 - 677
  • [10] A stochastic programming approach to the cutting stock problem with usable leftovers
    Cherri, Adriana Cristina
    Cherri, Luiz Henrique
    Oliveira, Beatriz Brito
    Oliveira, Jose Fernando
    Carravilla, Maria Antonia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (01) : 38 - 53