Editing Mutation (evolutionary algorithm) (section)

== Bit string mutation ==
The mutation of bit strings ensue through bit flips at random positions.

Example:
{|
|1 || 0 || 1 || 0 || 0 || 1 || 0
|-
| || || || || ↓ || || 
|- 
|1 || 0 || 1 || 0 || 1 || 1 || 0
|}

The probability of a mutation of a bit is <math>\frac{1}{l}</math>, where <math>l</math> is the length of the binary vector.<ref>{{Cite book |last1=Eshelman |first1=Larry J. |url=https://www.worldcat.org/oclc/45730387 |title=Evolutionary computation. Vol. 1, Basic algorithms and operators |publisher=CRC Press |year=1999 |isbn=0-585-30560-9 |editor-last=Bäck |editor-first=Thomas |location=Boca Racon |pages=68 |language=en |chapter=Mutation and Crossover |oclc=45730387 |editor-last2=Fogel |editor-first2=David B. |editor-last3=Michalewicz |editor-first3=Zbigniew}}</ref> Thus, a mutation rate of <math>1</math> per mutation and individual selected for mutation is reached.