Generic properties of the infinite population genetic algorithm

Thumbnail Image

Date

2006

Journal Title

Journal ISSN

Volume Title

Publisher

Montana State University - Bozeman, College of Letters & Science

Abstract

The infinite population model for the genetic algorithm, where the iteration of the genetic algorithm corresponds to an iteration of a map G, is a discrete dynamical system. The map G is a composition of a selection operator and a mixing operator, where the latter models the effects of both mutation and crossover. This dissertation examines the finiteness and hyperbolicity of fixed points of this model. For a typical mixing operator, the fixed point set of G is finite and all fixed points are hyperbolic.

Description

Keywords

Citation

Endorsement

Review

Supplemented By

Referenced By

Copyright (c) 2002-2022, LYRASIS. All rights reserved.