INTRODUCTION TO GENETIC ALGORITHMS

GROUP RAKESH CHAORSIA-090101134(1-7) SHUBHAM LOHAN-090101166(8-11) RAVIKANT BIHARI-090101136(1216)

GA CONCEPT

Genetic algorithm (GA) introduces the principle of evolution and genetics into search among possible solutions to given problem. This is done by the creation within a machine of a population of individuals represented by chromosomes, in essence a set of character strings, that are analogous to the DNA, that we have in our own chromosomes.

BASIC GENETIC ALGORITHM

Start with a large population of randomly generated attempted solutions to a problem Repeatedly do the following: Evaluate each of the attempted solutions Keep a subset of these solutions (the best ones) Use these solutions to generate a new population Quit when you have a satisfactory solution (or you run out of time)

ALGORITHMIC PHASES
Initialize population

Evaluate Fitness
Yes

Satisfy Constrai ns No

Modify Individuals

Select Survivors

Evaluate Fitness

CROSSOVER
Crossover is the similar to natural reproduction. Crossover combines genetic material from two parents, in order to produce superior offspring. Few types of crossover: One-point Multiple point.

CROSSOVER

E.g.

0 1 2 3 4 5 6 7 Parent 1

7 6 5 4 3 2 1 0 Parent 2
6 / 76

CROSSOVER

E.g.

0 1 5 3 4 5 6 7

7 6 2 4 3 2 1 0

7 / 76

MUTATION
Mutation introduces randomness into the population. Why Mutation

The idea of mutation is to reintroduce divergence into a converging population.

Mutation is performed on small part of population, in order to avoid entering unstable state. In order to ensure that the individuals are not all exactly the same, you allow for a small chance of mutation.

MUTATION

Parent

Child

FITNESS FUNCTION
Fitness Function is the evaluation function that is used to evaluated the solutions and find out the better solutions. Fitness of computed for each individual based on the fitness function and then determine what solutions are better than others. The fitness function is always problem dependent.

SELECTION
The selection operation copies a single individual, probabilistically selected based on fitness, into the next generation of the population. Certain selection methods rate the fitness of each solution and preferentially select the best solutions. Other methods rate only a random sample of the population, as this process may be very time-consuming. Several possible ways

Keep the strongest Keep some of the weaker solutions

SELECTION
SURVIVAL OF THE STRONGEST

Previous generation

0.93

0.51

0.72

0.31

0.12

0.64

Next generation 0.93 0.72 0.64

13 / 76

STOPPING CRITERIA
Final problem is to decide when to stop execution of algorithm. Two possible ways.

First

approach:

Stop after production of definite number of generations

Second

approach:

Stop when the improvement in average fitness over two generations is below a threshold

ADVANTAGES OF GA
Advantages: It can solve every optimization problem which can be described with the chromosome encoding. It solves problems with multiple solutions. Genetic algorithms are easily transferred to existing simulations and models. Genetic algorithm is a method which is very easy to understand and it practically does not demand the knowledge of mathematics.

DISADVANTAGES OF GA
Certain optimization problems (they are called variant problems) cannot be solved by means of genetic algorithms. This occurs due to poorly known fitness functions which generate bad chromosome blocks in spite of the fact that only good chromosome blocks cross-over. There is no absolute assurance that a genetic algorithm will find a global optimum. It happens very often when the populations have a lot of subjects.

THANK YOU!!!