Fitness uniform deletion: A simple way to diversity

Shane Legg*, Marcus Hutter

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system's progress or even halt it completely if the population converges on a local optimum from which it cannot escape. In this paper we present the Fitness Uniform Deletion Scheme (FUDS), a simple but somewhat unconventional approach to this problem. Under FUDS the deletion operation is modified to only delete those individuals which are "common" in the sense that there exist many other individuals of similar fitness in the population. This makes it impossible for the population to collapse to a collection of highly related individuals with similar fitness. Our experimental results on a range of optimisation problems confirm this, in particular for deceptive optimisation problems the performance is significantly more robust to variation in the selection intensity.

Original languageEnglish
Title of host publicationGECCO 2005 - Genetic and Evolutionary Computation Conference
EditorsH.G. Beyer, U.M. O'Reilly, D. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, al et al
Pages1271-1278
Number of pages8
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventGECCO 2005 - Genetic and Evolutionary Computation Conference - Washington, D.C., United States
Duration: 25 Jun 200529 Jun 2005

Publication series

NameGECCO 2005 - Genetic and Evolutionary Computation Conference

Conference

ConferenceGECCO 2005 - Genetic and Evolutionary Computation Conference
Country/TerritoryUnited States
CityWashington, D.C.
Period25/06/0529/06/05

Fingerprint

Dive into the research topics of 'Fitness uniform deletion: A simple way to diversity'. Together they form a unique fingerprint.

Cite this