Selection (genetic algorithm)
- Selection (genetic algorithm)
Selection is the stage of a genetic algorithm in which individual genomes are chosen from a population for later breeding (recombination or crossover).
There are several generic selection algorithms, such as tournament selection and fitness proportionate selection (also known as "roulette-wheel selection"). This last one can be implemented as follows:
#The fitness function is evaluated for each individual, providing fitness values, which are then normalized. Normalization means multiplying the fitness value of each individual by a fixed number, so that the sum of all fitness values equals 1.
#The population is sorted by descending fitness values.
#Accumulated normalized fitness values are computed (the accumulated fitness value of an individual is the sum of its own fitness value plus the fitness values of all the previous individuals). The accumulated fitness of the last individual should of course be 1 (otherwise something went wrong in the normalization step!).
#A random number "R" between 0 and 1 is chosen.
#The selected individual is the first one whose accumulated normalized value is greater than "R".
There are other selection algorithms that do not consider all individuals for selection, but only those with a fitness value that is higher than a given (arbitrary) constant. Other algorithms select from a restricted pool where only a certain percentage of the individuals are allowed, based on fitness value.
See the main article on genetic algorithms for more details.
External links
* [http://www.rennard.org/alife/english/gavintrgb.html Introduction to Genetic Algorithms]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Genetic algorithm in economics — Genetic algorithms are used to model the learning behaviour of economic agents. The term genetic algorithm is often abbreviated as GA. The genetic algorithm is a particular class of evolutionary algorithm inspired by evolutionary biology. A… … Wikipedia
Crossover (genetic algorithm) — In genetic algorithms, crossover is a genetic operator used to vary the programming of a chromosome or chromosomes from one generation to the next. It is analogous to reproduction and biological crossover, upon which genetic algorithms are based … Wikipedia
Human-based genetic algorithm — In evolutionary computation, a human based genetic algorithm (HBGA) is a genetic algorithm that allows humans to contribute innovative solutions to the evolutionary process. For this purpose, an HBGA has human interfaces for initialization,… … Wikipedia
Selection (disambiguation) — Selection may refer to:* Selection, in the context of biological evolution * in computer science ** Selection algorithm, an algorithm that finds the k th smallest number in a list ** Selection (genetic algorithm) ** Selection (relational algebra) … Wikipedia
Mutation (genetic algorithm) — In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next. It is analogous to biological mutation.Mutation alters one or more… … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia
Genetic memory — describes a variety of processes in biology and psychology by which genetic material confers a memory of an individual s or species past history. It can refer to the genetic code of DNA, epigenetic changes to the genetic material, the inheritance … Wikipedia
Genetic programming — In artificial intelligence, genetic programming (GP) is an evolutionary algorithm based methodology inspired by biological evolution to find computer programs that perform a user defined task. It is a specialization of genetic algorithms where… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
