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

生成矩形毛坯最优T形排样方式的递归算法
引用本文:崔耀东.生成矩形毛坯最优T形排样方式的递归算法[J].计算机辅助设计与图形学学报,2006,18(1):125-127.
作者姓名:崔耀东
作者单位:广西师范大学计算机科学系,桂林,541004
摘    要:讨论矩形毛坯无约束两维剪切排样问题.采用由条带组成的T形排样方式,切割工艺简单.排样时用一条分界线将板材分成2段,同一段中所有条带的方向和长度都相同.一段含水平条带.另一段含竖直条带.采用递归算法确定分界线的最优位置以及每段中条带的最优组合.以便使下料利用率达到最高.采用大量随机生成的例题进行实验,结果表明该算法在计算时间和提高材料利用率2方面都较有效.

关 键 词:薄板  排样  剪床下料  T形排样方式
收稿时间:2004-11-12
修稿时间:2005-01-17

Recursive Algorithm for Generating Optimal T-Shape Cutting Patterns of Rectangular Blanks
Cui Yaodong.Recursive Algorithm for Generating Optimal T-Shape Cutting Patterns of Rectangular Blanks[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(1):125-127.
Authors:Cui Yaodong
Affiliation:Department of Computer Science, Guangxi Normal University, Guilin 541004
Abstract:Focusing on the unconstrained two-dimensional guillotine cutting problem of rectangular blanks, a recursive algorithm is proposed to planning each T-shape cutting pattern, where a horizontal or a vertical cut divides the stock sheet into two segments, while each segment consists of horizontal strips or vertical strips alone. Each time the recursive algorithm determines the optimal position of the cut that divides the sheet metal into segments and the optimal combination of strips in each segment to make the material usage reach its maximum. A large number of randomly generated problems indicate that the algorithm is efficient both in material usage and in computation time.
Keywords:sheet metal  cutting stock  guillotine cutting  T-shape cutting pattern
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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