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

Lewis, Jonathan; Hart, Emma; Ritchie, Graeme

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.

Citation

Lewis, J., Hart, E., & Ritchie, G. (1998, September). A comparison of dominance mechanisms and simple mutation on non-stationary problems. Presented at 5th International Conference on Parallel Problem Solving from Nature PPSN 1998, Amsterdam

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 5th International Conference on Parallel Problem Solving from Nature PPSN 1998
• Start Date: Sep 27, 1998
• End Date: Sep 30, 1998
• Publication Date: 1998
• Deposit Date: Jul 23, 2010
• Publicly Available Date: Jul 23, 2010
• Publisher: Springer
• Peer Reviewed: Peer Reviewed
• Volume: 1498
• Pages: 139-148
• Series Title: Lecture Notes in Computer Science
• Series Number: 1498
• Series ISSN: 0302-9743
• Book Title: Parallel Problem Solving from Nature-PPSN V
• ISBN: 978-3-540-65078-2
• DOI: https://doi.org/10.1007/BFb0056857
• Keywords: genetic algorithms; diploid representations; fitness function; dominance change
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3222
• Contract Date: Jul 23, 2010