GA: A Package for Genetic Algorithms in R

By Luca Scrucca. 2013

811 citations recorded by the source corpus.

Genetic algorithms (GAs) are stochastic search algorithms inspired by the basic principles of biological evolution and natural selection. GAs simulate the evolution of living organisms, where the fittest individuals dominate over the weaker ones, by mimicking the biological mechanisms of evolution, such as selection, crossover and mutation. GAs have been successfully applied to solve optimization problems, both for continuous (whether differentiable or not) and discrete functions. This paper describes the R package GA, a collection of general purpose functions that provide a flexible set of tools for applying a wide range of genetic algorithm methods. Several examples are discussed, ranging from mathematical functions in one and two dimensions known to be hard to optimize with standard derivative-based methods, to some selected statistical problems which require the optimization of user defined objective functions. (This paper contains animations that can be viewed using the Adobe Acrobat PDF viewer.)

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/88f19058827b8cbc358f661dfa95cd3ae019532f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Matthew Botvinick
  2. Yael Niv
  3. Martin Zaefferer
  4. Jörg Stork
  5. Thomas Bartz-Beielstein
  6. Alec Solway
  7. Carlos Diuk
  8. Andreas Fischbach

In Computational Theory and Mathematics

  1. Martin Zaefferer
  2. Jörg Stork
  3. Thomas Bartz-Beielstein
  4. Matthew Botvinick
  5. Yael Niv
  6. Andreas Fischbach
  7. W. Peterman
  8. Natalia Córdova

Citations in the corpus