A comparison of dominance mechanisms and simple mutation on non-stationary problems

J Lewis, E Hart, G Ritchie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

112 Citations (Scopus)

Abstract

It is sometimes claimed that genetic algorithms using diploid representations will be more suitable for problems in which the environment changes from time to time, as the additional information stored, in the double chromosome will ensure diversity, which in turn allows the system to respond more quickly and robustly to a change in the fitness function. We have tested various diploid algorithms, with and without mechanisms for dominance change, on non-stationary problems, and conclude that some form of dominance change is essential, as a diploid encoding is not enough in itself to allow flexible response to change. Moreover, a haploid method which randomly mutates chromosomes whose fitness has fallen sharply also performs well on these problems.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature — PPSN V
PublisherSpringer
Pages139-148
Number of pages10
Volume1498
ISBN (Electronic)978-3-540-49672-4
ISBN (Print)978-3-540-65078-2
DOIs
Publication statusPublished - 1998

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'A comparison of dominance mechanisms and simple mutation on non-stationary problems'. Together they form a unique fingerprint.

Cite this