二维多阶段矩形剪切排样算法

讨论有需求约束的二维剪切矩形排样问题:将一张板材剪切成一组已知尺寸的毛坯,使排样价值(板材中包含的毛坯总价值)最大,约束条件是排样方式中包含每种毛坯数量都不能超过其需求量。采用普通条带多阶段排样方式,每次剪切都从板材上产生一根水平或者竖直的普通条带,条带中可以包含不同尺寸毛坯。引入分支限界与贪婪策略,以提高算法效率。实验结果表明,该算法可以有效提高排样价值。

Optimal Nesting for Continuous Shape Stamping Processes

WTFZ] This paper discusses the optimal nesting problem for minimizing the scrap in continuous shape stamping processes. The shape sliding technique is used to propose a new approach, OVERLAP-and-ESCAPE, to solve the problem of continuously nesting shapes onto a metal coil of fixed or selectable width. The approach is used to construct the objective function of the mathematical model of the problem using the Simulated Annealing Algorithm to determine the globally minimal configurations for the nesting problems. Some representative cases are studied and the results are encouraging. An automatic nesting software package for manufacturing bicycle chain link blanks is also described.[

约束二维排样问题的一种求解算法

讨论有约束二维切割排样问题,即将板材切割成若干种矩形毛坯,其中每种毛坯的数量有上界约束,优化目标以使板材所切割的毛坯总价值(排样价值)最大。采用五块排样方式简化切割工艺,将板材切割成五块,每块切割成所需毛坯。构造一种基于隐式枚举和分支定界思想的算法生成五块排样方式:(1)计算所有可能尺寸的块的排样价值;(2)选择排样价值最大的五块组合生成五块排样方式;(3)采用文献中的基准测题,验证文中的有约束五块排样算法。研究结果表明,文中算法平均排样价值比文献中的3种算法分别高出12.85%,4.52%和1.89%,且算法计算时间较短。