Evolutionary algorithm
In artificial intelligence, an evolutionary algorithm (EA) is a subset of evolutionary computation, a generic population-based metaheuristic optimization algorithm. An EA uses mechanisms inspired by b...
Evolutionary algorithm - Wikipedia
Genetic algorithm
In the field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural selection. This heuristic (also sometimes called a metaheuristic) is routinel...
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. Essenti...
Genetic programming - Wikipedia
Interactive evolutionary computation
Interactive evolutionary computation (IEC) or aesthetic selection is a general term for methods of evolutionary computation that use human evaluation. Usually human evaluation is necessary when the fo...
Melomics
Melomics (derived from "genomics of melodies") is a computational system for the automatic composition of music (with no human intervention), based on bioinspired algorithms.
Melomics applies an e...
Melomics - Wikipedia
Fitness approximation
In function optimization, fitness approximation is a method for decreasing the number of fitness function evaluations to reach a target solution. It belongs to the general class of evolutionary comput...
Inheritance (genetic algorithm)
In genetic algorithms, inheritance is the ability of modeled objects to mate, mutate (similar to biological mutation), and propagate their problem solving genes to the next generation, in order to pro...
Evolutionary acquisition of neural topologies
This article is on evolutionary acquisition of artificial neural topologies, not of natural ones.Evolutionary acquisition of neural topologies (EANT/EANT2) is an evolutionary reinforcement learning me...
Evolved antenna
In radio communications, an evolved antenna is an antenna designed fully or substantially by an automatic computer design program that uses an evolutionary algorithm that mimics Darwinian evolution. ...
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 cross...
Crossover (genetic algorithm) - Wikipedia
Speciation (genetic algorithm)
Speciation is a process that occurs naturally in evolution and is modeled explicitly in some genetic algorithms. Speciation in nature occurs when two similar reproducing beings evolve to become too di...
Speciation (genetic algorithm) - Wikipedia
Santa Fe Trail problem
The Santa Fe Trail problem is a Genetic programming exercise in which Artificial Ants search for food pellets according to a programmed set of instructions. The layout of food pellets in the Santa Fe...
Santa Fe Trail problem - Wikipedia
Computer-automated design
Design Automation usually refers to electronic design automation. Extending Computer-Aided Design (CAD), automated design and Computer-Automated Design (CAutoD) are more concerned with a broader ran...
Computer-automated design - Wikipedia
Evolution window
It was observed in evolution strategies that significant progress toward the fitness/objective function's optimum, generally, can only happen in a narrow band of the mutation step size σ. That narrow ...
Neuroevolution of augmenting topologies
NeuroEvolution of Augmenting Topologies (NEAT) is a genetic algorithm for the generation of evolving artificial neural networks (a neuroevolution technique) developed by Ken Stanley in 2002 while at T...
IPO Underpricing Algorithms
IPO underpricing is the increase in stock value from the initial offering price to the first-day closing price. Many believe that underpriced IPOs leave money on the table for corporations, but some b...
Grammatical evolution
Grammatical evolution is a relatively new evolutionary computation technique pioneered by Conor Ryan, JJ Collins and Michael O'Neill in 1998 at the BDS Group in the University of Limerick.It is relate...
IPO underpricing algorithm
IPO underpricing is the increase in stock value from the initial offering price to the first-day closing price. Many believe that underpriced IPOs leave money on the table for corporations, but some b...
Truncation selection
Truncation selection is a selection method used in genetic algorithms to select potential candidate solutions for recombination. In truncation selection the candidate solutions are ordered by fitness,...
Cellular evolutionary algorithm
A Cellular Evolutionary Algorithm (cEA) is a kind of evolutionary algorithm (EA) in which individuals cannot mate arbitrarily, but every one interacts with its closer neighbors on which a basic EA is ...
Cellular evolutionary algorithm - Wikipedia
Evolutionary music
Evolutionary music is the audio counterpart to Evolutionary art, whereby algorithmic music is created using an evolutionary algorithm. The process begins with a population of individuals which by som...
Edge recombination operator
The edge recombination operator (ERO) is an operator that creates a path that is similar to a set of existing paths (parents) by looking at the edges rather than the vertices. The main application of ...
Schema (genetic algorithms)
A schema is a template in computer science used in the field of genetic algorithms that identifies a subset of strings with similarities at certain string positions. Schemata are a special case of cy...
Cuckoo search
Cuckoo search (CS) is an optimization algorithm developed by Xin-she Yang and Suash Debin 2009. It was inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nest...
Mutation (genetic algorithm)
Mutation is a genetic operator used to maintain genetic diversity from one generation of a population of genetic algorithm chromosomes to the next. It is analogous to biological mutation. Mutation alt...
Fitness proportionate selection
Fitness proportionate selection, also known as roulette wheel selection, is a genetic operator used in genetic algorithms for selecting potentially useful solutions for recombination.In fitness propor...
Fitness proportionate selection - Wikipedia
Promoter based genetic algorithm
The promoter based genetic algorithm (PBGA) is a genetic algorithm for neuroevolution developed by F. Bellas and R.J. Duro in the Integrated Group for Engineering Research (GII) at the University of C...
Promoter based genetic algorithm - Wikipedia
Gaussian adaptation
Gaussian adaptation (GA) (also referred to as normal or natural adaptation and sometimes abbreviated as NA) is an evolutionary algorithm designed for the maximization of manufacturing yield due to sta...
Gaussian adaptation - Wikipedia