Escolar Documentos
Profissional Documentos
Cultura Documentos
Chromosome 1 0 1 1 0 1 0 0 1
Chromosome 2 1 0 1 0 0 1 1 1
Each bit /group of bits in the binary can represent some characteristic of the solution.
3.4.2 Reproduction
Reproduction is a first operator applied on a population. Reproduction selects good
strings according to their objective value in a population and forms a mating pool. For this cause
reproduction operator is known a selection operator. Reproduction makes a set of identical copies
of a given chromosome, where the number of copies depends on the chromosomes fitness. GA
uses the Roulette-wheel techniques to select chromosomes for reproduction. The way to
implement the selection scheme is to imagine a roulette wheel with its circumference marked for
each string proportionate to the string fitness. The roulette wheel is spun n times, each time
selecting an instance of the string chosen by the roulette-wheel pointer. Copying strings
according to their fitness values means that strings with a higher value have a higher probability
of contributing one or more offspring in the next generation. Roulette wheel selection will chose
third string more than any other string.
String Fitness
1 25.0
2 5.0
3 40.0
4 10.0
5 20.0
Reproduction :
0 0 1 0 1 1 1 0 0 0 1 0 1 1 1 0
5; 20% 1; 25%
4; 10% 2; 5%
3; 40%
0 1 1 0 1 0 0 1 0 1 1 0 1 1 1 1
1 0 1 0 0 1 1 1 1 0 1 0 0 0 0 1
An integer position k along the string length is selected uniformly at random between 1 and the
string length less one [1, L-1]. Two new strings are created by swapping all characters between
position (k+1) and L inclusively.
3.4.4 Mutation
While reproduction generally rewards high fitness and cross over generates new
chromosomes whose parts, at least, conform chromosome to relatively high fitness, mutation
seems necessary to prevent the loss of diversity at a given bit position. For example, were it not
for mutation, a population might evolve to a state where the first bit-position of each
chromosome contain the value 1 as above in cross-over, with there being no change of
reproduction or crossover ever replacing it with a 0. Mutation in the occasional and (with small
probability) random alteration of the value of a string position. In the binary coding, this simply
means choosing a 1 to 0 and vice-versa.
0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 0
3.5 GA parameters
There are two basic GA parameters.