Selection of wire electrical discharge machining process parameters using non-traditional optimization algorithms

Selection of wire electrical discharge machining process parameters using non-traditional optimization algorithms
复制标题

DOI:
10.1016/j.asoc.2012.03.053
复制
发表时间:
2012-08-01
影响因子:
8.7
通讯作者:
Samanta, Suman
Samanta, Suman
中科院分区:
计算机科学2区
文献类型:
--
作者:
Mukherjee, Rajarshi;Chakraborty, Shankar;Samanta, Suman

文献摘要

被引文献

相似文献

电火花线切割加工过程中脉冲宽度、脉冲频率、占空因数、峰值电流、介质流量、线速度、线张力、有效线偏移量等工艺参数的优化选择对提高加工性能至关重要。电火花线切割加工的主要性能指标包括材料去除率、切缝宽度、表面粗糙度和尺寸偏移。虽然人工神经网络、灰色关联分析、模拟退火、期望函数、帕累托最优等数学方法已被用于寻找电火花线切割加工工艺参数的最优组合,但在大多数情况下,得到的是次优或接近最优的解。本文尝试应用遗传算法、粒子群算法、羊群算法、蚁群算法、人工蜂群算法和基于遗传算法的六种最流行的基于种群的非传统优化算法对两种线切割加工工艺进行单目标和多目标优化。对这些算法的性能进行了比较,观察到基于地理的优化算法优于其他算法。(C)2012爱思唯尔有限公司版权所有。
Selection of the optimal values of different process parameters, such as pulse duration, pulse frequency, duty factor, peak current, dielectric flow rate, wire speed, wire tension, effective wire offset of wire electrical discharge machining (WEDM) process is of utmost importance for enhanced process performance. The major performance measures of WEDM process generally include material removal rate, cutting width (kerf), surface roughness and dimensional shift. Although different mathematical techniques, like artificial neural network, gray relational analysis, simulated annealing, desirability function, Pareto optimality approach, etc. have already been applied for searching out the optimal parametric combinations of WEDM processes, but in most of the cases, sub-optimal or near-optimal solutions have been arrived at. In this paper, an attempt is made to apply six most popular population-based non-traditional optimization algorithms, i.e. genetic algorithm, particle swarm optimization, sheep flock algorithm, ant colony optimization, artificial bee colony and biogeography-based optimization for single and multi-objective optimization of two WEDM processes. The performance of these algorithms is also compared and it is observed that biogeography-based optimization algorithm outperforms the others. (C) 2012 Elsevier B.V. All rights reserved.