There has been a lot of recent interest in so-called "steady state" genetic algorithms (GAs) which, among other things, replace only a few individuals (typically 1 or 2)...
The building-block hypothesis states that the GA works well when short, low-order, highly-fit schemas recombine to form even more highly fit higher-order schemas. The ability to p...
This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, a...
An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the differential of th...
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
While bit-based, order-based and real-valued genetic algorithms have been wellstudied in the literature, the xed-length subset representation has received relativelylittle attenti...
Kelly D. Crawford, Cory J. Hoelting, Roger L. Wain...