We study an infinite population model for the genetic algorithm, where the iteration of the algorithm corresponds to an iteration of a map G. The map G is a composition of a selection operator and a mixing operator, where the latter models effects of both mutation and crossover. We examine the hyperbolicity of fixed points of this model. We show that for a typical mixing operator all the fixed points are hyperbolic. 1991 Mathematics Subject Classification. 37N99,68W40,68J05.
Hayes and Gedeon REF considered infinite population model for GA where the generation of the algorithm corresponds to a generation of a map.
Hyperbolicity of the fixed point set for the simple genetic algorithm
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science