Professional Documents
Culture Documents
DOI 10.1007/s00366-010-0195-5
ORIGINAL ARTICLE
Received: 17 January 2010 / Accepted: 9 July 2010 / Published online: 25 July 2010
Springer-Verlag London Limited 2010
1 Introduction
Recently, some established computational approaches
applied by previous works to suggest the optimal process
parameters in machining problem are such as Genetic
Algorithm (GA), Simulated Annealing (SA), Tabu Search
(TS), Ant Colony Optimization (ACO), and Particle Swarm
Optimization (PSO). Some of the advantages of computational approaches such as GA in optimizing process
parameters for machining problems may include [6, 12, 20,
21]: (1) preferred when near-optimal conditions instead of
the exact optimal solution are cost effective and acceptable
for implementation by the manufacturers; (2) a derivativefree approach for near-optimal point(s) search direction;
(3) able to handle objective functions of any complexity
with both discrete (for example, integer) and continuous
variables; (4) a simple complementation of the model by
new input parameters without modifying the existing
model structure; (5) an automatic search for the non-linear
connection between the inputs and outputs; (6) a fast and
simple optimizing technique.
Application of the GA, literatures show that most of the
works are related to conventional machining operations,
particularly for machining performance of surface roughness (Ra). Focused on estimation of the optimal process
parameters in the conventional machining operations, with
GA, Ra increases with an increase in the depth of cut and
nose radius [16]. High cutting speed during milling process
is preferred for the low Ra value [5]. GA reduces the Ra
value on mild steel from 2.60 to 0.71 lm for cutting speed,
feed rate and depth of cut process parameters [15]. Feed
rate has the greatest influence on Ra in the milling process
when evaluated by the application of the GA optimization
technique [3]. With feed rate, cutting speed, axial depth
of cut, radial depth of cut, machining tolerance process
123
252
123
2 Methodology
The steps taken to implement the GA and SA in fulfilling
the objectives of this study are:
1.
2.
3.
4.
253
Table 2 Levels of process parameters and coding identification
Experimental data:
- Machining type : Non-traditional
- Machining operation : AWJ
- Workpiece material: Al 7075-T6
Independent variables
Units
Level
1
Regression modeling:
- Multilinear stepwise regression analysis: predict the
machining performance value
- Second-order polynomial regression: Determination of the
machining performance predicted equation to be the GA and
SA fitness function
Traverse speed, V
mm/min
50
100
150
Waterjet pressure, P
MPa
125
175
250
Standoff distance, h
Mm
2.5
lm
60
90
120
g/s
0.5
3.5
Ra (lm)
V (m/min)
P (MPa)
h (mm)
d (lm)
m (g/s)
50
125
60
0.5
2.124
50
125
60
2.753
50
125
60
3.5
3.352
50
175
2.5
90
0.5
4.311
50
175
2.5
90
4.541
50
175
2.5
90
3.5
5.123
7
8
50
50
250
250
4
4
120
120
0.5
2
6.789
7.524
50
250
120
3.5
9.123
10
100
125
2.5
120
0.5
3.575
11
100
125
2.5
120
4.457
12
100
125
2.5
120
3.5
5.628
13
100
175
60
0.5
7.010
14
100
175
60
7.535
15
100
175
60
3.5
7.893
16
100
250
90
0.5
8.121
17
100
250
90
8.312
18
100
250
90
3.5
9.163
19
150
125
90
0.5
4.328
20
150
125
90
5.120
21
150
125
90
3.5
5.852
22
23
150
150
175
175
1
1
120
120
0.5
2
6.143
6.721
24
150
175
120
3.5
7.780
25
150
250
2.5
60
0.5
8.890
26
150
250
2.5
60
27
150
250
2.5
60
3.5
Al
91.02
Cu
1.65
Mg
2.0
Cr
0.23
Zn
Mn
0.1
Ra (minimum)
9.120
10.035
2.124
Related to the problem investigated, an experiment was conducted that dealt with the Ra measurement. In the experiment,
experimental trials were executed that were based on L27
Taguchis orthogonal array. The Ra values of each experimental trial for process parameters are given in Table 3.
123
254
4 Regression modeling
u 0
Ra cV P h d m e
P (MPa)
h (mm)
d (lm)
Ra (lm)
m (g/s)
50
125
60
2.62915
50
175
2.5
90
0.5
4.00520
50
175
2.5
3.5
5.42532
50
250
120
7.69815
10
100
125
2.5
120
0.5
3.66819
12
100
125
2.5
120
3.5
5.55233
14
16
100
100
175
250
4
1
60
90
2
0.5
7.36548
7.96455
18
100
250
90
3.5
9.21330
20
150
125
90
4.98615
22
150
175
120
0.5
6.07837
24
150
175
120
3.5
7.79815
26
150
250
2.5
9.23448
Ra (minimum)
90
60
2.62915
123
255
Table 5 Combination of GA parameter rates leading to the optimal
solution
Initialize parameters
Mutation
Generate population
Fitness function
Crossover
Selection
No
Parameters
Population size
100
Scaling function
Rank
Selection function
Roulette wheel
Crossover function
Heuristic
Crossover rate
0.8
Mutation function
Adaptive feasible
The best
fitness is
obtained?
Optimal solution
Yes
8a
125 P 250
8b
1h4
8c
60 d 120
8d
0:5 m 3:5 :
8e
6
5.5
Best fitness
Mean fitness
5
4.5
Fitness value
4
3.5
3
2.5
2
1.5
10
20
30
40
50
60
70
80
90
100
Generation
123
256
6 SA optimization solution
SA is a random search technique that is able to escape local
optima using a probability function [10]. Based on the
iterative improvement, the SA algorithm is a heuristic
method with the basic idea of generating random displacement from any feasible solution. This process accepts
not only the generated solutions, which improve the fitness
function but also those which do not improve it with the
probability function; a parameter depending on the fitness
function [17]. SA is a method for solving unconstrained
and bound-constrained optimization problems. It models
the physical process of heating a material and then slowly
lowering the temperature to decrease defects, thus minimizing the system energy. At each iteration of the SA
algorithm, a new point is randomly generated. The distance
of the new point from the current point, or the extent of the
search, is based on a probability distribution with a scale
proportional to the temperature. The algorithm accepts all
new points that lower the objective, but also, with a certain
probability points that raise the objective. By accepting
points that raise the objective, the algorithm avoids being
trapped in a local minimum, and is able to explore globally
for more possible solutions. An annealing schedule is
selected to systematically decrease the temperature as the
algorithm proceeds. As the temperature decreases, the
algorithm reduces the extent of its search to converge to a
minimum. Figure 5 shows the graphical representation in
the SA search of the global minimum [18].
An important part of the SA process is how the inputs
are randomized. The randomization process takes the previous input values and the current temperature as inputs.
The input values are then randomized according to the
temperature. A higher temperature will result in more
randomization; a lower temperature will result in less
randomization. There is no specific method defined by the
SA algorithm for how to randomize the inputs. The exact
nature by which this is done often depends upon the nature
of the problem being solved. Figure 6 illustrates the flow
on how the SA technique operates in order to search the
optimal solution. Figure 7 illustrates the pseudo code of the
SA for searching the optimal solution [2].
The target of the optimization process in this study is to
determine the optimal values of the process parameters that
lead to the minimum value of Ra. Similar to GA, the
Regression model which is proposed in (7) is taken to be the
fitness function of the optimization solution of the SA, and
the range of values given in (8a8e) are selected to present
the limitations of the optimization solution of the SA.
The process parameters that lead to the minimum Ra of
the Regression model as given in Table 4 will be chosen to
be the initial points for the SA solution and are given as
follows:
123
Initial solution
No
Solution
accepted?
Yes
Update the current
solution
Change
tem perature
No
Generate a
new solution
Yes
Decrease
Terminate
the search?
No
Yes
Optimal solution
Initial point of V 50
9a
9b
Initial point of h 1
9c
Initial point of d 60
9d
Initial point of m 2 :
9e
257
Begin
generate the initial string randomly = q
T=Tmax
Let E(q,T) be the associated energy
while (T Tmin)
for i = i to k
Mutate (flip) a random position in q to yield s
Let E(s,T) be the associated energy
Set q s with probability 1/ ( 1+e-(E(q,T)-E(s,T))/T )
end for
T= rT
end while
Decode the string q to provide the solution of the problem.
End
2.8
Annealing function
Boltzmann annealing
2.6
Reannealing interval
100
Exponential temperature
Initial temperature
100
Data type
Double
Function value
Parameters
2.4
2.2
2
1.8
1.6
1.4
500
1000
1500
2000
2500
3000
Iteration
123
258
Minimize Ra V; P;h;d;m
5:07976 0:0816950:003 0:07912125:029
0:342211:486 0:08661107:737
0:348660:5 0:0003150:0032 0:00012125:0292
2.
123
3.
9 Conclusion
This study proposed two computational approaches, GA
and SA, in order to estimate the optimal solutions of process parameters that lead to the minimum machining performance. The considered machining performance is
surface roughness (Ra). The machined-material was AA
7075 aluminium alloy. Five machining process parameters
for abrasive waterjet operation that considered in this study
are traverse speed, waterjet pressure, standoff distance,
abrasive grit size and abrasive flow rate. Overall, the results
of this study are summarized in Table 7.
From Table 7, for the first issue, it is clear that this study
has found that the GA and SA have been the effective
computational approaches for estimating the minimum
values of Ra compared to the experimental and Regression
259
Issue 1: minimum
Ra (lm)
Issue 3: no.
of iterations
Experimental [4]
2.124
Regression [4]
2.62915
GA
1.5549
57
SA
1.5355
2,711
References
1. Arizmendi M, Ferna0 ndez J, de Lopez Lacalle LN, Lamikiz A, Gil
A, Sanchez JA, Campa FJ, Veiga F (2008) Model development for
the prediction of surface topography generated by ball-end mills
taking into account the tool parallel axis offset. Experimental
validation. CIRP Ann Manuf Technol 57(1):101104
2. Bandyopadhyay S, Pal SK, Murthy CA (1998) Simulated
annealing based pattern classification. Inf Sci 109:165184
3. Brezonick M, Kovavic M, Ficko M (2004) Prediction of surface
roughness with genetic programming. J Mater Process Technol
157158:2836
4. Caydas U, Hascalik A (2008) A study on surface roughness in
abrasive waterjet machining process using artificial neural networks and regression analysis method. J Mater Process Technol
202:574582
5. Colak O, Kurbanoglu C, Kayacan MC (2007) Milling surface
roughness prediction using evolutionary programming methods.
J Mater Des 28:657666
6. Cus F, Balic J (2003) Optimization of cutting process by GA
approach. Robot Comput Integr Manuf 19:113121
7. Jain NK, Jain VK, Deb K (2007) Optimization of process
parameters of mechanical type advanced machining processes
using genetic algorithms. Int J Mach Tools Manuf 47(6):900919
8. Juan H, Yu FS, Lee BY (2003) The optimal cutting-parameter
selection of production cost in HSM for SKD61 tool steels. Int J
Mach Tools Manuf 43:679686
9. Khan Z, Prasad LB, Singh T (1997) Machining condition optimization by genetic algorithms and simulated annealing. Comput
Oper Res 24(7):647657
10. Kirkpatrick F, Gelatte CD, Vecchi MP (1983) Optimization by
simulated annealing. Science 220:671780
11. Lopez de Lacalle LN, Lamikiz A, Sanchez JA, Arana JL (2007)
The effect of ball burnishing on heat-treated steel and Inconel 718
milled surfaces. Int J Adv Manuf Technol 32(910):958968
12. Manolas DA, Gialamas TP, Frangopoulos CA, Tsahalis DT
(1996) A genetic algorithm for operation optimization of an
industrial cogeneration system. Comput Chem Eng 20:1107
1112
13. Oktem H, Erzurumlu T, Erzincanli F (2006) Prediction of minimum surface roughness in end milling mold parts using neutral
network and genetic algorithm. J Mater Des 27:735744
14. Oktem H, Erzurumlu T, Kurtaran H (2005) Application of
response surface methodology in the optimization of cutting
conditions for surface roughness. J Mater Process Technol
170:1116
15. Palanisamy P, Rajendaran I, Shanmugasundaram S (2007) Optimization of machining parameters using genetic algorithm and
experimental validation for end-milling operations. Int J Adv
Manuf Technol 32:644655
16. Suresh PVS, Venkateswara P, Deshmukh SG (2002) A genetic
algorithmic approach for optimization of surface roughness prediction model. Int J Mach Tools Manuf 42:675680
17. Swarnkar R, Tiwari MK (2004) Modeling machine loading
problem of FMSs and its solution methodology using a hybrid
tabu search and simulated annealing-based heuristic approach.
Robot Comput Integr Manuf 20:199209
18. Tarng YS, Ma SC, Chung LK (1995) Determination of optimal
cutting parameters in wire electrical discharge machining. Int J
Mach Tools Manuf 35(12):16931701
19. Wang ZG, Rahman M, Wong YS, Sun J (2005) Optimization of
multi-pass milling using parallel genetic algorithm and parallel
genetic simulated annealing. Int J Mach Tools Manuf 45:1726
1734
20. Wong TN, Chan LCF, Lau HCW (2003) Machining process
sequencing with fuzzy expert system and genetic algorithms. Eng
Comput 19:191202
21. Zain AM, Haron H, Sharif S (2010) Application of GA to optimize cutting conditions for minimizing surface roughness in end
milling machining process. Expert Syst Appl 37:46504659
22. Zain AM, Haron H, Sharif S (2010) Simulated annealing to
estimate the optimal cutting conditions for minimizing surface
roughness in end milling Ti-6Al-4V. Mach Sci Technol 14:4362
123