comparison-based algorithms are robust and randomized algorithms are anytime. - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Evolutionary Computation Année : 2007

comparison-based algorithms are robust and randomized algorithms are anytime.

Résumé

Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good performance. The theoretical analysis of these algorithms usually focuses on convergence rates. This paper presents a mathematical study of randomized search heuristicswhich use comparison based selectionmechanism. The twomain results are: (i) comparison-based algorithms are the best algorithms for some robustness criteria, (ii) introducing randomness in the choice of offspring improves the anytime behavior of the algorithm. An original Estimation of Distribution Algorithm combining (i) and (ii) is proposed and successfully experimented.
Fichier principal
Vignette du fichier
lb2.pdf (312.51 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00173221 , version 1 (19-09-2007)

Identifiants

  • HAL Id : inria-00173221 , version 1

Citer

Sylvain Gelly, Sylvie Ruette, Olivier Teytaud. comparison-based algorithms are robust and randomized algorithms are anytime.. Evolutionary Computation, 2007. ⟨inria-00173221⟩
242 Consultations
211 Téléchargements

Partager

Gmail Facebook X LinkedIn More