| Mutation (genetic Algorithm) |
Article Index for Mutation |
Website Links For Mutation |
Information AboutMutation (genetic Algorithm) |
|
The classic example of a mutation operator involves a probability that an arbitrary Bit in a Genetic Sequence will be changed from its original state. A common method of implementing the mutation operator involves generating a Random Variable for each bit in a sequence. This random variable tells whether or not a particular bit will be modified. The purpose of mutation in GAs is to allow the algorithm to avoid Local Minima by preventing the population of chromosomes from becoming too similar to each other, thus slowing or even stopping evolution. This reasoning also explains the fact that most GA systems avoid only taking the Fittest of the population in generating the next but rather a random (or semi-random) selection with a weighting toward those that are fitter. |
|
|