运筹与管理 ›› 2024, Vol. 33 ›› Issue (4): 56-62.DOI: 10.12005/orms.2024.0112

• 理论分析与方法探讨 • 上一篇    下一篇

多块排样方式的二维板材下料优化模型与算法

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

  1. 1.大连海事大学 交通运输工程学院,辽宁 大连 116026;
    2.东北大学 工商管理学院,辽宁 沈阳 110169;
    3.东北大学 信息科学与工程学院,辽宁 沈阳 110819;
    4.东北大学 流程工业综合自动化国家重点实验室,辽宁 沈阳 110819
  • 收稿日期:2022-02-26 出版日期:2024-04-25 发布日期:2024-06-13
  • 通讯作者: 潘卫平(1989-),通讯作者,男,湖北黄冈人,博士后,研究方向:复杂系统建模与优化。
  • 作者简介:樊治平(1961-),男,江苏镇江人,博士,教授,博士生导师,研究方向:运作管理与决策分析;黄敏(1968-),女,福建长乐人,博士,教授,博士生导师,研究方向:制造与服务系统建模与优化;计明军(1973-),男,内蒙古赤峰人,博士,教授,博士生导师,研究方向:物流系统优化与模拟仿真。
  • 基金资助:
    国家自然科学基金资助项目(71971035);国家自然科学基金重点国际合作研究项目(71620107003);辽宁省“兴辽英才计划”(XLYC1802115);流程工业综合自动化国家重点实验室基础科研业务费专项资金项目(2013ZCX11);中央高校基本科研业务费专项资金项目(N2106008)

Optimization Model and Algorithm of Two-dimensional Plate Guillotine Cutting Stock Problem Based on Multiple-block Layout

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

  1. 1. Transportation Management College, Dalian Maritime University, Dalian 116026, China;
    2. School of Business Administration, Northeast University, Shenyang 110169, China;
    3. College of Information Science and Engineering, Northeastern University, Shenyang 110819, China;
    4. State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China
  • Received:2022-02-26 Online:2024-04-25 Published:2024-06-13

摘要: 针对矩形件二维板材剪切下料问题,提出一种多块排样方式的二维板材下料优化模型与求解算法。为了均衡考虑排样方式的计算复杂度和板材利用率,将多块排样方式的块数定为八块。通过3次一分为二剪切操作将板材分割成八个矩形块,并将每个块剪切成方向相同的同种矩形件。构造八块排样的优化模型及算法是按照排样价值最大原则来确定所有可能尺寸的块中矩形件的最优布局和板材的最优八块划分。提出的列生成算法迭代调用上述八块排样算法生成一系列下料方案,选择耗费板材最少的一个下料方案作为最终解。通过采用文献基准例题和实际生产实例验证了本文算法,实验结果表明:八块排样算法的排样价值高于3种文献排样算法,并且,八块排样方式的下料算法板材利用率高于已有文献给出的下料算法。本文给出算法计算时间可满足实际应用需要。

关键词: 二维板材下料, 矩形件, 八块排样方式, 列生成算法, 板材利用率

Abstract: The two-dimensional cutting problem of rectangular plates refers to cutting several types of rectangular parts from a set of plates, and minimizing the number of plates used while ensuring that the demand for each type of rectangular part is met. This problem has a wide range of applications in the industrial field. A good cutting plan can improve the utilization rate of plate metal, reduce production costs, and enhance the competitiveness of enterprises. The cutting plan generally consists of multiple layouts, each of which provides the layout of rectangular parts on a single plate of material. Therefore, the two-dimensional cutting problem of rectangular plates includes two combinatorial optimization problems: the one is determining the layout by combining rectangular parts on a single plate; the other is combining the feasible layouts in the set to determine the cutting plan.
The commonly used methods for solving the cutting problem of two-dimensional rectangular plates can be divided into three types. The first type is the integer programming method. The second type is the sequential heuristic method. This method generates a layout using the remaining rectangular parts to meet the partial demand for the rectangular parts, and repeats the process until all the demands for the rectangular parts are met. The third type is the linear programming method. Due to a large number of decision variables in the model, it is difficult for the integer programming method to calculate solutions for medium to large-scale cutting problems in a reasonable time. Sequential heuristic algorithms are generally used for cutting problems with low demand for rectangular parts. For cutting problems with high demand for rectangular parts, the calculation time is too long and it is difficult to meet practical application requirements. The utilization rate of the cutting plan generated by the linear programming method and the complexity of the cutting process depend on the layout used.
The two-dimensional plate cutting stock problem of rectangular parts is discussed in this study. A two-dimensional plate cutting stock optimization model and solution algorithm of multiple-block layout are proposed. In order to balance the computational complexity and plate utilization of multiple-block layout, the number of blocks of multiple-block layout is set as eight. The eight-block layout first divides the plate into eight rectangular blocks through three times as many as one-in-two cutting operations, and then cut each block into the same rectangular parts with the same direction. Firstly, an eight-block layout algorithm is constructed to determine the optimal layout of rectangular parts and the optimal eight-block partition of plates in all possible sizes according to the principle of maximum layout value. Then, the column generation algorithm is used to iteratively call the above eight-block layout algorithms to generate a series of cutting plans, and the cutting plan with the least plate consumption is selected as the final solution.
We compare the layout algorithm and cutting algorithm in this study with the literature layout algorithm and cutting stock algorithm using benchmark examples and actual production examples. By using 10 literature layout instances, the eight-block layout algorithm is compared with three literature layout algorithms. The experimental results show that the layout value of only one instance of the eight-block layout algorithm is lower than two literature layout algorithms, and the layout value of the other nine instances is higher than three literature layout algorithms. Using the actual cutting instance in the literature, the eight-block cutting stock algorithm is compared with the cutting stock algorithm in the literature. The experimental results show that the cutting plan of the eight-block cutting stock algorithm consumes 2269 plates and the utilization rate of plates is 99.88%. The cutting plan generated by the literature cutting stock algorithm consumes 2285 plates, and the utilization rate of plates is 99.18%. It can be seen that the plate utilization rate of the cutting plan generated by the eight-block cutting stock algorithm is 0.7% higher than that of the cutting stock algorithm in the literature, and the number of plates consumed is very close to the theoretical lower bound. The calculation time of the eight-block layout algorithm and eight-block cutting stock algorithm in this study can meet the needs of practical application.
The method proposed in this article has the following characteristics. Each plate of the cutting scheme only contains a maximum of 8 types of rectangular parts, which is conducive to the sorting of rectangular parts in the plate cutting process. After the board is cut into blocks, each block only needs to be cut into a rectangular part with the same direction, and the cutting process is relatively simple. It is suitable for solving the cutting and cutting problem of large-scale rectangular two-dimensional plate metal. The utilization rate of the cutting plan is high, and the calculation time can meet the practical application needs. Future research work can consider using a multi-block layout to solve the cutting and punching problem of two-dimensional circular plate metal.

Key words: two-dimensional plate cutting stock, rectangular parts, eight-block layout, column generation algorithm, utilization rate of plate

中图分类号: