期刊文献+

基于多边形重叠检测的冲裁件优化排样 被引量:1

Optimal stamping blank layout based on algorithm of polygon intersection detecting
原文传递
导出
摘要 由于制造业中部分零件的大批量生产,条料上采用冲裁件优化排样可以节省大量的原材料。提出了一种基于多边形重叠检测的冲裁件优化排样新算法。该算法包含"重叠检测"和"零件进退"两个部分,避免了复杂的数学运算和耗时的人工操作。通过算例结果可知,运用该算法可以显著节省原材料,并且两个相同冲裁件可以很快地进行靠接。 Due to mass production of some parts in manufacturing,the optimal nesting of blank in strips can save a large amount of material.A new optimal method based on the algorithm of polygon intersection detecting was proposed.It includes two parts: polygon intersection detecting and blank advance or retreat.The new algorithm needs neither complicated calculation,nor the time-consuming human operation.The results of the examples show that the significant material savings can be obtained by the new method,and two identical blanks can lean on each other in very short time.
作者 刘虓 叶家玮
出处 《锻压技术》 CAS CSCD 北大核心 2010年第5期155-158,共4页 Forging & Stamping Technology
关键词 冲裁件 排样 优化 多边形 重叠检测 stamping blank layout optimization polygon intersection detecting
  • 相关文献

参考文献11

二级参考文献14

  • 1曹炬,周济.冲裁件排样最优化的数字模型及算法[J].锻压技术,1993,18(6):21-24. 被引量:17
  • 2李秦.冲裁件排样的计算机辅助设计[J].计算机应用研究,1993,10(4):19-21. 被引量:1
  • 3林好转.平行线分割一步平移法排样算法的研究[J].锻压技术,1994,19(5):33-35. 被引量:39
  • 4杨洪旗 等.冲裁件的排样优化与动画排样寻优法.锻压机械,1987,22(6):7-10.
  • 5余世浩 李熙亚.冲裁模CAD/CAM系统[M].北京:机械工业出版社,1996..
  • 6Prasad Y K D V. A set of heuristic algorithms for optimal nesting of two-dimesional irregularly shaped sheet-metal blanks[J]. Computer Sin Industry, 1994,24:55-70.
  • 7Han G. Two-stage approach for nesting in two-dimesional cutting problems using neural network and simulated an-nealing[J]. Journal of Engineering Manufacture, 1996,210(B6):509-519.
  • 8李志刚,李德群,邵军.板料冲裁零件排样的优化设计[J]华中工学院学报,1984(06).
  • 9杨洪旗,储家佑.冲裁件的排样优化与动画排样寻优法[J]锻压机械,1987(06).
  • 10黄兆亭,苗永纯,张国良.微机辅助设计冲裁件最佳排样法[J]锻压机械,1985(02).

共引文献218

同被引文献11

  • 1宋亚男,叶家玮,邓飞其,冯穗豫.不规则图形排样系统中靠接算法比较研究[J].计算机工程,2004,30(19):8-10. 被引量:5
  • 2Baker B S, Coffman J E G, Rivest R L. Orthogonal pac- kings in two dimensions [ J ]. SIAM Journal on Compu- ting, 1980,9 (4) :846-855.
  • 3Liu De-quan, Teng Hong-fei. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectan- gles [ J ]. European Journal of Operational Research, 1999,112(2) :413-420.
  • 4Chazelle B. The bottom-left bin-packing heuristic:an effi- cient implementation [ J ]. IEEE Transactions on Compu- ters, 1983, C32 ( 8 ) : 697 - 707.
  • 5Art R C. An approach to the two-dimensional irregular cutting stock problem [ R ]. Cambridge: IBM Cambridge Centre, 1966.
  • 6Dowsland K A, Vaid S, Dowsland W B. An algorithm for polygon placement using a bottom-left strategy [ J ]. Euro- pearl Journal of Operational Research, 2002, 141 ( 2 ) : 371-381.
  • 7Bennell J A, Dowsland K A, Dowsland W B. The irregular cutting-stock problem--a new procedure for deriving the no-fit polygon [J]. Computers & Operations Research, 2001,28 (3) :271-287.
  • 8Burke E K, Hellier R S R, Kendall G, et al. Complete and robust no-fit polygon generation for the irregular stock cutting problem [ J ]. European Journal of Operational Re- search,2007,179 ( 1 ) :27-49.
  • 9Burke Edmund, Robert Hellier, Graham Kendall, et al. A new bottom-left-fill heuristic algorithm for the two-dimen- sional irregular packing problem [ J ]. Operations Research, 2006,54 ( 3 ) :587- 601.
  • 10Dowsland K A, Dowsland W B, Bennell J A. Jostling for position:local improvement for irregular cutting patterns [ J ]. The Journal of the Operational Research Society, 1998,49(6) :647-658.

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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