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

基于匀质块五块模式的矩形件非剪切排样算法
引用本文:张瑞友,潘卫平,刘士新.基于匀质块五块模式的矩形件非剪切排样算法[J].东北大学学报(自然科学版),2018,39(6):771-775.
作者姓名:张瑞友  潘卫平  刘士新
作者单位:(东北大学 信息科学与工程学院, 辽宁 沈阳110819)
基金项目:国家自然科学基金资助项目(71471034,61573089,71571037); 中央高校基本科研业务费专项资金资助项目(N160404011).国家自然科学基金资助项目(51171041).
摘    要:基于匀质块五块排样模式对一类矩形件非剪切排样问题进行了研究.基于动态规划和隐枚举的思想设计了无约束矩形件非剪切排样问题的匀质块五块排样算法.与文献中的矩形件非剪切排样算法的对比试验表明:这种算法能够快速给出问题的最优解,而且可以降低板材切割工艺难度并减少矩形件的分拣成本.与2种矩形件剪切排样算法的对比进一步表明了引入“非剪切”的经济效益.

关 键 词:非剪切排样问题  五块模式  动态规划算法  隐枚举  

Non-guillotine Cutting Algorithm of Rectangular Items Based on Five-Homogeneous-Block Mode
ZHANG Rui-you,PAN Wei-ping,LIU Shi-xin.Non-guillotine Cutting Algorithm of Rectangular Items Based on Five-Homogeneous-Block Mode[J].Journal of Northeastern University(Natural Science),2018,39(6):771-775.
Authors:ZHANG Rui-you  PAN Wei-ping  LIU Shi-xin
Institution:School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
Abstract:A type of non-guillotine cutting problem of rectangular items was studied based on the use of five-homogeneous-block mode. According to the idea of dynamic programming and implicit enumeration, a five-homogeneous-block cutting algorithm for an unconstrained non-guillotine cutting problem was designed. The comparative experiments with existing non-guillotine cutting algorithms indicated that optimal solutions of the problem could be quickly given by this algorithm, and both the difficulty of plate cutting process and the sorting cost of rectangular items could be reduced. Furthermore, comparisons with another experiment with two guillotine cutting algorithms show the benefits of “non-guillotine”.
Keywords:non-guillotine cutting problem  five-block mode  dynamic programming algorithm  implicit enumeration  
本文献已被 CNKI 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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