HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Application of a simple binary genetic algorithm to a noiseless testbed benchmark

Miguel Nicolau 1, 2
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasing the number of bits encoding each variable, until a desired resolution is possible to achieve. Good results and scaling are obtained for separable functions, but poor performance is achieved on the other functions, particularly ill-conditioned functions. Overall running times remain fast throughout.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00377093
Contributor : Miguel Nicolau Connect in order to contact the contributor
Submitted on : Monday, April 20, 2009 - 6:53:51 PM
Last modification on : Thursday, July 8, 2021 - 3:48:47 AM
Long-term archiving on: : Thursday, June 10, 2010 - 9:14:46 PM

File

sga.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00377093, version 1

Citation

Miguel Nicolau. Application of a simple binary genetic algorithm to a noiseless testbed benchmark. Genetic and Evolutionary Computation Conference (GECCO), Jul 2009, Montreal, Canada. ⟨inria-00377093⟩

Share

Metrics

Record views

60

Files downloads

494