Lewis, Jonathan, Hart, Emma and Ritchie, Graeme (1998) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: Parallel Problem Solving from Nature-PPSN V. Lecture Notes in Computer Science, 1498/1 . Springer Berlin, pp. 139-148. ISBN 978-3-540-65078-2
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial.
Download (558kB) | Request a copy
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.
|Item Type:||Book Section|
|Uncontrolled Keywords:||genetic algorithms; diploid representations; fitness function; dominance change;|
|University Divisions/Research Centres:||Faculty of Engineering, Computing and Creative Industries > School of Computing|
|Dewey Decimal Subjects:||000 Computer science, information & general works > 000 Computer science, knowledge & systems > 006 Special Computer Methods > 006.3 Artificial intelligence|
|Library of Congress Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Depositing User:||Computing Research|
|Date Deposited:||23 Jul 2010 13:55|
|Last Modified:||12 Jan 2011 04:52|
Actions (login required)