Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1830483.1830626 | GECCO |
Keywords | Field | DocType |
new genetic algorithm operator,main operator,genetic algorithm,new operator,well-known problem,swaps bit,genetic algorithms,linear regression,genetic operator | Genetic operator,Chromosome (genetic algorithm),Mathematical optimization,Crossover,Computer science,Algorithm,Artificial intelligence,Operator (computer programming),Genetic representation,Swap (finance),Machine learning,Genetic algorithm | Conference |
Citations | PageRank | References |
3 | 0.42 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aram Ter-Sarkisov | 1 | 5 | 2.86 |
| Stephen Marsland | 2 | 14 | 6.33 |
| Barbara R. Holland | 3 | 57 | 7.81 |