Bitwise Regularity Coefficients as a Tool for Deception Analysis of a Genetic Algorithm

Abstract : We present in this paper a theoretical analysis that relates an irregularity measure of a fitness function to the so-called GA-deception. This approach is a con­ti­nua­tion of a work that has presented a deception a­na­ly­sis of Hölder functions. The analysis developed here is a generalization of this work in two ways¸: we first use a «bitwise regularity» instead of a Hölder exponent as a basis for our deception analysis, second, we perform a similar deception analysis of a GA with uniform crossover. We finally propose to use the bitwise regularity coefficients in order to analyze the influence of a chromosome encoding on the GA efficiency, and present experiments with bits permutations and Gray encoding.
Type de document :
Rapport
[Research Report] RR-3274, INRIA. 1997
Liste complète des métadonnées

https://hal.inria.fr/inria-00073415
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:44:45
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:55:00

Fichiers

Identifiants

  • HAL Id : inria-00073415, version 1

Collections

Citation

Benoît Leblanc, Evelyne Lutton. Bitwise Regularity Coefficients as a Tool for Deception Analysis of a Genetic Algorithm. [Research Report] RR-3274, INRIA. 1997. 〈inria-00073415〉

Partager

Métriques

Consultations de la notice

94

Téléchargements de fichiers

304