节点文献

基于NGA的任意多边形优化排样技术的研究

Study of Layout Optimization of Arbitrary Polygons Based on NGA

【作者】 侯胡的

【导师】 朱灯林;

【作者基本信息】 河海大学 , 机械电子工程, 2004, 硕士

【摘要】 本文采用二步法对任意多边形的优化排样技术进行了研究。首先,将零件库中的零件根据其面积大小进行分类,把面积比较小的零件存成一个填充库,剩下的零件存成一个排样库。在此基础上,用基于小生境技术的遗传算法对排样库中的零件进行排样:先建立优化排样的数学模型,根据该数学模型将多边形在矩形板料上的排列方式转化为特定的编码,并建立编码和和排样方式的映射模型,然后采用基于小生境的遗传算法对排样过程进行优化。为了减少排样图中的空隙,提高材料的利用率,在采用NGA对排样库中的零件进行排样的基础上,本文通过一定的填充算法,将筛出来的填充库中的零件逐个填充到排样图的空隙中,完成最后的排样。根据文中提出的思路,设计开发了能够实际应用的优化排样系统。

【Abstract】 This paper had been carrying out a study on the layout technology of arbitrary polygons with two-step theory. First, we sorted the accessories in parts-storage into two portions according to their sizes: A fill-storage was established to accommodate the small accessories and a layout-storage to the others. Then, the theme provided efficient layout solutions to those accessories of layout-storage with niched genetic algorithm as a tool: through establishing the mathematical model of layout-optimizing problem and according to this model, the theme translated the layout of polygons in rectangle into a special coding of genetic algorithm. Following these steps, a mapping model between the codes and the layout of polygons were set up. With that, the theme optimized the layout process using niched genetic algorithm. For decreasing the interstices in the layout picture and promoting the utilization ratio, we fulfilled the last layout process by filling all parts of fill-storage into this layout result which basing on NGA method. According to this thinking-routine discussed above, we designed and developed effective layout optimization system.

【关键词】 优化排样遗传算法填充算法
【Key words】 optimum layoutgenetic algorithmfill algorithms
  • 【网络出版投稿人】 河海大学
  • 【网络出版年期】2004年 03期
  • 【分类号】TH122
  • 【被引频次】4
  • 【下载频次】145
节点文献中: 

本文链接的文献网络图示:

本文的引文网络