一种改进的启发式布局算法  

An improved heuristics algorithm for stocks cutting problems

作　　者：文贵华[1] 李适伦[1] 潘祺泰 

机构地区：[1]华南理工大学计算机研究所,广州510641

出　　处：《计算机工程与设计》2000年第4期46-49,共4页Computer Engineering and Design

摘　　要：提出一种带部分穷举的启发布局排样算法，对板材的选取和单块大板材的排样采用启发算法，以提高排样速度；对小规模板材和切割舍料则采用穷举算法，以减少切割损耗。讨论了算法所采用的超时限制，阈值的自适应调整等技术。实际应用表明算法是成功的。Optimal stocks cutting is intended to seek for the layout of the pieces on the given stocks which is of efficiency as high as possible. This paper presents an improved heuristics algorithm for stocks cutting problem, which makes layout by employing the heuristics algorithm for larger stocks and by enumerating algorithm for smaller stocks. This method not only escapes from combinatory explosion, but also is of high efficiency, which now has benn integrated into the intelligent Stocks Cutting System (ISCS). It is shown that the new method is successful.

关 键 词：穷举算法 启发式布局算法 板材切割 线性规划 

分 类 号：TG302[金属学及工艺—金属压力加工]