Genetic algorithms

  • Authors:
  • Melanie Mitchell

  • Affiliations:
  • -

  • Venue:
  • Encyclopedia of Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic algorithms (GAs) are computational search, learning, optimization, and modeling methods, loosely inspired by biological evolution. Imitating the mechanisms of evolution has appealed to computer scientists from nearly the beginning of the computer age. Very roughly speaking, evolution can be viewed as searching in parallel among an enormous number of possibilities for "solutions" to the problem of survival in an environment where the solutions are particular designs for organisms. Viewed from a high level, the "rules" of evolution are remarkably simple: species evolve by means of heritable variation (via mutation, recombination, and other operators), followed by natural selection in which the fittest tend to survive and reproduce, thus propagating their genetic material to future generations. Yet these simple rules are thought to be responsible, in large part, for the extraordinary variety and complexity we see in the biosphere. Seen in this light, the mechanisms of evolution can inspire computational search methods for finding solutions to hard problems in large search spaces or for designing complex systems automatically.