Schema processing under proportional selection in the presence ofrandom effects

Authors:
D. B. Fogel;A. Ghozeil
Affiliations:
Natural Selection Inc., La Jolla, CA;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
1997

Citing 0
Cited 6

Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover

Genetic Programming and Evolvable Machines
A Methodology for the Statistical Characterization of Genetic Algorithms

MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
General schema theory for genetic programming with subtree-swapping crossover: Part II

Evolutionary Computation
Hyperplane ranking, nonlinearity and the simple genetic algorithm

Information Sciences: an International Journal - Special issue: Evolutionary computation
Unearthing a Fossil from the History of Evolutionary Computation

Fundamenta Informaticae
Genetic algorithms: concepts, issues and a case study of grammar induction

Proceedings of the CUBE International Information Technology Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional selection in genetic algorithms has relied on reproduction in proportion to observed fitness. This method of selection devotes samples to the observed schemata in a form described by the well known schema theorem. When schema fitness takes the form of a random variable, however, the expected number of samples from extant schemata may not be described by the schema theorem and varies according to the specific random variables involved