Presentation on

Optimization based on
Genetic Algorithm

C. K. PITHAWALA COLLEGE OF ENGINEERING

AND TECHNOLOGY, SURAT
Optimization based
based on
on Genetic
Genetic Algorithm
Algorithm
Optimization
PREPARED BY:
Name

Enrollment No.

1. Ms. KRISHNA MODI

(150090709009)

2. Mr. RAHUL PATEL (150090709014)

3. Mr. HITESH RANA (150090709017)
2. Mr. AVADHESH H. VYAS

(150090709018)

Subject : Engineering Optimization ( OEP ) GUIDED BY:

M.E., 2nd Semester, Machine Design, Dr. KALPESH D. MANIYA
GTU, Surat, Gujarat. Mechanical Engineering Dept.
CKPCET, SURAT.
2

AGENDA

Introduction

Application , merits and limitation

Case Study

Conclusion

Introduction

Genetic
Algorithm

What is Genetic Algorithm?

A genetic algorithm (GA) is a method for solving both constrained and unconstrained
optimization problems based on a natural selection process that mimics biological
evolution.

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

optimization algorithms, including problems in which the objective function is

discontinuous, non differentiable, stochastic, or highly nonlinear.

Introduction

How it differs from Classical O.P.?

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.

Selects the next population by computation

which uses random number generators.

How Genetic Algorithm works?

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

Crossover: which creates new individuals by combining parts from two

individuals.
1

Parent 1
0

Offspring 1
0

Parent 2

Offspring 2

Mutation: which creates new individuals by making changes in a single

individual.
1

Parent
9

Offspring
Introduction

Genetic Algorithm
Initial population

Generating new population

Fitness function evaluation

Selection
(Stochastic uniform
method)

Ranking

Cross-over
Replace the old
Generation with the new one

Mutation

Fitness function evaluation

Loop
10

Yes

Is the
stopping
criterion
satisfied?

No

Stop

Introduction

Application, Merits and Limitation

Advantages of Genetic Algorithm:

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:

1) The initial population, being randomly generated, will sample the

whole of the solution space, and not just a small area.
2) Variation inducing tactics, i.e. crossover and mutation, prevent the
algorithm being trapped in one part of the solution space.

11

Disadvantages of Genetic Algorithm:

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

Application of Genetic Algorithm:

Automotive Design
Engineering Design
Robotics
Evolvable Hardware
Optimized Telecommunications Routing
Biomimetic Invention
Computer Gaming
Optimizing Chemical Kinetic Analysis

Finance and Investment Strategies

Marketing and Merchandising

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:

In the present study, in order to investigate the effect of reduction distribution on

damage evolution, the total reduction percentage at each rolling stand, , which is
defined as equation below, is considered.

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

According to Fig. 3, the maximum

damage value increases by increasing
the value of the F(D) function.
Therefore, it can be concluded that a
way to minimize damage evolution
through the strip is to develop a
reduction schedule in which the
sum

of

the

total

reduction

percentage values at the first four

stands is minimum.
18

Case : 1

Design variables and constraints:

Since the initial and final thicknesses of strip are known before rolling, the magnitudes of
reduction for the five stands are not independent. Therefore the reductions for the first four
stands are considered as design variables and the last stand reduction percentage is
considered as a dependent variable.

Industrial Constraints:

19

Other Constraints:

Case : 1

Objective
Function:

Power objective function:

An important goal which the rolling setups should meet is minimizing

power consumption and consequently maximizing the throughput

mill. Hence, the power consumption objective function can be

of the rolling

defined as the sum of

the powers of the rolling stands, described by the following relation:

20

the

Case : 1

Damage objective function:

In order to reduce the probability of strip tearing occurrence, the damage

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

minimize the sum of the total reduction

14. Therefore, the damage objective function can be

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)]

In a multi-objective optimization problem (MOP), a number of conflicting objective

functions are to be optimized simultaneously. An ideal solution, at which each objective
function gets its optimal value, usually does not exist due to the conflicting nature of
objective functions.

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

Result and Discussion

Power optimization:

23

Case : 1

The rolling scheduling problem - Conclusion

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

NMGA: The New Multi-objective Genetic

Algorithm

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

fil f im m fil fim

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

There are four steps of NMGA :

1.

Discretization of the functional space

2.

The neighbourhood and the

recombination process

1.

Discretization of the functional

3.

Ranking the population

4.

Rank based population sizing

space :
.

In this algorithm a traditional genetic algorithm

population is mapped on to the functional space,

as demonstrated in Fig.
.For

a system of I objective functions, the index

of the grid can be designated through an integer

coordinate system (g1,g2, . . . ,gI), related to the
corresponding objective functions as,
27

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.

The neighbourhood and the

recombination process :
Once the entire population is mapped

on

to

the

neighbourhood
them.

functional

space,

is assigned to each of
The neighbourhood used in NMGA: (a)von-neumann (b) Moore

Genetic recombination is conducted in the neighbourhood by crossing over the central

member C with a random partner picked up from the shaded region.

28

Case : 2

3.
.

Ranking the population :

Once the genetic recombination and mutation gets over, all the dominated individuals in
the neighbourhood are deleted. The resulting population is then ranked, following either
the Goldberg or the Fonseca approach.

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.

is the number of individuals that dominate it.

Rank based population sizing :

To ensure that all types of members are present in the final set of

size S that the member specifies.

.

Permitted number of individuals in the final set is computed as,

29

N R NO e
Case : 2

Here, NR denotes the permitted number of individuals of rank R, NO is a constant

calculated using the value of S.

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 )

Summing the infinite series in geometric progression, the value of NO is calculated as

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

In order to accommodate them the original

function has been slightly modified and is
taken as,

31

NR

max N O e ,1 if N i S
R

i 1

otherwise

Case : 2

Flow chart of NMGA

mapping

Function space

Main population

Find Neighbours

For each member

Generations

Select a neighbour randomly

Perform crossover and mutation
Parents remain along with two
produced children

Population sizing
conducted using the rank
values
mapping
i
+

Main population
32

Delete dominated members after

ranking in the neighbourhood
Function space
Case : 2

The hot-rolling problem

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

large number of slabs, one almost immediately after the other.

Such slabs usually constitute different orders, and often vary significantly both in terms of

their physical dimensions and properties.

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

Therefore, an attempt to arrange the slabs in a perfect ascending or descending order of

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

the best possible compromises.

Finishing mill in a hot-rolling operation

34

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.

lower yield strength

2.

ultimate tensile strength

3.

the width varied widely

it was quite complicated to resolve an acceptable

Pareto front out of this data set.
35

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

ZDT2: Non-convex front

Case : 2

ZDT3: Disconnected fronts

ZDT4: Convex global front

ZDT 6: Non-convex front of non-uniform density

To ensure a very high accuracy, we ran

NMGA for this problem using a 1000 1000

grid in a Pentium IV machine under a
WINDOWS 98 environment.
37

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.

The success of NMGA in handling this industrial problem is of a twofold consequence.

Firstly, it demonstrates this algorithms ability to tackle a multi-objective problem of
high complexity.

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

The hot-rolling problem - Conclusion

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

terms of the quality of results and the number of function evaluations.

The performance of NMGA was quite comparable to an evolutionary Pareto solver.

NMGA is quite straightforward to encode, and could be easily used as a versatile solver

for any multi-objective problem in the materials domain.

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