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 条
  • [1] Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
    Cui, Yaodong
    Yao, Yi
    Cui, Yi-Ping
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2016, 23 (03) : 539 - 549
  • [2] An agent-based approach to the two-dimensional guillotine bin packing problem
    Polyakovsky, Sergey
    M'Hallah, Rym
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 192 (03) : 767 - 781
  • [3] Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
    Han, Wei
    Bennell, Julia A.
    Zhao, Xiaozhou
    Song, Xiang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 230 (03) : 495 - 504
  • [4] Two-dimensional online bin packing with rotation
    Epstein, Leah
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (31-33) : 2899 - 2911
  • [5] Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
    Fleszar, Krzysztof
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 463 - 474
  • [6] An effective heuristic for the two-dimensional irregular bin packing problem
    Lopez-Camacho, Eunice
    Ochoa, Gabriela
    Terashima-Marin, Hugo
    Burke, Edmund K.
    ANNALS OF OPERATIONS RESEARCH, 2013, 206 (01) : 241 - 264
  • [7] Two-dimensional Bin Packing Problem in batch scheduling
    Koblasa, Frantisek
    Vavrousek, Miroslav
    Manlig, Frantisek
    33RD INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS (MME 2015), 2015, : 354 - 359
  • [8] An algorithm for online two-dimensional bin packing with two open bins
    Hu, Shunyi
    Wang, Xijie
    Journal of Information and Computational Science, 2013, 10 (17): : 5449 - 5456
  • [9] Sequence based heuristics for two-dimensional bin packing problems
    Alvelos, Filipe
    Chan, T. M.
    Vilaca, Paulo
    Gomes, Tiago
    Silva, Elsa
    Valerio de Carvalho, J. M.
    ENGINEERING OPTIMIZATION, 2009, 41 (08) : 773 - 791
  • [10] Approximation algorithms for the oriented two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) : 158 - 166