论文信息 - Stability of Vertex Fixed Points and Applications

Stability of Vertex Fixed Points and Applications

Abstract 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.

Alden H. Wright | Michael D. Vose | A. Wright | M. Vose

[1] Michael D. Vose,et al. The Genetic Algorithm Fractal , 1993, Evolutionary Computation.

[2] D. E. Goldberg,et al. Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[3] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .

[4] GUNAR E. LIEPINS,et al. Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..

[5] Alden H. Wright,et al. Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.

[6] I︠u︡. I. Li︠u︡bich,et al. Matrix norms and their applications , 1988 .

[7] Michael D. Vose,et al. Formalizing Genetic Algorithms , 1991 .

[8] Michael D. Vose,et al. Modeling Simple Genetic Algorithms , 1995, Evolutionary Computation.