Intrinsic System Model of the Genetic Algorithm with α-Selection
Genetic algorithms are random heuristic search (RHS) algorithms which can be theoretically described with the help of a dynamical system model. This model characterises the stochastic trajectory of a population using a deterministic heuristic function and its fixed points. For practical problem sizes the determination of the fixed points is unfeasible even for the simple genetic algorithm (SGA). In this paper the novel intrinsic system model is introduced for the genetic algorithm with α-selection and the corresponding unique fixed point is determined. It is shown that this model is compatible with the equivalence relation imposed by schemata. In addition to the theoretical analysis experimental results are presented which confirm the theoretical predictions.
Unable to display preview. Download preview PDF.
- 1.Holland, J.H.: Adaptation in Natural and Artificial Systems, 1st edn. MIT Press, Cambridge (1992)Google Scholar
- 2.Neubauer, A.: Theory of the Simple Genetic Algorithm with α-Selection. In: Genetic and Evolutionary Computation Conference GECCO (to appear, 2008)Google Scholar
- 3.Reeves, C.R., Rowe, J.E.: Genetic Algorithms – Principles and Perspectives, A Guide to GA Theory. Kluwer Academic Publishers, Boston (2003)Google Scholar