Professional Documents
Culture Documents
Optimization based on
Genetic Algorithm
Enrollment No.
(150090709009)
(150090709018)
AGENDA
Introduction
Case Study
Conclusion
Introduction
Genetic
Algorithm
This algorithm is based on Darwins theory of Survival of the fittest. The algorithm
repeatedly modifies a population of individual solutions. At each step, the genetic
algorithm randomly selects individuals from the current population and uses them as
parents to produce children for next generation. Over successive generations, population
"evolves" toward an optimal solution.
Introduction
You can apply the genetic algorithm to solve problems that are not well suited for standard
Introduction
Classical Algorithm
Genetic Algorithm
Generates a single point at each iteration. The Generates a population of points at each
sequence of points approaches an optimal
iteration. The best point in the population
solution.
approaches an optimal solution.
Selects the next point in the sequence by a
deterministic computation.
Genetic algorithm maintains a population of individuals, say P(t), for generation t. Each
individual represents a potential solution to the problem at hand. Each individual is evaluated
to give some measure of its fitness. Some individuals undergo stochastic transformations by
means of genetic operations to form new individuals.
7
Introduction
There are two type of transformation:1) Crossover, which creates new individuals by combining parts from two individuals.
2) Mutation, which creates new individuals by making changes in a single individual.
The new individuals, called offspring C(t), are then evaluated. A new population is formed
by selecting the more fit individuals from the parent population and offspring population.
After several generations, genetic algorithm converges to the best individual, which
hopefully represents an optimal or suboptimal solution to the problem.
Introduction
Parent 1
0
Offspring 1
0
Parent 2
Offspring 2
Parent
9
Offspring
Introduction
Genetic Algorithm
Initial population
Selection
(Stochastic uniform
method)
Ranking
Cross-over
Replace the old
Generation with the new one
Mutation
Loop
10
Yes
Is the
stopping
criterion
satisfied?
No
Stop
Introduction
Effectively they search the whole of the solution space, without calculating the fitness
function at every point. This can help avoid a danger in any optimization problem which is
being trapped in local maxima or minima. There are two main reasons for this:
11
The disadvantage of genetic algorithms is that it, Sometimes, have trouble finding the
exact global optimum because there is no guaranty to find best solution.
Another drawback that GAs require large number of response (fitness) function
evaluations depending on the number of individuals and the number of generations.
Therefore, genetic algorithms may take long time to evaluate the individuals.
Crossover is a crucial aspect of any genetic algorithm, but it may seem that it will
dramatically change parents with a high fitness function so that they will no longer be fit.
12
Application
Automotive Design
Engineering Design
Robotics
Evolvable Hardware
Optimized Telecommunications Routing
Biomimetic Invention
Computer Gaming
Optimizing Chemical Kinetic Analysis
13
Application
Case study: 1
APPLICATION
APPLICATION OF
OF GENETIC
GENETIC ALGORITHMS
ALGORITHMS TO
TO OPTIMIZATION
OPTIMIZATION OF
OF ROLLING
ROLLING
SCHEDULES
SCHEDULES BASED
BASED ON
ON DAMAGE
DAMAGE MECHANICS
MECHANICS
Industrial tandem cold rolling mill
Fig. 1 illustrates a schematic diagram of a five-stand tandem cold rolling mill at IMSC .
14
Effect
of reduction schedule on damage evolution:
where represents the exit strip thickness for that rolling stand and is the initial strip
thickness (the entry strip thickness for Stand 1).
15
Case : 1
Fig. 2 illustrates the total reduction distribution among the rolling stands,
calculated from above equation.
16
Case : 1
17
Case : 1
Fig. 3 illustrates the variations of the maximum damage parameter versus the value of the
function F(D), defined as:
F(D) = R1+R2+R3+R4
of
the
total
reduction
Case : 1
Industrial Constraints:
19
Other Constraints:
Case : 1
Objective
Function:
of the rolling
20
the
Case : 1
evolution during the process should be minimized. As it was mentioned in the previous
sections, a way to meet this aim is to
percentage values at Stands
defined as
21
follows:
Case : 1
Multi-objective function:
In order to optimize the power and damage simultaneously in a process, the total objective
function is defined as:
F(Total)=[F(Damage);F(Power)]
The solution of a MOP is associated with the definition of Pareto-optimal solutions. The
concept of Pareto optimality was introduced at the turn of the previous century by the
Swiss economist Pareto. A solution is said to be Pareto optimal if the value of any
objective function, F(D) cannot be improved without degrading at least one of the other
objective functions.
22
Case : 1
Power optimization:
23
Case : 1
The power optimization results predicted a descending trend for the reduction distribution
among the rolling stands and it was consistent with the optimal schedules reported in the
literature. The optimization results indicated a reduction of 8% in power consumption.
In the presence of the industrial constraint, the damage optimization results predicted an
upward trend for the reduction values from Stand 1 to Stand 3 and a downward trend from
Stand 3 to Stand 5, while in the absence of the industrial constraints it predicted an
ascending trend for the reduction values which is in contrast to the obtained power
optimized schedule. This inconsistency stems from this fact that the work hardening
phenomenon reduces the damage evolution while increases the power consumption during
the rolling process.
24
Case :1
Case study: 2
TITLE
TITLE :: A
A NEW
NEW MULTI-OBJECTIVE
MULTI-OBJECTIVE GENETIC
GENETIC ALGORITHM
ALGORITHM APPLIED
APPLIED TO
TO HOTHOTROLLING
ROLLING PROCESS
PROCESS
Biologically inspired and genetic algorithms based multi-objective optimization
algorithms are now being widely used in the materials arena.
Some important areas where this methodology is already in place are being particulate
processing , polymer processing , ferrous metallurgy, alloy design, processing plant
optimization etc. It works on a neighbourhood concept in the functional space, utilizes
the ideas on weak dominance & ranking , uses its own procedures for population sizing.
The algorithm was successfully tested with some standard test functions, and when applied
to a real-life data of the hot-rolling campaign of an integrated steel plant, it outperformed
another recently developed multi-objective evolutionary algorithm.
25
This new multi-objective genetic algorithm (NMGA) implements the condition of weak
dominance that could be stated as follows for a constrained minimization problem,
Minimize objective functions : fi(x), i = 1,2,...i
Subject to constraints : gj(X ), j = 1,2,...,J
where X= (xk: k = 1,2,...,K) is a K-tuple vector of variables.
Let an I-tuple vector of objectives is defined as,
i fi : i 1, 2,..., I
Then the condition for dominance between any two objective vectors can be taken as,
In other words, if one particular solution is at least as good, or better in terms of all the
l p m i
objective functions, when compared to another solution, and definitely better in terms of at
least one objective function, it is considered to be a weakly dominating solution.
26
Case : 2
1.
2.
1.
3.
4.
space :
.
Case : 2
fi fi ( L )
f i (U ) f i ( L )
gi n
where, the superscripts indicate the lower and upper bounds of the function and n denotes
the total number of grids that the user needs to specify.
2.
on
to
the
neighbourhood
them.
functional
space,
is assigned to each of
The neighbourhood used in NMGA: (a)von-neumann (b) Moore
Case : 2
3.
.
In the Fonseca strategy the entire population is checked for dominance and the ranks to the
individuals are assigned using the formula:
where Ri is the rank of the individual i, and Nd
Ri 1 N d
4.
N R NO e
Case : 2
The total set S should be equal to the sum of permitted individuals of all ranks, such that
S N1 N 2 N 3 ... N
Substituting the values of N1,N2,N3, . . . ,N1 into the above equation, the final equation
becomes
s N O (e 1 e 2 e 3 ...e )
N O s (e 1)
However, by doing so, the value of NR will be < 1 for the ranks above ln(No). Such
individuals will have no representation in the main population even though some space might
be still available.
30
Case : 2
31
NR
max N O e ,1 if N i S
R
i 1
otherwise
Case : 2
Function space
Main population
Find Neighbours
Generations
Population sizing
conducted using the rank
values
mapping
i
+
Main population
32
In recent times both the hot- and cold-rolling processes have been subjected to a number
of genetic algorithms.
During a particular operation in the hot-rolling process, the steel plants routinely process a
Such slabs usually constitute different orders, and often vary significantly both in terms of
For a smooth rolling operation, imparting minimum damage to the rolls, it is necessary that
both the dimensions and physical properties should vary gradually from one slab to next.
For
example, the width of one slab being rolled should not be too much different from its
predecessor.
Similarly, physical properties like ultimate tensile strength or hardness should not jump
haphazardly from one slab to the next while the rolling schedule is on.
33
Case : 2
their width ,also in terms of physical property. Such simultaneous attempts of optimizing
more than one conflicting criteria, lead to a multi-objective situation in this case.
A compromise needs to be worked out between the conflicting criteria, and the family of
Case : 2
In this study we have utilized a real-life hot-rolling campaign at TATA Steel, containing a
total of 83 slabs each of a different combination of width, ultimate tensile strength (UTS)
and lower yield strength (LYS).
We attempted to minimize the overall standard deviations in terms of each of the properties
during the entire rolling campaign, and the objective functions were taken as,
In this campaign, the three parameters:
1.
2.
3.
Case : 2
We ran the NMGA code for 3000 generations to achieve that and simultaneously
attempted to solve the problem, using generalized differential evolution (GDE). The
computed Pareto fronts are shown in Fig.
Z DT P areto fronts
Z DT1: Convex front
36
Case : 2
Increasing
grid sizes beyond this limit became inconsequential in terms of the quality of
the results. furthermore, our executable code crashed when a 1500 1500 sized grid was used.
For this problem we ran our code with a size of 100, which worked out to be adequate, and
the program once again crashed when the population size was increased over 300.
Genetic recombination was performed with order-based crossover (OBX) with a probability
of 0.92 and an appropriate mutation with a probability of 0.08 after a systematic trial & error.
1.
2.
secondly, its ability to address this particular problem could be a boon to the steel
makers worldwide, where the rolling mill engineers encounter it routinely and need to
provide a solution practically on a daily basis.
38
Case : 2
This study proposes the algorithm NMGA and demonstrates its efficacy in solving not
only some standard test functions but also an important practical problem of considerable
complexity.
When pitted against a Generalized Differential evolution, its performance is better both in
NMGA is quite straightforward to encode, and could be easily used as a versatile solver
39
Case : 2
Conclusion
40
Reference
[1] Mehrdad Poursina, Noushin Torabian Dehkordi, Amin Fattahi, Hadi Mirmohammadi,
Application of genetic algorithms to optimization of rolling schedules based on damage
mechanics, Simulation Modelling Practice and Theory 22 (2012) 6173.
[2] N. Chakraborti , B. Siva Kumar, V. Satish Babu , S. Moitra, A. Mukhopadhyay, A new
multi-objective genetic algorithm applied to hot-rolling process, Applied Mathematical
Modelling 32 (2008) 17811789.
http://brainz.org/15-real-world-applications-genetic-algorithms/
41
THAT IS IT ......!
THANK YOU
FOR YOUR ATTENTION