A common way to implement one operation in them is named for a roulette wheel, and a proof that one of these can efficiently solve the Two-Armed Bandit problem relies on the Schema Theorem.  Goldberg outlined the "simple" varieties of them, which contrast with the steady state type by replacing a generation at each iteration.  Their optimality can 
A common way to implement one operation in them is named for a roulette wheel, and a proof that one of these can efficiently solve the Two-Armed Bandit problem relies on the Schema Theorem.  Goldberg outlined the "simple" varieties of them, which contrast with the steady state type by replacing a generation at each iteration.  Their optimality can sort of be explained with the much-maligned Building Block Hypothesis.  They were first proposed by John Holland, and usually incorporate crossover and a fitness function to solve problems.  For 10 points, name this type of algorithm that makes use of factors like mutation and inheritance to solve problems in a biologic fashion.
A common way to implement one operation in them is named for a roulette wheel, and a proof that one of these can efficiently solve the Two-Armed Bandit problem relies on the Schema Theorem.  
Genetic Algorithms (prompt on "GA")