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
相关论文
共 38 条
  • [31] A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints
    Paquay, Celia
    Limbourg, Sabine
    Schyns, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (01) : 52 - 64
  • [32] Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
    Pisinger, David
    Sigurd, Mikkel
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (01) : 36 - 51
  • [33] An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
    Zhang, Hao
    Liu, Qiang
    Wei, Lijun
    Zeng, Jiawei
    Leng, Jiewu
    Yan, Duxi
    COMPUTERS & OPERATIONS RESEARCH, 2022, 137
  • [34] Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
    Cui, Yaodong
    Zhao, Zhigang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (02) : 288 - 298
  • [35] A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem
    Liu, Ya
    Chu, Chengbin
    Wang, Kanliang
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (13) : 3815 - 3831
  • [36] A two-dimensional bin packing problem with size changeable items for the production of wind turbine flanges in the open die forging industry
    Lee, Jongsung
    Kim, Byung-In
    Johnson, Andrew L.
    IIE TRANSACTIONS, 2013, 45 (12) : 1332 - 1344
  • [37] A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
    Polyakovskiy, Sergey
    M'Hallah, Rym
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (03) : 819 - 839
  • [38] Optimization of two-dimensional irregular bin packing problem considering slit distance and free rotation of pieces
    Wang, Zi
    Chang, Daofang
    Man, Xingyu
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, 13 (04) : 491 - 506