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 条
  • [21] Models for two-dimensional bin packing problems with customer order spread
    Martin, Mateus
    Yanasse, Horacio Hideki
    Santos, Maristela O.
    Morabito, Reinaldo
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (01)
  • [22] Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
    Khanafer, Ali
    Clautiaux, Francois
    Talbi, El-Ghazali
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 54 - 63
  • [23] Applying triple-block patterns in solving the two-dimensional bin packing problem
    Cui, Yi-Ping
    Yao, Yi
    Zhang, Defu
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (03) : 402 - 415
  • [24] An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
    Yao, Shaowen
    Tang, Chao
    Zhang, Hao
    Wu, Songhuan
    Wei, Lijun
    Liu, Qiang
    COMPUTERS & OPERATIONS RESEARCH, 2024, 162
  • [25] EPSO for Solving Non-oriented Two-dimensional Bin Packing Problem
    Omar, Mohamed K.
    Ramakrishnan, Kumaran
    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 106 - 110
  • [26] A New Memetic Algorithm for the Two-Dimensional Bin-Packing Problem with Rotations
    Fernandez, A.
    Gil, C.
    Marquez, A. L.
    Banos, R.
    Montoya, M. G.
    Alcayde, A.
    DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 2010, 79 : 541 - 548
  • [27] Hybrid flower pollination algorithm approach for the two-dimensional bin packing problem
    Gezici, Harun
    Livatyali, Haydar
    JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2022, 37 (03): : 1523 - 1534
  • [28] Two-layer heuristic for the three-dimensional bin design and packing problem
    Yang, Ying
    Wu, Zili
    Hao, Xiaodeng
    Liu, Huiqiang
    Qi, Mingyao
    ENGINEERING OPTIMIZATION, 2024, 56 (10) : 1601 - 1638
  • [29] A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
    Polyakovskiy, Sergey
    M'Hallah, Rym
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (01) : 104 - 117
  • [30] A GRASP/Path Re linking algorithm for two-and three-dimensional multiple bin-size bin packing problems
    Alvarez-Valdes, R.
    Parreno, F.
    Tamarit, J. M.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 3081 - 3090