Two-staged guillotine cut, two-dimensional bin packing optimisation with flexible bin size for steel mother plate design

被引:19
|
作者
Wy, Juyoung [1 ]
Kim, Byung-In [1 ]
机构
[1] Pohang Univ Sci & Technol POSTECH, Dept Ind & Management Engn, Pohang 790784, South Korea
关键词
bin packing problem; cutting stock problem; heuristics; steel mother plate design; CUTTING STOCK PROBLEMS; LINEAR-MODELS; ALGORITHMS;
D O I
10.1080/00207540903317523
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper looks into the steel mother plate design problem. A slab, which is an intermediate work in process, is subsequently rolled into a mother plate with the specific dimensions of thickness, length, and width. The mother plate is then cut into customer order plates. As a slab is rolled into a mother plate through a series of horizontal and vertical rolling processes, different-sized mother plates can be generated from a single-slab type. This flexibility allows for the size of a mother plate to be determined according to the order plates assigned to it. Furthermore, when the order plates are cut from a mother plate, a guillotine cut is required to reduce the production cost. The steel mother plate design problem involves the placing of order plates on the mother plates in a guillotine cut pattern and determining the sizes of the mother plates with the objective of minimising the number of slabs; thus it may be considered as a two-staged guillotine cut, two-dimensional bin packing problem with flexible bin size. This paper introduces the problem, presents several mathematical models, and proposes an iterative two-phase heuristic method consisting of several algorithms to solve the problem. Computational results for the benchmark problems show the effectiveness of the proposed method.
引用
下载
收藏
页码:6799 / 6820
页数:22
相关论文
共 50 条
  • [31] Two-dimensional bin packing with one-dimensional resource augmentation
    Bansal, Nikhil
    Sviridenko, Maxim
    DISCRETE OPTIMIZATION, 2007, 4 (02) : 143 - 153
  • [32] Fast approximation schemes for two-stage, two-dimensional bin packing
    Caprara, A
    Lodi, A
    Monaci, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (01) : 150 - 172
  • [33] Mixed-integer Programming Model for Two-dimensional Non-guillotine Bin Packing Problem with Free Rotation
    Ma, Ning
    Zhou, Zhili
    2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2017, : 456 - 460
  • [34] A Parallel Algorithm for Constrained Fixed Two-Staged Two-Dimensional Cutting/Packing Problems
    Hifi, M.
    Negre, S.
    Saadi, T.
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 328 - 330
  • [35] A Metaheuristic Approach for a Two-dimensional Fuzzy Version of the Variable Size and Cost Bin Packing Problem
    Franklin, Jorge Herrera
    Rosete, Alejandro
    Sosa-Gómez, Guillermo
    Rojas, Omar
    International Journal of Computational Intelligence Systems, 2024, 17 (01)
  • [36] Two-dimensional on-line bin packing problem with rotatable items
    Fujita, S
    Hada, T
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 210 - 220
  • [37] A Weight Annealing Algorithm for Solving Two-dimensional Bin Packing Problems
    Loh, Kok-Hua
    Golden, Bruce
    Wasil, Edward
    OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, : 121 - +
  • [38] Number of bins and maximum lateness minimization in two-dimensional bin packing
    Arbib, Claudio
    Marinelli, Fabrizio
    Pizzuti, Andrea
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (01) : 101 - 113
  • [39] Models and algorithms for three-stage two-dimensional bin packing
    Puchinger, Jakob
    Raidl, Guenther R.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (03) : 1304 - 1327
  • [40] Heuristics for the two-dimensional irregular bin packing problem with limited rotations
    Cai, Sifan
    Deng, Jie
    Lee, Loo Hay
    Chew, Ek Peng
    Li, Haobin
    COMPUTERS & OPERATIONS RESEARCH, 2023, 160