Scribd
Upload
61 views7 pages

Genetic Algorithm: Search Space

A genetic algorithm is an optimization technique inspired by biological evolution. It starts with a population of potential solutions and iteratively improves the population's fitness by selecting the best individuals to reproduce and generate new offspring through crossover and mutation operations. This process of selection, crossover, and mutation is repeated over multiple generations until an optimal or satisfactory solution is found.

Uploaded by

LokendraSingh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views7 pages

Genetic Algorithm: Search Space

A genetic algorithm is an optimization technique inspired by biological evolution. It starts with a population of potential solutions and iteratively improves the population's fitness by selecting the best individuals to reproduce and generate new offspring through crossover and mutation operations. This process of selection, crossover, and mutation is repeated over multiple generations until an optimal or satisfactory solution is found.

Uploaded by

LokendraSingh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

GENETIC ALGORITHM

GAs first proposed by Holland [1975].


Based on analogies with the processes
of Biological Evolution.
GA seeks to improve the fitness of the
population generation after generation .

Search Space [space of all feasible solutions]

Example of a search space

Process
Algorithm is started with a
set of solutions (called population)

START

Fitness
[ Selection

New Population
Crossover

Mutation]

Accepting
[place new offspring in a new population]

STOP [if end condition


is satisfied]

Selection
How to select the best chromosomes?
1.Roulette Wheel Selection

Plotting of fitness function

2.Rank Selection
Situation before ranking (graph of fitnesses)

Situation after ranking (graph of order numbers)

SLOWER
CONVERG
ENCE

3.Tournament Selection
Random pairs are selected from a population of,
say n, individuals and their fitness values are
computed.
The fitness is compared and one of the two
models is accepted based on a probability Ps,
called the tournament selection number which is
an adjustable parameter.
Process is repeated until there are n models in
the offspring population.

3.Elitism
First copies the best chromosome ( or a few
best) to new population.
It prevents losing the best found solution.

Crossover

11001011+11011111 = 11001111

11001011 + 11011111 = 11011111

Mutation
Order changing - two numbers are selected
and exchanged
(1 2 3 4 5 6 8 9 7) => (1 8 3 4 5 6 2 9 7)

You might also like