Computer Exercise (Genetic Algorithms)

1. Given three binary chromosomes, a, b, and c, in a simple genetic algorithm as shown below: a: 0 1 0 0 1 0 0 0

b: 1 0 1 1 1 0 0 1 c: 1 1 0 1 0 0 1 0 (1) Calculate the fitness of each chromosome. The fitness of a chromosome is defined to be the sum of all its bits. For example, the fitness of 1 0 0 1 1 0 1 0 can be calculated as: fitness = 1 + 0 + 0 + 1 + 1 + 0 + 1 + 0 = 4 . (2) Draw the roulette wheel selection scheme based on the results in (1). (3) Demonstrate conceptually how the mutation and crossover operators work with the above chromosomes.
2.

Design a genetic algorithm to maximize the following nonlinear function:

f( x) = e
2 (ln 2 )( x 0.1 2 ) 0.8

sin(5x) ,

where x [ 1,1] . f(x) is illustrated in Fig. 1. Examine the effects of the mutation and crossover probabilities on the GA optimization performance.
1 0.9 0.8 0.7 0.6 f(x) 0.5 0.4 0.3 0.2 0.1 0 -1

-0.8

-0.6

-0.4

-0.2

0 x

0.2

0.4

0.6

0.8

Fig. 1. Plot of f( x) = e

2 (ln 2 )(

x 0.1 2 ) 0.8

sin(5x) .

Generalize your approach to more function optimization examples at: http://www-optima.amp.i.kyotou.ac.jp/member/student/hedar/Hedar_files/TestGO.htm