# A Simulated Annealing Algorithm For The Optimization Of Surface Finish In Dry Turning Of SS 420 Materials

DOI : 10.17577/IJERTV2IS60153

Text Only Version

#### A Simulated Annealing Algorithm For The Optimization Of Surface Finish In Dry Turning Of SS 420 Materials

A Simulated Annealing Algorithm For The Optimization Of Surface Finish In Dry Turning Of SS 420 Materials

Dr. T .G. AnsalamRaj

Department of Mechanical Engineering, METS School of Engineering,Mala,Thrissur,Kerala,India.

Abstract

Determination of optimal cutting parameters is one of the most important elements in any process planning of metal parts. This paper presents a development of a simulated annealing algorithm (SA) and its application to optimize the cutting parameters for predicting the surface roughness is proposed. Optimization of cutting parameters and prediction of surface roughness is concerned with a highly constrained nonlinear dynamic optimization problem that can only be fully solved by complete enumeration. Optimisation in turning means the termination of the optimal set of machining parameters to satisfy the objectives within the operational constraints. Simulated annealing combines a downhill search with a random search. In simulated annealing (SA) method, an exponential cooling schedule based on Newtonian cooling process is employed and experimentation is done on choosing the number of iterations (m) at each step. The SA approach is applied to predict the influence of tool geometry (nose radius) and cutting parameters (feed, speed and depth of cut) on surface roughness in dry turning of SS 420 materials conditions based on Taguchis orthogonal array method.

Key words Simulated annealing algorithm . Global optimization. Taguchi methods. Turning. Surface roughness.

1. Introduction

Optimization of cutting parameters is usually a difficult work [1], where the following aspects are required: knowledge of machining; empirical equations relating the tool life, forces, power, surface finish, etc., to develop realistic constrains; specification of machine tool capabilities; development of an effective optimization criterion; and knowledge of mathematical and numerical optimization techniques [2]. The selection of optimal cutting parameters, like depth of cut, feed and speed, is a very important issue for every machining process. In workshop practice, cutting parameters are selected from machining databases or specialized handbooks, but the range given in these sources are actually starting values, and are not the optimal values [3]. Regarding machining operations, these considerations usually lead the designers to seek optimum machining parameters in order to minimize machining costs. In turning, cutting speed, feed rate and cutting depth are the most important of these parameters. These are determined based on the constraints imposed by the specifications of the machine, cutting tool and the

engaged work piece. The number of modeled constraints has a direct clear relevance to the complexity of problem. In several case studies, the number of constraints is limited in order to facilitate finding the optimum [4-9]. In some others, additional considerations such as the chip- tool interface temperature are taken into account [10]. The above mentioned parameters are of discrete nature or imposed to discretization due to practical limitations. Therefore, the discrete or continuous-discrete search space of the problem as well as the complex objective function necessitates the employment of methods other than classic approaches.

In any optimization procedure, it is a crucial aspect to identify the output of chief importance, the so-called optimization objective or optimization criterion. There is no generalized solution method that can be used for all machining optimisation problems (Chang et.al.1991). The earlier optimisation techniques may only be useful for a specific problem and inclined to obtain local optimal solution. In this paper, simulated annealing is employed as it normally exhibits fast convergence and straightforward implementation, to obtain the optimal parameters in turning processes. The SA algorithm has been demonstrated that it has the capability of escaping from the local optima. Simulated annealing (SA) is one of the stochastic search algorithms, which is designed using a spin glass model by the Kirkpatrick [12]. It has been used in wide areas from the combinatorial problems to the real world problems because it performs well on most of optimization problems, especially on complex problems [13,14,15].The power of SA originates from the good selection scheme and annealing technique. Generally SA used two kinds of selection scheme. One is the Metropolis algorithm and the other is the logistic selection algorithm [16]. Originally any kind of selection that satisfies the detailed balance equation can be used as a selection scheme because the detailed balance equation guarantees the convergence of SA [17]. Another reason why SA performs well is annealing, that is, the gradual temperature reducing technique. On the contrary, studies on evolutionary algorithms have shown that these methods can be efficiently used to eliminate most of the above-mentioned difficulties of classical methods [18].

Surface roughness is defined as the irregularities on any material surface resulting from machining operations. Average roughness Ra is theoretically derived as the arithmetic average value of departure of the profile from the mean line along a sampling length [19].Surface roughness is an essential requirement in determining the surface quality of a product. In this paper the optimum process parameter on surface roughness on the machining of SS420 material was investigated.

2. Experimental details

When developing models on the basis of experimental data, careful planning of experimentation is essential. The factors considered for experimentation and analysis were cutting speed, feed rate, depth of cut and nose radius.

2.1 Parameter design based on the Taguchi method

Modeling provides reliable equations obtained from the data of properly designed experiments. Therefore, it is essential to have a well-designed set of experiments. A well- designed experiment can substantially reduce the number of experiments required. Several types of experimental results have been reported. In this research, the design suggested by Taguchi is used.

2.1.1 Orthogonal array experiment

Classical experimental design methods are too complex and are not easy to use. A large number of experiments have to be carried out when the number of process parameters increases. To solve this problem, the Taguchi method uses a special design of orthogonal arrays to study the entire parameter space with only a small number of experiments. According to the Taguchi method, a robust design and an L27 orthogonal array are employed for the experimentation. Four machining parameters are considered as controlling factors namely, cutting speed, feed rate, depth of cut and nose radius and each parameter has three levels namely low, medium and high, denoted by 1,2 and 3, respectively. Table 1 shows the cutting parameters and their levels considered for the experimentation. The experimental design considered for the investigation to achieve an optimal surface finish during the turning of SS 420 steel is based on the L27 orthogonal array. Based on this, a total number of 27 experiments in dry machining is done, each having a different combination of levels of factors were carried out.

#####Table 1 Three level tables with four factors#######

2.2 Experimental details

The experiment is performed on SS 420 of size 25 mm diameters which contains 12% of chromium sufficient enough to give corrosion resitance property and good

ductility. Its chemical composition is given as 0.15% C, 12.0-14.0% Cr , < 1.0% Si ,

<0.04% P ,<1.0% Mn, <0.03% S and remaining as Fe . The cutting tool for turning with rhombic tooling system is uncoated tungsten carbide having zero rake angle,7o clearance angle and 55o cutting edge angle and of nose radii 0.4,0.8 and 1.2 have been used for experiment. The different sets of experiments are performed using a Kirloskar centre lathe. The machined surface is measured at three different positions and the average values are taken using a RUGOSURF 10G surface texture measuring instrument.

3. Cutting process model

1. Decision variables

In the constructed optimization problem, four decision variables are considered: cutting speed (V), feed (F), cutting depth (D) and cutting tool nose radius (R). These are the important cutting parameters of the process.

2. Mathematical model

In this work, the experimental results were used for modeling using response surface methodology. The purpose of developing mathematical models was to relate the machining responses to the parameters and thereby to facilitate the optimization of the machining process. With these mathematical models, the objective function and process constraints can be formulated, and the optimization problem can then be solved by using the Simulated algorithm (SA).

3.2.1 Mathematical formulation

Response Surface Methodology (RSM) is a combination of mathematical and statistical techniques for empirical model building and optimization. By conducting experiments and applying regression analysis, a model of the response to certain independent input variables can be obtained. The mathematical models commonly used are represented by:

Y = ( V,F, D, R )+

where Y is the machining response (surface finish), is the response function

and V,F , D, R are turning variables and is the error that is normally distributed about the observed response Y with a zero mean.

The general second-order polynomial response is as given below:

u

x

x

2 x x

(1)

k

k

k

k

0 i iu

i 1

ii iu

i 1

ij iu ju

i j

where Yu represents the corresponding response, the surface roughness Ra in the

present research. The code values of

ith

machining parameters for uth

experiment are

represented by

xiu . The values of k indicate the number of machining parameters. The

terms

i , ii

and

ij

are the second order regression co-efficient. The second term under

the summation sign of this polynomial equation attributes to linear effects, whereas the third term of the above equation corresponds to the higher order effects and lastly the fourth term of the equation includes the interactive effects of the parameters.

It also confirms that this model provides an excellent explanation of the relationship between the independent factors and the response arithmetic average roughness (Ra). The second order response surface representing the surface roughness, Ra can be expressed as a function of cutting parameters such as feed (F), cutting speed (V), depth of cut (D) and nose radius (R).

Ra 0 1(F) 2 (D) 3 (V ) 4 (R) 5 (FD) 6 (FV ) 7 (FR) 8 (DV )

(DR)

(VR) (F 2 )

(D2 ) (V 2 )

(R2 ) (2)

9 10

11 12

13 14

To obtain practical predictive quantitative relationships, it is necessary to model the turning responses and the process variables. In the present work, the mathematical models were developed on the basis of dry machining experimental results as shown in Table 2. The experimental results were used to model the response using response surface methodology.

### Table 2 Experimental results of arithmetic average roughness, Ra #####

Optimization of machining parameters enhances not only the economics of machining, but also the product quality to a great extent. An effort has been made to

estimate the optimum tool geometry and machining conditions to produce the best possible surface quality within the chosen constraints in dry machining.

In order to optimize the present problem using simulated annealing algorithm (SA), the constrained optimization problem is stated as follows:

From the observed data for surface roughness, the response function has been determined using RSM and fitness function , defined as Minimize,

Ra 4.89 2.49F 38.0D 0.599V 3.27R 5.38F * D 0.0140F *V 18.2F * R

0.0097D *V 15.8D * R 0.232V * R 80.5F 2 16.5D2 0.00318V 2 (3)

subject to

39.269 m/min V 94.247 m/min

0.059 mm/rev F 0.26 mm/rev

0.4 mm D 1.2 mm 0.4mm R 1.2mm xil xi xiu

where xil and xiu are the upper and lower bounds of process variables xi . x1, x2, x3, x4 are the cutting speed, feed, depth of cut and nose radius respectively. In order to optimize the present problem using SAs, the following parameters have been selected to obtain optimal solutions with less computational effort.

Maximum number of generations = 1000 Population Size =

Initial Temperature,T0 = 1 Final Temperature, Tf = 1*10-20 Cooling rate = 0.9

4. PROPOSED ALGORITHM

This section describes the proposed SA. First, a brief overview of the SA is provided then the solution procedures of the proposed SA are stated.

1. SIMULATED ANNEALING METHOD (SA)

Simulated annealing presents an optimization technique that can: (a) process cost functions possessing quite arbitrary degrees of nonlinearities, discontinuities, and stochasticity; (b) process quite arbitrary boundary conditions and constraints imposed on these cost functions; (c) be implemented quite easily with the degree of coding quite minimal relative to other nonlinear optimization algorithms; (d) statistically guarantee finding an optimal solution. Simulated annealing combines a downhill search with a random search. In order not to be trapped in a locally optimum region, this procedure sometimes accepts movements in directions other than steepest ascend or descend. The acceptance of an uphill rather that a downhill direction is controlled by a sequence of random variables with a controlled probability. Simulated annealing (SA) [20] is a powerful stochastic search method applicable to a wide range of problems for which little prior knowledge is available. It can produce high-quality solutions for hard combinatorial optimization [21].

The process of slow cooling is known as annealing in metallurgical process. The simulated annealing procedure simulates this process of slow cooling of molten metal to achieve the minimum function value of surface roughness in the problem of minimization. It is a point-by- point method. The algorithm begins with an initial point and a high temperature T. A second point is taken at random in the vicinity of the initial point and the difference in the function

values (E) at these two points is calculated. Suppose that initially we have a point xt in the

search space and that the cost at that point is f(xt). A new point xt+1 is randomly generated that is "nearby" in some sense; we will call this a "trial point". The cost there is f(x t+1). Next we decide whether to move to x t+1, that is whether to replace xt by x t+1 as the current approximation. If

f(x t+1) < f(x) then the move is definitely accepted. If f(x t+1) f(x) then the move is accepted with a probability of

f ( xt 1 ) f ( xt )

Pr ( move_ accepted )exp

(5)

T

This completes an iteration of this simulated annealing procedure. In the next generation another point is created at random in the neighborhood of the current point ad the Metropolis algorithm is used to accept or reject it. In order to simulate the thermal equilibrium at every temperature the

number of points (n) is usually tested at a particular temperature before reducing the temperature. The algorithm is terminated when a sufficiently small temperature is obtained are a small enough change in function value is obtained.

The structure of the proposed simulated annealing algorithm (SA) is as follows.

STEP-1

Choose a start point (x) and set a high starting temperature (T), set the iteration count (K=1)

STEP-2

Evaluate objective function E=f(x)

STEP-3

Find new point

Xi(k 1) Xi(k ) i ( Xi max Xi min)

i (1,1)

i sign(i 0.5)*T

1

1

i (

1 ) 2Ui 1

1

1

Ti

Select x with probability determined by Set the new point X new = X+X

g(x ,T )

2

2

g( ,T ) 2T n / 2 exp x

,n = dimension of space under

x

2T

exploration. The new point should be between the maximum and minimum limit

STEP-4

Calculate the new value of the objective function using fitness equation.

E new = f(X new)

STEP-5

Set X to X new and E to E new with probability determined by acceptance function

h (E, T) =1/[1+ exp(E/CT)] ,T= Current temperature, C=System dependent constant, E= E new-E

STEP-6

Reduce the temperature according to annealing schedule.

STEP-7

Increment the iteration count K, if K reaches the maximum stop iteration; otherwise go back to STEP-3.

Process 1 : Initialisation

Choose an initial point x(0) and a termination criterion , Set T a sufficiently high value, number of iterations to be performed at a particular temperature n, and set t = 0

Process 2: Generation of neighborhood seed and evaluation

Process 3: Calculation of uphill and downhill move acceptance parameter E

The new seed is selected by calculating the value of E. The difference between the best seed in the neighborhood seed and the initial seed.

If E = f(xt+1) f(xt) < 0,set t =t+1; Else create random number (r) in the range (0,1).

If r Pr , set t= t+1, otherwise go to step 2.

If xt+1 – xt < and T is small ,terminate; Else

If ( t mod n ) = 0 then lower T according to a cooling schedule go to step 2.

The SA code was developed using MATLAB. The input machining parameter levels were fed to the SA program. The SA program uses number of iterations to predict the values of tool

geometry and cutting conditions for minimization of surface roughness. Table 3 shows the comparison of minimum values of surface roughness with respect to input machining parameters for SA. It is possible to determine the conditions at which the turning operation has to be carried out in order to get the optimum surface finish. The performance of SA is described in figure 1. The application of a simulated algorithm approach to obtain optimal machining conditions will be quite useful at the computer-aided process planning (CAPP) stage in the production of high- quality goods with tight tolerances by a variety of automated machining operations, and in adaptive control machine tools. With the known boundaries of surface roughness and machining conditions, machining can be performed with a relatively high rate of success with the selected machining conditions.

#Table 3- Output values of the simulated annealing algorithm with respect to input machining parameters ####

### Fig.1 Cooling diagram f SA ###

6 Conclusions

The effect of various parameters such as cutting speed, feed rate, depth of cut and nose radius, has been studied in the turning of SS 420 steel material. By incorporating the tool geometry in the model, the validity of the model has been enhanced. The optimization, carried out in this work, gives an opportunity for the user to select the best tool geometry and cutting condition so as to get the optimum surface quality. To model the machining process, several important operational constraints have been considered. These constraints were taken to account in order to make the model more realistic. A major advantage of SA is its flexibility and robustness as a global search method. This algorithm is a powerful technique in optimization of problems with discrete search space and multiple local optima. It can deal with highly nonlinear problems and non-differentiable functions as well as functions with multiple local optima. The computational results clearly demonstrated that the proposed solution procedure is quite capable in solving such complicated problems effectively and efficiently.

References

1. Kumar, R., Kumar, V., 2000. Optimum selection of machining conditions in abrasive

flow machining using neural networks.Journal of Material Processing Technology 108, 62 67.

2. Sonmez, A.I., Baykasoglu, A., Dereli, T., Filiz, I.H., 1999. Dynamic optimization of multipass milling operation via geometric programming. International Journal of

Machine Tools & Manufacturing 39, 297 320.

3. Dereli, D., Filiz, I.H., Bayakosoglu, A., 2001. Optimizing cutting parameters in process planning of prismatic parts by using genetic algorithms. International Journal of

Production Research, 39 (15), 3303 3328.

1. Y. C. Shin, Y. S. Joo, ,1992 "Optimization of machining conditions with practical constraints", Int. J. Prod. Res., vol. 30, no. 12, pp. 29072919.

2. T. Joko and H. S. Kim, "Autonomous cutting parameter regulation using adaptive modeling and genetic algorithms," J. Precis. Eng., vol. 22, pp.243250, 1998.

3. M. V. Reibeiro and N. L. Copprni, "An applied database system for optimization of cutting conditions and tool selection," J. Mater. Process. Technol., vol. pp.371-374, 1999.

1. B. Y. Lee and Y. S. Tarng, "Cutting-parameter selection for maximizing production rate or minimizing production cost in multistage turning operations," J. Mater. Process. Technol., vol.105, pp.61-66, 2000.

2. F. Cus and J. Balic, "Optimization of cutting process by GA approach," Robot. Cim-Int. Manuf., vol.19, pp.113121, 2003.

3. G. C. Onwubolu and T. Kumalo, "Multi-pass turning optimization based on genetic algorithms," Int. J. Prod. Res., vol. 39, pp. 3727-3745, 2002.

4. D. E. Goldberg., 1989 Genetic Algorithms in Search, Optimization and Machine Learning, MA: Addison-Wesley Publishing Company Inc.

5. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi,Optimization by Simulated Annealing,

Science,vol.220, pp.671-680, 1983.

6. P. J. M. V. Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Dordrecht, The Netherlands, D. Reidel, 1987.

7. R. Azencott, Simulated Annealing: Parallelization Techniques, Reading, John-Wiley & Sons, Inc., 1992.

8. L. J. Park, Hybrid Evolutionary Algorithms with Heuristic Operators for Combinatorial Optimization Problems, Ph. D Thesis, 1997.

9. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbloth,A. H. Teller, and E. Teller, Equation of State Calculation by Fast Computing Machines, Journal of Chemical Physics, vol.21, pp.1087-1092, 1953.

10. D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, Convergence and Finite-time Behavior of Simulated Annealing, Advanced Applied Probability, vol.18, pp.747-771, 1986. [18]. Soodamani, R., Liu, Z.Q., 2000. GA based learning for a model based object recognition system. International Journal of Approximate Reasoning Vol. 23, 85 109.

[19]. Sander .M ,1991. A practical guide to assessment of surface texture. Gottingen, Germany.

1. Yao, X., "A new simulated annealing algorithm", nternational Journal of Computer Mathematics, 56 (1995) 161-168.

2. Yao, X., "Call routing by simulated annealing", International Journal of Electronics, 79 (4) (1995) 379-387.

1

0.8

Temperature

Temperature

0.6

0.4

0.2

0

0 2000 4000 6000 8000 10000 12000

Iterations

Fig.1. Cooling diagram of SAA

Table 1 Three level tables with four factors

 Levels Feed F in mm/rev cutting velocity V in m/min Depth of cut D in mm Nose radius R in mm 1 0.059 39.269 0.4 0.4 2 0.159 60.475 0.8 0.8 3 0.26 94.247 1.2 1.2

Table 2 Experimental results of arithmetic average roughness, Ra

Experi

ment Feed

Depth of cut

Cutting velocity

Test result of Ra( Âµm)

Average Surface

runs F DOC V R

roughness Ra

 mm/rev mm m/min mm y1 y2 y3 microns 1 1 1 1 1 1.38 1.545 1.455 1.46 2 1 2 2 2 0.971 0.908 1.039 0.972667 3 1 3 3 3 1.706 1.787 1.365 1.619333 4 1 1 2 3 0.893 0.971 0.81 0.891333 5 1 2 3 1 1.921 1.762 1.933 1.872 6 1 3 1 2 2.617 2.692 2.72 2.676333 7 1 1 3 2 1.334 1.243 1.347 1.308 8 1 2 1 3 0.88 0.876 0.861 0.872333 9 1 3 2 1 1.148 1.273 1.621 1.347333 10 2 1 2 3 1.465 1.281 1.248 1.331333 11 2 2 3 1 2.273 2.169 2.232 2.224667 12 2 3 1 2 1.512 1.869 2.365 1.915333 13 2 1 3 2 1.201 1.11 1.09 1.133667 14 2 2 1 3 1.353 1.211 1.137 1.233667 15 2 3 2 1 2.046 1.959 1.894 1.966333 16 2 1 1 1 2.133 1.908 2.11 2.050333 17 2 2 2 2 1.785 1.988 1.537 1.77 18 2 3 3 3 1.13 1.41 1.36 1.3 19 3 1 3 2 2.637 3.475 3.491 3.201 20 3 2 1 3 1.746 1.763 1.753 1.754 21 3 3 2 1 5 4.566 4.817 4.913667 22 3 1 1 1 5.832 5.743 5.657 5.744 23 3 2 2 2 3.163 3.116 3.2 3.159667 24 3 3 3 3 2.358 2.23 2.399 2.329 25 3 1 2 3 1.941 2.107 1.853 1.967 26 3 2 3 1 4.99 5.957 5.358 5.435 27 3 3 1 2 3.186 2.944 3.042 3.057333

Table 3 Output values of the genetic and simulated annealing algorithms with respect to input machining parameters

Method

Machining Parameters SAA

 Feed,F(mm/rev) 0.0940448 Depth of cut,D(mm) 0.812389 Cutting Velocity,(m/min) 47.2431 Nose Radius,R(mm) 0.786445 Min. Surface Roughnes,Ra(microns) 3.43457*10-6