The University of Southampton
University of Southampton Institutional Repository

Genetic algorithm dynamics in two-well potentials with basins and barrier

Shapiro, Jonathan L. and Prügel-Bennett, Adam, (1997) Genetic algorithm dynamics in two-well potentials with basins and barrier Belew, R. K. and Vose, M. D. (eds.) At Foundations of Genetic Algorithms - 4. , pp. 101-116.

Record type: Conference or Workshop Item (Other)

Abstract

The dynamics of a simple genetic algorithm is analyzed on a simple two-well function of unitation. In the infinite population limit, there are phase transitions in the dynamics as the selections strength and crossover probability are changed. In one pahse, the system always evolves to a population consisting only of stirngs from the local well starting from any initial population constining some stirngs from the local well. In the second phase, the genetic algorithm can evolve to a population consisting of strings from the global well, but only if a finite fraction of the initial population was from the global well. In the third phase, the algorithm will evolve to a population consisting of stings from the global well from any initial popluation. For a finite population, the increasing correlation of the population changes the nature of the transition; this is analysed in a weak selection limit where the effects are small. Fluctuation effects, which cause the transition to be smooth in a finite population and are important, are not analyzed here. Comparison with simulations show tht the results are qualititatively correct. There is a phase in which the GA evolves quickly to the global minimum, which can be oredres of magnitude faster than a Monte Carlo algorithm; and another phase in which it evolves to a population dominated by strings from the local well. Quatitiatively, the simulations and theory are not in good agreement due to the simplifications of the theory.

Full text not available from this repository.

More information

Published date: September 1997
Additional Information: Address: San Francisco
Venue - Dates: Foundations of Genetic Algorithms - 4, 1997-09-01
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 254245
URI: http://eprints.soton.ac.uk/id/eprint/254245
ISBN: 1-55860-460-X
PURE UUID: 8197b5b5-b385-43b8-b6b7-4afa850a3dbc

Catalogue record

Date deposited: 12 Jan 2001
Last modified: 18 Jul 2017 09:53

Export record

Contributors

Author: Jonathan L. Shapiro
Author: Adam Prügel-Bennett
Editor: R. K. Belew
Editor: M. D. Vose

University divisions

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 http://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.

×