Login
Home > Research > EPrints

On the Long String Limit

Prügel-Bennett, A (1999) On the Long String Limit. Foundations of Genetic Algorithms 5 Morgan Kaufmann, 45-56.

[file icon]Postscript
359Kb

Description/Abstract

To gain a clearer understanding of the dynamics of evolving populations the limit of infinitely long strings is examined. The limit clarifies some of the behaviour of evolving systems. For example, this limit removes any complications due to transient behaviour. Care is required in taking the limit to ensure that the quantities considered are meaningful. For concreteness a simple Genetic Algorithm acting on the problem of ones-counting is considered. A population evolving under selection and mutation alone is first examined. In this limit a remarkably simple picture of the evolutionary flow emerges. The discussion is widened to include crossover. This gives a new insight into how diversity induced by crossover improves search. Finally the approach to the limit is examined. The limit provides a way of separating the initial transient dynamics from the long time (asymptotic) dynamics.

Item Type:Conference or Workshop Item (UNSPECIFIED)
Additional Information: Address: San Francisco
Divisions:Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
ePrint ID:250479
Deposited On:25 Oct 2000
Last Modified:02 Mar 2012 12:57
Further Information:Google Scholar

Associated Staff Only: edit my ePrint