首页 | 官方网站   微博 | 高级检索  
     

对AgraWal单一矩形排样算法的改进与扩展
引用本文:廖元秀,崔耀东.对AgraWal单一矩形排样算法的改进与扩展[J].广西师范大学学报(自然科学版),2004,22(3):49-53.
作者姓名:廖元秀  崔耀东
作者单位:广西师范大学,数学与计算机科学学院,广西,桂林,541004;广西师范大学,数学与计算机科学学院,广西,桂林,541004
基金项目:广西科学基金资助项目 (桂科基 0 2 3 60 1 7)
摘    要:讨论单一矩形剪切下料排样方式最优设计问题,给出更为贴切的上界,从而改进Agrawal算法.Agrawal以图解方式说明规范多级排样方式中包含最优剪切割方式,现给出这一结论的数学证明.扩展无约束算法用于解决有约束排样问题.

关 键 词:计算机技术  薄钢板  切割下料  有约束排样  优化
文章编号:1001-6600(2004)03-0049-05

IMPROVE AND EXTEND AGRAWAL'S ALGORITHM FOR GENERATING CUTTING PATTERNS FOR RECTANGULAR BLANKS OF A SINGLE SIZE
LIAO Yuan-xiu,CUI Yao-dong.IMPROVE AND EXTEND AGRAWAL'S ALGORITHM FOR GENERATING CUTTING PATTERNS FOR RECTANGULAR BLANKS OF A SINGLE SIZE[J].Journal of Guangxi Normal University(Natural Science Edition),2004,22(3):49-53.
Authors:LIAO Yuan-xiu  CUI Yao-dong
Abstract:The cutting stock problem of rectangular blanks of a single size is discussed.A tighter upper bound presented in this paper makes it possible to improve Agrawal's algorithm.Agrawal illustrates by diagrams in that an optimal cutting pattern is included in normal multi-level layout,and a mathematical proof for this conclusion is given in this paper.The unconstrained algorithm is extended to solve constrained cutting stock problems.
Keywords:computer technology  steel sheet  cutting stock  constrained layout  optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号