The University of Southampton
University of Southampton Institutional Repository

Diversity maintenance on neutral landscapes: an argument for recombination

Diversity maintenance on neutral landscapes: an argument for recombination
Diversity maintenance on neutral landscapes: an argument for recombination
It has been demonstrated that several standard evolutionary computation test problems can be solved by a simple hill climbing search algorithm - often more efficiently than by a population based evolutionary algorithm. There remain some classes of problems, however, for which maintaining a genetically diverse population is essential in order to discover the optimal solution. In biological populations, diversity maintenance is important to enable populations to adapt to rapidly changing environments and to exploit environmental niches. We demonstrate that on a neutral landscape recombination allows a population to maintain a significantly greater level of genetic diversity through the transition between two fitness layers. Recombination may therefore have a role to play in maintaining population diversity across fitness transitions.
diversity, recombination, genetic algorithm, neutrality
0-7803-7282-4
211-213
IEEE Press
Geard, N
19c3888b-1e2d-4ee5-bcc6-d14c683d0be6
Wiles, J
4b566453-d3c4-441a-97bd-404c378d1f67
Fogel, D B
El-Sharkawi, M A
Yao, X
Greenwood, G
Iba, H
Marrow, P
Shackleton, M
Geard, N
19c3888b-1e2d-4ee5-bcc6-d14c683d0be6
Wiles, J
4b566453-d3c4-441a-97bd-404c378d1f67
Fogel, D B
El-Sharkawi, M A
Yao, X
Greenwood, G
Iba, H
Marrow, P
Shackleton, M

Geard, N and Wiles, J (2002) Diversity maintenance on neutral landscapes: an argument for recombination. Fogel, D B, El-Sharkawi, M A, Yao, X, Greenwood, G, Iba, H, Marrow, P and Shackleton, M (eds.) In Proceedings of the 2002 Congress on Evolutionary Computation. IEEE Press. pp. 211-213 .

Record type: Conference or Workshop Item (Paper)

Abstract

It has been demonstrated that several standard evolutionary computation test problems can be solved by a simple hill climbing search algorithm - often more efficiently than by a population based evolutionary algorithm. There remain some classes of problems, however, for which maintaining a genetically diverse population is essential in order to discover the optimal solution. In biological populations, diversity maintenance is important to enable populations to adapt to rapidly changing environments and to exploit environmental niches. We demonstrate that on a neutral landscape recombination allows a population to maintain a significantly greater level of genetic diversity through the transition between two fitness layers. Recombination may therefore have a role to play in maintaining population diversity across fitness transitions.

Text
cec2-div.pdf - Other
Download (49kB)

More information

Published date: 2002
Venue - Dates: Congress on Evolutionary Computation (CEC2002), Honolulu, Hawaii, 2002-01-01
Keywords: diversity, recombination, genetic algorithm, neutrality
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 264209
URI: http://eprints.soton.ac.uk/id/eprint/264209
ISBN: 0-7803-7282-4
PURE UUID: c1bbde18-dd8a-4c36-b613-81364dc45a79

Catalogue record

Date deposited: 19 Jun 2007
Last modified: 14 Mar 2024 07:44

Export record

Contributors

Author: N Geard
Author: J Wiles
Editor: D B Fogel
Editor: M A El-Sharkawi
Editor: X Yao
Editor: G Greenwood
Editor: H Iba
Editor: P Marrow
Editor: M Shackleton

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.

×