期刊文献+

不规则件最优排放布局的实现 被引量:5

The Realization of Optimization Layout of Polygon
在线阅读 下载PDF
导出
摘要 使用遗传算法,突破了通常只按照某种固定的标准(如按面积大小)确定的零件的排样顺序,通过全局优化概率搜索产生最佳的排样次序和每个排样件的旋转角度,得到最优的排样顺序;用改进的平行线分割一步平移法,计算出了两个相交的图形不重叠所需移动的距离;用最低水平线定位算法确定了每一个排样件在板材上的定位位置。通过实例可看出板材的利用率得到了很大的提高。 Using genetic algorithm it take into account each sequence of parts ,the best sequence and rotating angle of parts can be got through global optimization .The best layout is obtained using improving parallel moving algorithm to compute the distance that two overlapping polygons isn’t intersecting and using improving “the lowest horizontal algorithm” to determine the position of each polygon.
出处 《青岛科技大学学报(自然科学版)》 CAS 2005年第2期146-149,157,共5页 Journal of Qingdao University of Science and Technology:Natural Science Edition
关键词 不规则件排样 扫描线算法 遗传算法 layout of polygon parallel algorithm genetic algorithm
  • 相关文献

参考文献4

二级参考文献18

  • 1P C Gilmore, R E Gomory. A linear programming approach to the cutting stock problem-Part 1 [J ] . Operations Research,1961, 9(6): 848-859.
  • 2J E Beasley. Algorithms for unconstrained two-dimensional guillotine cutting [ J ] . Journal of the Operational Research Society, 1985, 36(4) : 297-306.
  • 3A A Farley. Mathematical programming models for cutting-stock problems in the clothing industry [ J ] . Journal of the Operational Research Society, 1988, 39( 1): 41-53.
  • 4M S Reda, E A Abd. An interactive technique for the cutting stock problem with multiple objects[J ] . European Journal of Operational Research, 1994, 78(3) : 304-317.
  • 5M Shpitalni, V Menevich. Optimal orthogonal subdivision of rectangular sheets [ J ] . Transactions of ASME Journal of Manufacturing Science end Engineering, 1996, 118(3) : 281-288.
  • 6M Adamowicz. The optimum two-dimensional allocation of irregular, multiple-connected shapes with linear, logical and geometric constralnts[D]. New York: New York University,1969.
  • 7H H Yanasse, A S I Zinober, R G Harris. Two-dimensional cutting stock with multiple stock sizes [ J ] . Journal of the Operational Research Society, 1991, 42(8) : 673-683.
  • 8S Jakobs. On genetic algorithms for the packing of polygons[J].European Journal of Operational Research, 1996, 88( 1 ) : 165-181.
  • 9A Ramesh Babu, N Ramesh Babu. Effective nestin4g of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms [ J ] . International Journal of Production Research, 1999, 37(7): 1625-1643.
  • 10G-C Han, S-J Na. Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annesling[J]. Journal of Engineering Manufacture, 1996, 210(B6): 509-519.

共引文献164

同被引文献22

引证文献5

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部