Computer Integrated Manufacturing System ›› 2025, Vol. 31 ›› Issue (6): 2153-2164.DOI: 10.13196/j.cims.2022.1036

Previous Articles     Next Articles

Recursive multi-block packing algorithm for two-dimensional plate cutting problem

PAN Weiping1,FAN Zhiping2,HUANG Min3,4,JI Mingjun1   

  1. 1.College of Transportation Engineering,Dalian Maritime University
    2.School of Business Administration,Northeast University
    3.College of Information Science and Engineering;Northeastern University
    4.State Key Laboratory of Synthetical Automation for Process Industries,Northeastern University
  • Online:2025-06-30 Published:2025-07-08
  • Supported by:
    Project supported by the National Key R&D Program,China (No.2019YFB1705003),the National Natural Science Foundation,China (No.71971035),the Key International Cooperative Research Funding Project of National Natural Science Foundation,China (No.71620107003),the Liaoning Provincial “Xingliao Talent Plan”Funding,China (No.XLYC1802115),and the Fundamental Research Funds of State Key Laboratory of Integrated Automation in Process Industry,China (No.2013ZCX11).

二维板材排样问题的递归多块布局算法

潘卫平1,樊治平2,黄敏3,4,计明军1   

  1. 1.大连海事大学交通运输工程学院
    2.东北大学工商管理学院
    3.东北大学信息科学与工程学院
    4.东北大学流程工业综合自动化国家重点实验室
  • 作者简介:
    潘卫平(1989-),男,湖北黄冈人,讲师,博士,博士后,研究方向:制造系统建模与优化,E-mail:weiping209@126.com;

    樊治平(1961-),男,江苏镇江人,教授,博士,博士生导师,教育部长江学者特聘教授,国家杰出青年科学基金获得者,研究方向:运作管理与决策分析,E-mail:zpfan@mail.neu.edu.cn;

    黄敏(1968-),女,福建长乐人,教授,博士,博士生导师,教育部长江学者特聘教授,国家杰出青年科学基金获得者,研究方向:制造与服务系统建模与优化,E-mail:mhuang@mail.neu.edu.cn;

    计明军(1973-),男,内蒙古赤峰人,教授,博士,博士生导师,研究方向:物流系统优化与模拟仿真,E-mail:jmj@dlmu.edu.cn。
  • 基金资助:
    国家重点研发计划资助项目(2019YFB1705003);国家自然科学基金资助项目(71971035);国家自然科学基金重点国际合作研究资助项目(71620107003);辽宁省“兴辽英才计划”资助项目(XLYC1802115);流程工业综合自动化国家重点实验室基础科研业务费资助项目(2013ZCX11) 。

Abstract: A recursive multi-block pattern and its dynamic programming generation algorithm were proposed for two-dimensional plate cutting of rectangular pieces.With this pattern,the plate was divided into multiple blocks,then each block was recursively divided into multiple blocks until an optimal rectangular piece was arranged in each newly generated block.To balance the calculation complexity of layout method and the pattern value of the plate,for the guillotine cutting problem,the number of blocks for multi-block division was set as two,for the non-guillotine cutting problem,the number of blocks for multi-block division was set as five.The dynamic programming algorithm first calculated the maximum value of the first level multi-block pattern obtained when each of the five blocks discharged a rectangular piece,then calculated the value of the second level multi-block pattern obtained when each of the five blocks discharged a first level multi-block pattern,and then recursively obtained the maximum value of the multi-block pattern of any number of level.By comparing the upper and lower bounds of the block pattern value,unnecessary multi-block division was eliminated.The computation time of the algorithm was controlled by discretizing the location of the dividing line.Using typical instances in the literature and actual production instance,the proposed algorithm was compared with the guillotine cutting algorithm and non-guillotine cutting algorithm.The results showed that the algorithm had higher pattern value and the calculation time could meet the needs of practical application.

Key words: two-dimensional plate cutting, recursive multi-block pattern, dynamic programming, pattern value, rectangular pieces

摘要: 针对矩形件二维板材排样问题,提出递归多块排样方式及其动态规划生成算法。递归多块排样方式将板材划分成多个块,然后递归地对每个块进行多块划分,直到每个新产生的块中排放一种最优矩形件为止。为了均衡考虑排样方式的计算复杂度和板材排样价值,对于一刀切排样问题将多块划分的块数定为两块,对于非一刀切排样问题将多块划分的块数定为5块。动态规划算法首先计算每个块中分别排放一种矩形件所得到的1阶多块排样方式的最大价值,然后计算每个块中分别排放一个1阶多块排样方式得到的2阶多块排样方式的最大价值,以此递推,得到任意阶数的多块排样方式的最大价值。通过比较块的排样价值的上界和下界来剔除不必要的多块划分,通过离散化划分线位置来控制算法的时间复杂度。采用文献典型例题和实际生产实例,将所提算法与一刀切排样算法和非一刀切排样算法进行对比,表明了所提算法的优越性。

关键词: 二维板材排样, 递归多块排样方式, 动态规划, 排样价值, 矩形件

CLC Number: