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.
Does constraining the search space of GA always help? / Manzoni, Luca; Mariot, Luca; Tuba, Eva. - ELETTRONICO. - (2019), pp. 151-152. ( Genetic and Evolutionary Computation Conference, GECCO 2019 Prague, Czech Republic July 13 - 17, 2019) [10.1145/3319619.3322027].
Does constraining the search space of GA always help?
Manzoni, Luca;
2019-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Gecco '19 Manzoni.pdf
Accesso chiuso
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
413.92 kB
Formato
Adobe PDF
|
413.92 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
