An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets

被引:0
|
作者
El-Bouri, Ahmed
Rao, Jinsong
Popplewell, Neil
Balakrishnan, S.
机构
[1] Ryerson Univ, Dept Mech & Ind Engn, Toronto, ON M5B 2K3, Canada
[2] Univ Manitoba, Dept Mech & Ind Engn, Winnipeg, MB R3T 5V6, Canada
关键词
two-dimensional cutting stock problem; multiple stock sheets; bin packing; trim loss; heuristic;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper deals with the problem of cutting multiple sized, rectangular stock sheets into smaller rectangular order pieces to satisfy a given bill of material with minimum him loss. A new heuristic procedure is devised that finds; an effective stock sheet selection sequence, given that the layout procedure used for individual sheets is known. Results for randomly created test problems are compared with those from three previously published procedures. The new heuristic is shown to give a balanced trade-off between trim loss reduction and computational effort, especially as the number of available stock sheet sizes increases.
引用
收藏
页码:198 / 206
页数:9
相关论文
共 50 条
  • [41] A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
    Belov, G
    Scheithauer, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 274 - 294
  • [42] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Cerqueira, Goncalo R. L.
    Aguiar, Sergio S.
    Marques, Marlos
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 657 - 674
  • [43] A simulated annealing heuristic for the one-dimensional cutting stock problem
    Chen, CLS
    Hart, SM
    Tham, WM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 522 - 535
  • [44] A heuristic for the one-dimensional cutting stock problem with usable leftover
    Cui, Yaodong
    Yang, Yuli
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 245 - 250
  • [45] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Gonçalo R. L. Cerqueira
    Sérgio S. Aguiar
    Marlos Marques
    Journal of Combinatorial Optimization, 2021, 42 : 657 - 674
  • [46] A heuristic for the one-dimensional cutting stock problem with pattern reduction
    Cui, Y.
    Zhao, X.
    Yang, Y.
    Yu, P.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2008, 222 (06) : 677 - 685
  • [47] A NEW HEURISTIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM
    Berberler, M. E.
    Nuriyev, U. G.
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2010, 9 (01) : 19 - 30
  • [48] Solving two-dimensional cutting stock problem via a DNA computing algorithm
    M. Dodge
    S. A. MirHassani
    F. Hooshmand
    Natural Computing, 2021, 20 : 145 - 159
  • [49] 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
  • [50] 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