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

基于五块模式的单一矩形件排样算法
作者姓名:易向阳  潘卫平  张俊晖
摘    要:如何在一个大矩形里排入尽可能多的单一规格小矩形件是广泛出现在制造业领域 的板材分割、物流业领域的集装箱装载中的问题。采用五块模式将大矩形划分为五个块,求解 每个块里面矩形件的排样方式。首先,采用动态规划算法一次性生成所有块中矩形件排样方式, 然后,采用隐式枚举法考虑所有可能的五块组合,选择包含矩形件个数最多的五块组合作为最 终的排样方案。使用算例对算法进行了测试,并与另外4 种单一排样算法进行了比较。实验结 果表明,该算法在排样利用率和切割工艺两方面都有效,而且计算时间合理。

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

Algorithm for Generating Five Block Mode Cutting Patterns ofSingle Rectangular Items
Authors:Yi Xiangyang  Pan Weiping  Zhang Junhui
Abstract:It is widely appears in manufacturing field of plate segmentation and the logistics industry field of pallet loading that how to finding a maximal layout for identical small rectangles on a larger rectangle. The large rectangle is divided into five blocks using five-block mode, then the problem is solved to arrange the identical small rectangular into each blocks. Firstly, the dynamic programming method is used to generate the entire layout of rectangular in blocks in once. Then, the enumeration method is used to consider all of five blocks combination. The combination is selected to generate the final pattern which have the maximal number of rectangular. Several examples are used to test the proposed algorithm, and comparing the algorithm with other 4 kinds of single layout algorithm. The experimental results show that the algorithm is efficient in both the layout utilization rate and the cutting process with a reasonable computing time.
Keywords:rectangle packing problem  dynamic programming algorithm  implicit enumeration  five  block mode  
本文献已被 CNKI 等数据库收录!
点击此处可从《》浏览原始摘要信息
点击此处可从《》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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