Skip to content

Research at St Andrews

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

Research output: ResearchConference contribution

DOI

Author(s)

J Lewis, E Hart, G Ritchie

School/Research organisations

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.

Close

Details

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
StatePublished - 1998

Publication series

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

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Unikernel support for the deployment of light-weight, self-contained, and latency avoiding services

    Jaradat, W., Dearle, A. & Lewis, J. 21 Mar 2018 1 p.

    Research output: Research - peer-reviewAbstract

  2. Channel and active component abstractions for WSN programming: A language model with operating system support

    Harvey, P., Dearle, A., Lewis, J. P. & Sventek, J. 2012 SENSORNETS 2012 - Proceedings of the 1st International Conference on Sensor Networks. p. 35-44

    Research output: ResearchConference contribution

  3. Towards verifying correctness of wireless sensor network applications using Insense and Spin

    Sharma, O., Lewis, J. P., Miller, A., Dearle, A., Balasubramaniam, D., Morrison, R. & Sventek, J. 2009 Model Checking Software: 16th International SPIN Workshop, Grenoble, France, June 26-28, 2009, Proceedings. Pasareanu , C. S. (ed.). Springer, p. 223-240 18 p. (Lecture Notes in Computer Science; vol. 5578)

    Research output: ResearchConference contribution

  4. A component-based model and language for wireless sensor network applications

    Dearle, A., Balasubramaniam, D., Lewis, J. P. & Morrison, R. Jul 2008 32nd annual IEEE International Computer Software and Applications: COMPSAC 2008, 28 July-1 August 2008, Turku, Finland. IEEE Computer Society, p. 1303-1308 6 p. (IEEE COMPSAC)

    Research output: ResearchConference contribution

  5. Enabling nonholonomic smoothness generically allowing for unpredictable drift

    Weir, M. K., Lewis, J. P. & Bott, M. P. 2008 10th International Conference on Control, Automation, Robotics and Vision, 2008. ICARCV 2008. IEEE, p. 2072-2077 6 p.

    Research output: ResearchConference contribution

ID: 248684976