Modelling Finite Populations


Prügel-Bennett, A. (2003) Modelling Finite Populations. At Foundations of Genetic Algorithms 7, Morgan Kaufmann, 99-114.

Download

[img] Postscript
Download (585Kb)

Description/Abstract

It is common to model the dynamics of an evolutionary algorithm by considering a typical or representative population. We consider modelling a genetic algorithm using two different descriptions of this typical population. The first using cumulants describing the distribution of fitnesses, the second using the distribution itself. Empirically the cumulant description is found to give a much more accurate description of the evolution despite the fact that it gives a cruder description of the typical distribution. The reason for the success of the cumulant approach is because cumulants are self-averaging quantities. The meaning of this statement in this context is explored. The full distribution description is exact in the limit of an infinite population. It is shown that even in simple problems this limit is only approached for very large populations. Furthermore, the infinite population limit can give misleading predictions for the observable long time behaviour of an evolutionary algorithm.

Item Type: Conference or Workshop Item (Speech)
Additional Information: Event Dates: September 2002 Address: San Francisco
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science
Item ID: 259028
Date Deposited: 12 Mar 2004
Last Modified: 01 Mar 2012 10:58
Contributors: Prügel-Bennett, A. (Author)
de Jong, K. (Editor)
Poli, R. (Editor)
Rowe, J. E. (Editor)
Date: 2003
Additional Information: Event Dates: September 2002 Address: San Francisco
Status: Published
Publisher: Morgan Kaufmann
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259028

Actions (login required)

View Item View Item