期刊文献+

非支配排序最优保留遗传算法的低成本车削 被引量:3

Low Cost Turning of Optimum Remains Non-dominated Sorting Genetic Algorithm (ORNSGA)
下载PDF
导出
摘要 切削参数优化对于加工质量、生产效率、加工成本、利润具有非常重要的意义。提出一种新算法即非支配排序最优保留遗传算法(ORNSGA),并应用于有约束条件的多工序车削模型优化。加工实例结果表明:与混合人工蜂群算法(HABC)、差分进化受体编辑算法(DERE)、粒子群受体编辑算法(PSRE)、混合搜索算法(HTHS)、混合鲁棒遗传算法(HRGA)及模拟退火算法(SA/PA)比较,用非支配排序最优保留遗传算法得到了最低的单位生产成本,不仅节约了生产成本,而且很好地解决了切削参数优化问题,如数控车削中的粗车进给量、粗车切削速度及精车进给量、精车切削速度。 The optimization of cutting parameters is very important for machining quality,production efficiency,machining eco-nomics and profit. A new optimization approach was proposed,named optimum remains non-dominated sorting genetic algorithm (ORNSGA),and was applied to the multi-pass turning optimization model subject to various practical constraints. By compared with those of hybrid artificial bee colony algorithms (HABC),differential evolution receptor editing algorithm (DERE),particle swarm re-ceptor editing algorithm (PSRE),hybrid taguchi-harmony search algorithm (HTHS),hybrid robust genetic algorithm (HRGA)and simulated annealing algorithm (SA/PA),the minimum unit production cost was obtained by using the presented algorithms (ORNS-GA). Not only the unit production cost is saved,but also cutting optimization problem,such as feed rate and cutting rate in rough NC machining,feed rate and cutting rate in finish NC machining,are effectively solved.
出处 《机床与液压》 北大核心 2013年第21期47-52,共6页 Machine Tool & Hydraulics
基金 湖北省武汉市属高校科研项目(2010140)
关键词 单位生产成本 非支配排序最优保留遗传算法 多工序车削 Unit production cost Optimum remains non-dominated sorting genetic algorithm (ORNSGA) Multi-pass turningmachining
  • 相关文献

参考文献14

  • 1陈青艳,胡成龙,杜军.加工精度和金属切除率的精车切削优化[J].组合机床与自动化加工技术,2013(3):111-114. 被引量:16
  • 2陈青艳,胡成龙,焦红卫.多工序车削的自适应搜索非支配排序遗传算法[J].机械设计与制造,2013(7):119-122. 被引量:9
  • 3CHEN M C, TSAI D M. A Simulated Annealing Approach for Optimization of Multi-pass Turning Operations [ J ]. In- ternational Journal of Production Research, 1996,34 ( 10 ) : 2803 - 2825.
  • 4YILDIZ A R. A Novel Particle Swarm Optimization Ap- proach for Product Design and Manufacturing [ J ]. Interna- tional Journal of Advanced Manufacturing Technology, 2009,40 (5) :617 - 628.
  • 5VIJAYAKUMAR K, PRABHAHARAN G, ASOKAN P, et al. Optimization of Multi-pass Turning Operations Using Ant Colony System [ J ]. International Journal of Machine Tools & Manufacture ,2003,43 ( 15 ) : 1633 - 1639.
  • 6YILDIZ A R. Hybrid Taguchi-Harmony Search Algorithm for Solving Engineering Optimization Problem[ J]. Interna- tional Journal of Industrial Engineering Theory, Apllication and Practice, 2008,15 ( 3 ) :286 - 293.
  • 7ONWUBOLO G C, KUMALO T. Multi-pass Turning Opera- tions Optimization Based on Genetic Algorithms [ J ]. Pro- ceedings of the Institution of Mechanical Engineers : Part B : Journal of Engineering Manufacture, 2001,215 ( 1 ) : 117 - 124.
  • 8KONAKA Abdullah, COITB David W, SMITH Alice E. Multi-objective Optimization Using Genetic Algorithms [ J]. Reliability Engineering and System Safety, 2006,91 (9) :992 - 1007.
  • 9YILDIZ A R, OZTURK F. Hybrid Robust Genetic Algo- rithm to Select Optimal Machining Parameters in Turning Operations[ J ]. Information Science ,2006,220( 12 ) :2041 - 2053.
  • 10YILDIZ A R. A New Hybrid Artificial Bee Colony-based Approach for Optimization of Multi-pass Turning Opera- tions[ J]. Information Science,2012,9644 : 1 - 9.

二级参考文献26

  • 1潘敏强,刘亚俊,汤勇.车削加工中切削用量的分层多目标最优化模型[J].工具技术,2005,39(8):29-33. 被引量:11
  • 2陈桦,赵海霞.基于线性目标规划的切削参数多目标优化模型[J].西安工业大学学报,2007,27(1):24-28. 被引量:4
  • 3周泽华.金属切削原理[M].上海:上海科学技术出版社,1994.
  • 4金属切削理论与实践编委会.金属切削理论与实践[M].北京:北京出版社,1985.
  • 5孟少农.机械加工工艺手册[M].北京:机械工业出版社,2006.
  • 6叶迎春 王树斌.基于线性目标规划的切削参数多目标优化.科技信息,2008,22:556-558.
  • 7K. Vijayakumar, G. Prabhaharan, P. Asokan, R. Sara- vanan. Optimization of multi-pass turning operations using ant colony system [ J ]. International Journal of Machine Tools & Manufacture, 2003,4 (43) : 1633 - 1639.
  • 8Kalyanmoy Deb, Amrit Pratap. A Fast and Elitist Multi-ob- jective Genetic Algorithm: NSGA-Ⅱ[ J]. IEEE Transactions on Evolutionary Computation, 2002,6 ( 2 ) : 182 - 197.
  • 9Abdul|ah Konak David W. Coit, Alice E. Smith Multi-ob- jective optimization using genetic algorithms[ J]. Reliability Engineering and System Safety 2006,91 (9) :992 - 1007.
  • 10Coello, C. A. C. ; Pulido, G. T. ; Lechuga, M.S. Handling multiple objectives with particle swarm optimizations[ J ]. E- volution Computation, IEEE Transactions on. 2004,8 ( 3 ) : 256 - 279.

共引文献17

同被引文献25

  • 1汪文津,王太勇,范胜波,罗珺,李娜.车削过程切削力的计算机数值仿真[J].机械强度,2006,28(5):725-728. 被引量:11
  • 2王先逵.机械加工工艺手册工艺基础卷[M].北京:机械工业出版社,2006.
  • 3CHEN M C, TSAI D M, A Simulated Annealing Approach for Optimization of Multi-pass Turning Operations [ J ]. INT. J. PROD. RES, 1996,34 ( 10 ) :2803 - 2825.
  • 4CHEN M C. Optimization Machining Economics Models of Turn- ing Operations Using the Scatter Search Approach[ J], Interna- tional Journal of Production Research ,2004,42:2611 - 2625.
  • 5COELLO, C A C. PULIDO, G T, LECHUGA, M. S. Handling Mul- tiple Objectives with Particle swarm optimizations [ J ]. Evolution Computation, IEEE Transactions oi1,2004,8 (3) :256 - 279.
  • 6DEB K, PRATAP A, AGANRWAL S, et al. A Fast and Elitist Multi-objective Genetic Algorithm : NSGA-I1 [ J 1. IEEE Transac- tions on Evolutionary Compution ,2002,6 (2) : 182 - 197.
  • 7DATYA R, MAJUMDER A. Optimization of Turning Process Pa- rameters Using Multi-objective Evolutionary Algorithm [ J ]. IEEE longress on Evolutionary lomputation,2010,18/23:1 -6.
  • 8YANG S H, NATARJAN U, Multi-objective Optimization of Cut- ting Parameters in Turning Process Using Differential Evolution and Non-dominated Sorting Genetic Algorithm-II Approaches [ J]. Int. J. Adv. Manuf. Techno1,2010,49:773 -784.
  • 9SHIN Y C, JOO Y S. Optimization of Machining Conditions with Practical Constraints [ J ]. INT. J. PROD. RES, 1992,30 (12) :2907 -2919.
  • 10RAGHUWANSHI M M, KAKDE O G. Survey on Multi-objec- tive Evolutionary and Real Coded Genetic Algorithms [ C ]. Proceedings of the 8th Asia Pacific Symposium on Intelligent and Evolutionary Systems ,2004 : 150 - 161.

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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