Preserving diversity through diploidy and meiosis for improved genetic algorithm performance in dynamic environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2457, Issue , 2002, Pages 314-323

  Etaner Uyar, A Sima ^a   Harmanci, A Emre ^a  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CELL PROLIFERATION; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; INFORMATION SYSTEMS; INFORMATION USE;

0-1 KNAPSACK PROBLEM; DIVERSE FIELDS; DYNAMIC ENVIRONMENTS; DYNAMIC PROBLEM; GENE POOLS; GENETIC DIVERSITY; MEIOTIC CELLS; POPULATION DIVERSITY;

DYNAMICS;

EID: 29544431648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36077-8_32     Document Type: Conference Paper

References (13)

1. Beasley, D., Bull, D., Martin, R.: An Overview of Genetic Algorithms, Part 1: Fundamentals. University Computing. 15(2) (1993) 58–69
2. Branke, J.: Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers. (2002)
3. 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)
4. Collingwood, E., Corne, D., Ross, P.: Useful Diversity via Multiploidy. AISBWorkshop on Evolutionary Computation. (1996)
5. Greene, F.: A Method for Utilizing Diploid/Dominance in Genetic Search. Proceedings of the First IEEE Conference on Evolutionary Computation. (1996)
6. Grefenstette, J. J.: Genetic Algorithms for Changing Environments. Parallel Problem Solving from Nature 2. North Holland. (1992) 137–144
7. 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)
8. 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)
9. Lewis, J., Hart, E., Ritchie, G.: A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems. PPSN’98. 1498 (1998) 139–148
10. 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)
11. Ryan, C.: The Degree of Oneness. Proceedings of the 1994 ECAI Workshop on Genetic Algorithms, Springer Verlag. (1994)
12. Smith, R. E., Goldberg, D. E.: Diploidy and Dominance in Artificial Genetic Search. Complex Systems. 6 (1992) 251–285
13. 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 2. (1999)