Stability of Vertex Fixed Points and Applications

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 the mapping which defines the transition from one generation to the next. Based on a simple formula for this spectrum, fully nondeceptive functions having exponentially many non-optimal fixed points are constructed.

• Type: Conference
• Year: 1994
• Where: FOGA
• Authors: Michael D. Vose, Alden H. Wright
• Keywords: FOGA 1994, FOGA 2007, Infinite Population, Non-optimal Fixed Points, Simple Genetic Algorithm