首页 | 本学科首页   官方微博 | 高级检索  
     

矩形毛坯最优层排样方式的动态规划算法*
引用本文:王晓庆,李尚芳,崔耀东.矩形毛坯最优层排样方式的动态规划算法*[J].计算机应用研究,2010,27(6):2040-2042.
作者姓名:王晓庆  李尚芳  崔耀东
作者单位:广西师范大学,计算机科学与信息工程学院,广西,桂林,541004
基金项目:国家自然科学基金资助项目(60763011);广西科学基金资助项目;广西区研究生教育创新计划资助项目(2009106020812M64)
摘    要:讨论矩形毛坯无约束二维剪切排样问题,提出层排样方式的动态规划算法,使板材所含毛坯总价值最大。排样时使用一组平行的剪切线将板材分割为多个层,层的长度等于板材的长度或宽度,宽度等于最左边主毛坯的高度。通过动态规划算法确定所有可能尺寸层的最大价值和板材中层的最优组合。实验结果表明,该算法在满足实际应用要求的同时,板材利用率和计算时间两方面都较有效。

关 键 词:两维切割    剪切    层排样方式    动态规划

Dynamic programming algorithm for generating optimal layer patterns of rectangular blanks
WANG Xiao-qing,LI Shang-fang,CUI Yao-dong.Dynamic programming algorithm for generating optimal layer patterns of rectangular blanks[J].Application Research of Computers,2010,27(6):2040-2042.
Authors:WANG Xiao-qing  LI Shang-fang  CUI Yao-dong
Affiliation:(School of Computer Science & Information Engineering, Guangxi Normal University, Guilin Guangxi 541004, China)
Abstract:Focusing on the unconstrained two-dimensional guillotine cutting problem of rectangular blanks, this paper proposed a dynamic programming algorithm to generate layer patterns, making the total value of the blanks included in the plant reach its maximum. The algorithm divided the plate into layers with horizontal cuts. The length of the cuts was equal to the length or width of the plate, the width was the same as the height of the leftmost blank in the layer. The dynamic programming algorithm determined the optimal value of all the layers and the optimal combination of the layers included in the plate. The computational results indicate that the algorithm can satisfy the requirement of actual application and is efficient both in material utilization and in computation time.
Keywords:two-dimensional cutting  guillotine cutting  layer pattern  dynamic programming
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号