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

实用下料优化问题模型建立及解法
引用本文:李丹俊,曾锐,孙伟,唐建宁. 实用下料优化问题模型建立及解法[J]. 数学的实践与认识, 2005, 35(7): 43-57
作者姓名:李丹俊  曾锐  孙伟  唐建宁
作者单位:解放军理工大学工程兵工程学院,南京,210007
摘    要:“下料问题(cuttingstockproblem)”是把相同形状的一些原材料分割加工成若干个不同规格大小的零件的问题,此类问题在工程技术和工业生产中有着重要和广泛的应用.本文首先以材料最省为原则建立模型,采用分层基因算法模型求解出模型的解,若此结果不符合时间限制条件,则通过以客户时间需求为第一目标的分组抽样模型处理后,再借助分层基因算法给出该模型的最优解.

关 键 词:下料  基因算法  二维下料问题  分组抽样

The Practical Optimization Models of Cutting Stock Problems and Their Solutions
LI Dan-jun,ZENG Rui,SUN Wei. The Practical Optimization Models of Cutting Stock Problems and Their Solutions[J]. Mathematics in Practice and Theory, 2005, 35(7): 43-57
Authors:LI Dan-jun  ZENG Rui  SUN Wei
Abstract:The ″Cutting Stock Problem″ is a problem of dividing raw materials in the same shape into several parts in different shapes. This kind of problem has important and wide appliance in engineering and industry production. The article first established a model based on the least raw material usage, and solved the model using EPFF algorithm and layered gene algorithm. If the results mismatch the time limit, we process the problem with grouping sample optimizing model first, and then work out the optimal solution of the model using layered gene algorithm.
Keywords:cutting stock  EPFF algorithm  gene algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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