The University of Southampton
University of Southampton Institutional Repository

Modelling Genetic Algorithms and Evolving Populations

Modelling Genetic Algorithms and Evolving Populations
Modelling Genetic Algorithms and Evolving Populations
A formalism for modelling the dynamics of genetic algorithms using methods from statistical physics, originally due to Pr¨ugel-Bennett and Shapiro, is extended to ranking selection, a form of selection commonly used in the genetic algorithm community. The extension allows a reduction in the number of macroscopic variables required to model the mean behaviour of the genetic algorithm. This reduction allows a more qualitative understanding of the dynamics to be developed without sacrificing quantitative accuracy. The work is extended beyond modelling the dynamics of the genetic algorithm. A caricature of an optimisation problem with many local minima is considered — the basin with a barrier problem. The first passage time — the time required to escape the local minima to the global minimum — is calculated and insights gained as to how the genetic algorithm is searching the landscape. The interaction of the various genetic algorithm operators and how these interactions give rise to optimal parameters values is studied.
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc

Rogers, Alex (2000) Modelling Genetic Algorithms and Evolving Populations. University of Southampton, Electronics and Computer Science, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

A formalism for modelling the dynamics of genetic algorithms using methods from statistical physics, originally due to Pr¨ugel-Bennett and Shapiro, is extended to ranking selection, a form of selection commonly used in the genetic algorithm community. The extension allows a reduction in the number of macroscopic variables required to model the mean behaviour of the genetic algorithm. This reduction allows a more qualitative understanding of the dynamics to be developed without sacrificing quantitative accuracy. The work is extended beyond modelling the dynamics of the genetic algorithm. A caricature of an optimisation problem with many local minima is considered — the basin with a barrier problem. The first passage time — the time required to escape the local minima to the global minimum — is calculated and insights gained as to how the genetic algorithm is searching the landscape. The interaction of the various genetic algorithm operators and how these interactions give rise to optimal parameters values is studied.

PDF
Thesis.pdf - Other
Download (998kB)

More information

Published date: September 2000
Organisations: University of Southampton, Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 261289
URI: https://eprints.soton.ac.uk/id/eprint/261289
PURE UUID: 90b23d49-d928-44b3-9c78-a85c478aa856

Catalogue record

Date deposited: 03 Oct 2005
Last modified: 18 Jul 2017 09:03

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×