UEI704: SOFT COMPUTING TECHNIQUES

Dr. Saurabh Bhardwaj

Selection
2
Roulette Wheel Selection
• Parents are selected according to their fitness. The better
the chromosomes are, the more chances of their
selection.

• In this selection a roulette wheel is taken where all

chromosomes are placed in population, every one has its
place big accordingly to its fitness function.

• Chromosome with bigger fitness will be selected more

times.
Roulette Wheel Selection
 Rank Selection
• In RW selection when fitnesses differs very much. Eg. if best
chromosome fitness is 90% of whole roulette wheel then other
chromosomes will have very few chances to be selected.

• Rank selection first ranks population and then every chromosome

receives fitness from this ranking.

• The worst will have fitness 1, second worst 2 etc. and the best will
have fitness N (number of chromosomes in population).

• This method can lead to slower convergence

Rank Selection
Elitism

• Elitism is name of method, which first copies the best

chromosome (or a few best chromosomes) to new
population. The rest is done in classical way. Elitism can
very rapidly increase performance of GA, because it
prevents losing the best found solution.
Encoding
8
 Binary Encoding

• Binary encoding is the most common, mainly because starting works

about GA used this type of encoding.

• In binary encoding every chromosome is a string of bits, 0 or 1.

Chromosome A 101100101100101011100101
Chromosome B 111111100000110000011111
Permutation Encoding
• Permutation encoding can be used in ordering problems,
such as travelling salesman problem or task ordering
problem.

• In permutation encoding, every chromosome is a string of

numbers, which represents number in a sequence.

Chromosome A 1  5  3  2  6  4  7  9  8
Chromosome B 8  5  6  7  2  3  1  4  9
Value Encoding
• Direct value encoding is used in problems, where some
complicated value, as real numbers, are used.

• In value encoding, every chromosome is a string of some

values.

Chromosome A 1.2324  5.3243  0.4556  2.3293  2.4545

Chromosome B ABDJEIFJDHDIERJFDLDFLFEGT
Tree Encoding
• Tree encoding is used mainly for evolving programs or
expressions.
• In tree encoding every chromosome is a tree of some
objects, such as functions or commands in programming
language.

Chromosome A

(+ x (/ 5 y))
Crossover for Permutation Encoding
Single point crossover - one crossover point is selected, till
this point the permutation is copied from the first parent,
then the second parent is scanned and if the number is not
yet in the offspring it is added
(1 2 3 4 5 6 7 8 9) + (4 5 3 6 8 9 7 2 1) = (1 2 3 4
5 6 8 9 7)

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)
Crossover for Tree Encoding
Tree crossover - in both parent one crossover point is
selected, parents are divided in that point and exchange part
below crossover point to produce new offspring
Soft Vs Hard
Computing
15
Hard Computing Vs Soft Computing
1) Hard computing, requires a precisely stated analytical
model. Soft computing differs from
hard computing in that, unlike hard computing, it is
tolerant of imprecision, uncertainty, partial truth, and
approximation.
Role model for soft computing is human mind.
2) Hard computing based on binary logic, crisp systems,
numerical analysis and crisp software.
soft computing based on fuzzy logic, neural nets and
probabilistic reasoning.
Hard Computing Vs Soft Computing
3) Hard computing has characteristics of precision and
categoricity and the soft computing, approximation and
dispositionality.
4) Hard computing requires programs to be written; soft
computing can evolve its own programs.
5) Hard computing is deterministic; soft computing
incorporates stochasticity
6) Hard computing requires exact input data; soft computing
can deal with ambiguous and noisy data
7) Hard computing is strictly sequential; soft computing
allows parallel computations
8) Hard computing produces precise answers; soft
computing can yield approximate answers
Initial Population
Evaluate Population
Probability Calculation
Probability Calculation