The K-bit-swap
Aram Ter-Sarkisov, Stephen Marsland, Barbara R. Holland · 2010
Genetic algorithms (GA) mostly commonly use three main operators: selection, crossover and mutation, although many others have been proposed in the literature. This article introduces a new operator, k-bit-swap, which swaps bits between two strings without preserving the location of those bits, changing their order of bits in the string. It can be considered as a form of crossover. We investigate the effects of this operator and demonstrate that its use improves the speed and performance on several well-known problems.