摘要
讨论有需求约束的二维剪切矩形排样问题:将一张板材剪切成一组已知尺寸的毛坯,使排样价值(板材中包含的毛坯总价值)最大,约束条件是排样方式中包含每种毛坯数量都不能超过其需求量。采用普通条带多阶段排样方式,每次剪切都从板材上产生一根水平或者竖直的普通条带,条带中可以包含不同尺寸毛坯。引入分支限界与贪婪策略,以提高算法效率。实验结果表明,该算法可以有效提高排样价值。
We discuss two-dimensional cutting rectangular nesting problem with constrained requirement： in which a single plate is cut into a group of roughcast pieces with given sizes and makes the nesting value （ total value of pieces contained in the plate ） maximised, the constraints are that in the nesting pattern the number of each piece cannot exceed its demand. We adopt general strips and multi-staged nesting pattern, there will produce one horizontal or vertical strip from the plate in every cut, which can contain the pieces of different types. Branch-and-bound and greedy strategy are introduced to enhance the efficiency of the algorithm. Experimental results indicate that the algorithm can effectively improve the value of nesting.
出处
《计算机应用与软件》
CSCD
2015年第5期231-233,共3页
Computer Applications and Software
基金
国家自然科学基金项目(61363026)
关键词
有约束二维剪切
多阶段排样方式
普通条带
分支限界
贪婪策略
Constrained two-dimensional cutting problems Multi-stage nesting pattern General strip Branch-and-bound Greedy strategy
作者简介
孔令熠，硕士，主研领域：计算机辅助设计，优化算法。
陈秋莲，副教授。
