Order statistics in artificial evolution - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Lecture Notes in Computer Science Année : 2003

Order statistics in artificial evolution

(1) , (2)
1
2

Résumé

This article deals with the exploitation of statistical information from extremes values of an evolutionary algorithm. One can use the fact that upper order statistics of a sample converge to known distributions for improving efficiency of selection and crossover operators. The work presented in this paper is restricted to criteria defined on real vector spaces. It relies on an underlying canonical model of genetic algorithm, namely tournament selection and uniform crossover. Nevertheless, the results obtained so far encourage further investigations.
Fichier principal
Vignette du fichier
Delahaye_AE2003_B.pdf (172.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01004107 , version 1 (04-07-2014)

Identifiants

Citer

Stéphane Puechmorel, Daniel Delahaye. Order statistics in artificial evolution. Lecture Notes in Computer Science, 2003, 2936, pp 51-62. ⟨10.1007/978-3-540-24621-3_5⟩. ⟨hal-01004107⟩
173 Consultations
186 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More