Name
Title | ||
|---|---|---|
Does constraining the search space of GA always help? - the case of balanced crossover operators. |
Abstract | ||
|---|---|---|
In this paper, we undertake an investigation on the effect of balanced and unbalanced crossover operators against the problem of finding non-linear balanced Boolean functions: we consider three different balanced crossover operators and compare their performances with classic one-point crossover. The statistical comparison shows that the use of balanced crossover operators gives GA a definite advantage over one-point crossover.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3319619.3322027 | GECCO |
Keywords | Field | DocType |
genetic algorithms, crossover operators, balanced bitstrings, Boolean functions, orthogonal arrays, bent functions | Boolean function,Mathematical optimization,Crossover,Computer science,Operator (computer programming),Genetic algorithm | Conference |
ISBN | Citations | PageRank |
978-1-4503-6748-6 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Manzoni | 1 | 488 | 55.19 |
| Luca Mariot | 2 | 47 | 11.35 |
| Milan Tuba | 3 | 178 | 19.69 |