Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
PREDICTION OF METAL REMOVAL RATE AND SURFACE FINISH OF AN ELECTRO CHEMICAL MACHINED SURFACE USING NEURAL NETWORK Guided by Prof.S.AYYAPPAN.,M.E.,
4/13/2012
By V.Suresh
FROM PHASE-I
2
In this phase, ECM process parameters to be optimized using Genetic algorithm based Neural Network model in order to predict MRR and Surface roughness.
4/13/2012
Defenition of GA :
A genetic algorithm maintains a population of candidate solutions for the problem at hand, and makes it evolve by iteratively applying a set of stochastic operators
Enumerative Techniqes
Fibonac ci
sort
DFS
Dynamic Programming
BFS
Tabu Search
Hill Climbing
Simulated Anealing
Evolutionary Algorithms
Genetic Programming
Genetic Algorithms
GENETIC OPERATERS
Selection replicates the most successful solutions found in a population at a rate proportional to their relative quality Recombination decomposes two distinct solutions and then randomly mixes their parts to form novel solutions Mutation randomly perturbs a candidate solution
Genetic Algorithm Basic algorithm Outline of the basic algorithm 0 1 2 START : Create random population of n chromosomes
FITNESS : Evaluate fitness f(x) of each chromosome in the population NEW POPULATION 0 SELECTION : Based on f(x)
1 RECOMBINATION : Cross-over chromosomes 2 MUTATION 3 ACCEPTATION 3 : Mutate chromosomes : Reject or accept new one
generation
4 5 TEST LOOP : Test problem criterium : Continue step 1 4 until criterium is satisfied
CONCEPTUAL ALGORITHM
REPRODUCTION
Crossover
Two parents produce two offspring There is a chance that the chromosomes of the two parents are copied unmodified as offspring There is a chance that the chromosomes of the two parents are randomly recombined (crossover) to form offspring Generally the chance of crossover is between 0.6 and 1.0
Mutation
There is a chance that a gene of a child is changed randomly Generally the chance of mutation is low (e.g. 0.001)
REPRODUCTION OPERATORS
Crossover
Generating
Single
point crossover Two point crossover (Multi point crossover) Uniform crossover
MUTATION
Offspring1 Offspring2
mutate
101101111
101000000
Offspring1 Offspring2
101100111
100001000
Original offspring
Mutated offspring
With some small probability (the mutation rate) flip each bit in the offspring (typical values between 0.1 and 0.001)
Concept is easy to understand Modular, separate from application Supports multi-objective optimization Good for noisy environments Always an answer; answer gets better with time Inherently parallel; easily distributed
THANK YOU