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.
Preview
Unable to display preview. Download preview PDF.
References
Emma Collingwood, David Corne, and Peter Ross. Useful diversity via multiploidy. In Proceedings of International Conference on Evolutionary Computing, 1996.
David Corne, Emma Collingwood, and Peter Ross. Investigating multiploidy's niche. In Proceedings of AISB Workshop on Evolutionary Computing, 1996.
Jonathan Lewis. A comparative study of diploid and haploid binary genetic algorithms. Master's thesis, Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland, 1997.
Khim Peow Ng and Kok Cheong Wong. A new diploid sceme and dominance change mechanism for non-stationary function optimisation. In Proceedings of the Sixth International Conference on Genetic Algorithms, 1995.
Conor Ryan. The degree of oneness. In Proceedings of the ECAI workshop on Genetic Algorithms. Springer-Verlag, 1996.
Kukiko Yoshida and Nobue Adachi. A diploid genetic algorithm for preserving population diversity. In Parallel Problem Solving from Nature: PPSN III, pages 36–45. Springer Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewis, J., Hart, E., Ritchie, G. (1998). A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056857
Download citation
DOI: https://doi.org/10.1007/BFb0056857
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive