摘要
采用拼合法解决有约束单一尺寸矩形毛坯的优化排样问题。采用分支定界法扩展排样方式树,考察所有可能使当前最好解改善的节点。详细阐述分支及确定上限与下限的方法。对无约束排样的Agrawal剪切算法进行扩展,使之适用于解决有约束排样问题。采用拼合算法和扩展Agrawal剪切算法对大量数据进行实验计算,说明拼合算法是有效的。
The problem of generating constrained cutting patterns for rectangular blanks of a single size from a rectangular sheet by a joining method was dealt with. A branch and bound method has been used to extend the tree of patterns, and all nodes possible to improve the current best solution were explored. The methods to branch and to obtain upper and lower bounds were described in detail. Agrawal＇s algorithm for generating unconstrained patterns was extended to generate constrained patterns. The joining algorithm and the extended Agrawal＇s algorithm have been applied to the same group of experimental data. The computational results showed that the joining algorithm is extremely efficient.
出处
《农业机械学报》
EI
CAS
CSCD
北大核心
2007年第10期140-144,共5页
Transactions of the Chinese Society for Agricultural Machinery
基金
国家自然科学基金资助项目(项目编号:60763011)
广西科学基金资助项目(项目编号:桂科字0728100)
关键词
矩形毛坯
两维切割
拼合
优化
Rectangular blanks, 2-D cutting, Joining method, Optimization
