基于排样矩形的直角边零件下料算法  

Rectilinear Parts Cutting Algorithm Based on Layout Rectangle

作　　者：郭百海 隋毅 GUO Bai-Hai;SUI Yi(School of Computer Science and Technology,Qingdao University,Qingdao 266071,China)

机构地区：[1]青岛大学计算机科学技术学院,青岛266071

出　　处：《计算机系统应用》2021年第1期162-167,共6页Computer Systems & Applications

基　　金：国家自然科学基金青年基金(41706198);山东省高等学校科技计划(J17KA056)。

摘　　要：针对实际操作中直角边零件下料利用率不高的问题,导入排样矩形的概念,将直角边零件下料问题分解为若干优化子问题,在此基础上,基于动态规划思想通过求解子问题构建全局最优解.实验表明,与传统的直角边零件板材切割相比,使用本文算法能够使板材的利用率提高30%–50%;与其他几种典型算法相比,本算法板材利用率提高显著,并且排样方案简单,更适用于实际操作.For the rectilinear parts cutting problem of low sheet utilization rate in practice,the concept of layout rectangle is introduced.The rectilinear parts cutting problem is decomposed into several optimization sub-problems.On this basis,the global optimal solution is constructed by solving the sub-problems based on dynamic programming.Experiment shows that compared with the traditional method of rectilinear parts cutting,the sheet utilization rate can be increased by 30%-50%.Compared with other typical algorithms,the sheet utilization rate is significantly improved and the scheme is more practical to layout.

关 键 词：排样矩形 下料问题 直角边不规则 动态规划 排样方案 

分 类 号：O221.3[理学—运筹学与控制论] TH161.1[理学—数学]