Editing Mutation (evolutionary algorithm) (section)

=== Rotation to the right ===
The presentation of the procedure<ref name=":2" /> is illustrated by an example on the right:
{|
|''Procedure'' 
| &nbsp;&nbsp;
| ''Example''
|-
| * Let a permutation be given.
| &nbsp;&nbsp;
| <math>P_0 = \left( A,B,C,D,E,F,G \right)</math>
|-
| * Select a partial list, i.e. a start index <math>i</math> and an end index <math>j</math> in <math>P_0</math>, which are both natural numbers between 0 and <math>\left|P_0\right|-1</math>. Choose the number of positions <math>k</math> by which the partial list should be rotated, where <math>0 < k < |P_0|</math>. The start index can also be after the end index.  Then the partial list simply starts again from the beginning ([[Periodic boundary conditions|periodic boundary condition]]). This is necessary so that the permutation probability in the genome is the same everywhere and is not greater in the middle than at the edges.
| &nbsp;&nbsp;
| <math>i = 5</math>, <math>j = 1</math>, <math>k = 1</math>
|-
| * Copy <math>P_0</math> to <math>P_1</math> and rotate the partial list by <math>k</math> positions to the right.
| &nbsp;&nbsp;
| <math>P_1 = \left( \underline {G,A},C,D,E,\underline {B,F} \right)</math>
|-
| * <math>P_1</math> is then the mutated genome.
| &nbsp;&nbsp;
| <math>P_1 = \left( G,A,C,D,E,B,F \right)</math>
|}