Abstract
Genetic algorithms have been applied to a diverse field of problems with promising results. Using genetic algorithms modified to various degrees for tackling dynamic problems has attracted much attention in recent years. The main reason classical genetic algorithms do not perform well in such problems is that they converge and lose their genetic diversity. However, to be able to adapt to a change in the environment, diversity must be maintained in the gene pool of the population. One approach to the problem involves a diploid representation of individuals. Using this representation with a dynamic dominance map mechanism and meiotic cell division helps preserve diversity. In this paper, the effects of using diploidy and meiosis with such a dominance mechanism are explored. Experiments are carried out using a variation of the 0-1 knapsack problem as a testbed to determine the effects of the different aspects of the approach on population diversity and performance. The results obtained show promising enhancements.
Keywords
- Genetic Algorithm
- Knapsack Problem
- Generation Generation
- Simple Genetic Algorithm
- Genetic Algorithm Parameter
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beasley, D., Bull, D., Martin, R.: An Overview of Genetic Algorithms, Part 1: Fundamentals. University Computing. 15(2) (1993) 58–69
Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers. (2002)
Cobb, H. G.: An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent, Nonstationary Environments. Naval Research Laboratory Technical Report. AIC-90-001 (1990)
Collingwood, E., Corne, D., Ross, P.: Useful Diversity via Multiploidy. AISB Workshop on Evolutionary Computation. (1996)
Greene, F.: A Method for Utilizing Diploid/Dominance in Genetic Search. Proceedings of the First IEEE Conference on Evolutionary Computation. (1996)
Grefenstette, J. J.: Genetic Algorithms for Changing Environments. Parallel Problem Solving from Nature 2. North Holland. (1992) 137–144
Hadad, B. S., Eick, C. F. Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors. Proceedings of the Sixth International Conference on Evolutionary Programming of LNCS Springer Verlag. 1213 (1997)
Kim, Y., Kim, J. K., Lee, S., Cho, C., Hyung, L.: Winner Take All Strategy for a Diploid Genetic Algorithm. Proceedings of the First Asia-Pacific Conference on Simulated Evolution and Learning. (1996)
Lewis, J., Hart, E., Ritchie, G.: A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems. PPSN’98. 1498 (1998) 139–148
Ng, K. P., Wong, K. C.: A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization. Proceedings of the Sixth International Conference on Genetic Algorithms. (1995)
Ryan, C.: The Degree of Oneness. Proceedings of the 1994 ECAI Workshop on Genetic Algorithms, Springer Verlag. (1994)
Smith, R. E., Goldberg, D. E.: Diploidy and Dominance in Artificial Genetic Search. Complex Systems. 6 (1992) 251–285
Uyar, A. S., Harmanci, A. E.: Investigation of New Operators for a Diploid Genetic Algorithm. Proceedings of SPIE: Applications and Science of Neural Networks, Fuzzy Systems and Evolutionary Computation II. (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Etaner-Uyar, A.S., Harmanci, A.E. (2002). Preserving Diversity through Diploidy and Meiosis for Improved Genetic Algorithm Performance in Dynamic Environments. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive