面向可加工性的矩形件优化下料算法  

Machinability-Oriented Optimization Algorithm for Rectangular Items Cutting Stock Problem

作　　者：鲁淑飞 陈燕[1] 崔耀东[1] LU Shufei;CHEN Yan;CUI Yaodong(College of Computer and Electronic Information,Guangxi University,Nanning 530004,China)

机构地区：[1]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2020年第17期55-59,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61363026,No.71371058)。

摘　　要：针对目前矩形件优化下料算法侧重追求高材料利用率,而对实际切割成本考虑不足的现状,提出一种既维持高材料利用率,又使下料方案具有较低切割成本的矩形件优化下料算法。算法采用SVC框架和同质条带多级规范方式求解矩形件下料问题。利用条带共边排样的路径优化设计进行切割路径长度的计算,以生产成本(材料成本与切割成本之和)为优化目标得到高材料利用率、低切割成本的下料方案,最后通过实验证实该算法的可行性与有效性。Many algorithms for the cutting stock problem of rectangular items concentrate on improving material utilization,but not fully address the cutting cost.This paper presents an algorithm that can obtain both better material utilization and lower cutting cost.The algorithm uses the SVC frame and normal multi-section patterns of homogenous strips to solve the cutting stock problem.It calculates the length of the cutting path by optimizing the path layout of homogeneous strips with common edge,and takes the production cost(the sum of material cost and cutting cost)as the optimization objective,to obtain the cutting plan with better material utilization and lower cutting cost.Finally,the feasibility and effectiveness of the proposed algorithm are verified by experiments.

关 键 词：可加工性 矩形件 顺序价值校正 优化下料 切割成本 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]