Create custom mutation operator

[aarribas]

See: Exchange Mutation: The exchange mutation operator selects two cities of the tour randomly and simply exchanges them. In various publications the exchange mu- tation operator is also referred to as swap mutation, point mutation, reciprocal exchange, or order-based mutation [LKM+99]. • Insertion Mutation: The insertion mutation operator [Mic92] randomly chooses a city, re- moves it from the tour and inserts it at a randomly selected place. An alternative naming for insertion mutation is position-based mutation [LKM+ 99]. • Simple Inversion Mutation: The simple inversion mutation operator [Hol75], which is used in the TSP experiments of the book, randomly selects two cut points and sim- ply reverses the string between them. • Inversion Mutation: The inversion mutation operator [Fog93] randomly selects a subtour, removes it, and inserts it in reverse order at a randomly chosen position. An alternative naming for inversion mutation is cut-inversion mutation [LKM+ 99].

[aarribas]

Exchange mutation is implemented in deap via mutShuffleIndexes Insertion Mutation done Inversion Mutation done

[aarribas]

SimpleInversionMutation done

Hence we have all the mutations suggested in the book chapter 8 for TSP and path representation

[aarribas]

Pending to factorise the current functions and insert them in the current framework