On the design of diploid genetic algorithms for problem optimization in dynamic environments

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 1362-1369

  Yang, Shengxiang ^a,b  

^a IEEE   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DOMINANCE SCHEME; DYNAMIC ENVIRONMENTS; GENOTYPIC ALLELES; GENOTYPIC CARDINALITY;

GENES; OPTIMIZATION; PROBLEM SOLVING; UNCERTAINTY ANALYSIS;

GENETIC ALGORITHMS;

EID: 34547329358     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. J. Branke. Memory enhanced evolutionary algorithms for changing optimization problems. Proc. of the 1999 Congress on Evol. Comput., vol. 3, pp. 1875-1882, 1999.
2. J. Branke, T. Kaußler, C. Schmidth, and H. Schmeck. A multipopulation approach to dynamic optimization problems. Proc. of the Adaptive Computing in Design and Manufacturing, pp. 299-308, 2000.
3. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, 2002.
4. H. G. Cobb and J. J. Grefenstette. Genetic algorithms for tracking changing environments. Proc. of the 5th Int. Conf. on Genetic Algorithms, pp. 523-530, 1993.
5. E. Collingwood, D. Corne, and P. Ross. Useful diversity via multiploidy. Proc. of the 1996 Int. Conf. on Evol. Computing, 1996.
6. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hyperthesis. Foundations of Genetic Algorithms 2, 1993.
7. D. E. Goldberg and R. E. Smith. Nonstationary function optimization using genetic algorithms with dominance and diploidy. Proc. of the 2nd Int. Conf. on Genetic Algorithms, pp. 59-68, 1987.
8. J. J. Grefenstette. Genetic algorithms for changing environments. Parallel Problem Solving from Nature II, pp. 137-144, 1992.
9. B. S. Hadad and C. F. Eick. Supporting poliploidy in genetic algorithms using dominance vectors. Proc. of the 6th Int. Conf. on Evolutionary Programming, pp. 223-234, 1997.
10. D. L. Hartl and E. W. Jones. Genetics: Principles and Analysis. Jones and Bartllet Publishers, Inc., 1998.
11. J. H. Holland. Adaptation in Natural and Artificial Systems, Ann Arbor, University of Michigan Press, 1975.
12. R. B. Hollstien. Artificial Genetic Aadaptation in Computer Control Systems, Doctoral Dissertation, University of Michigan, 1971.
13. Y. Kim, J. K. Kim, S. Lee, C. Cho and L. Hyung. Winner take all strategy for a diploid genetic algorithm. Proc. of the 1st Asia-Pacific Conf. on Simulated Evolution and Learning, 1996.
14. E. H. J. Lewis and G. Ritchie. A. comparison of dominance mechanisms and simple mutation on non-stationary problems. Parallel Problem Solving from Nature V, pp. 139-148, 1998.
15. S. J. Louis and Z. Xu. Genetic algorithms for open shop scheduling and re-scheduling. Proc. of the 11th ISCA Int. Conf. on Computers and their Applications, pp. 99-102, 1996.
16. N. Mori, H. Kita and Y. Nishikawa. Adaptation to changing environments by means of the memory based thermodynamical genetic algorithm. Proc. of the 7th Int. Conf. on. Genetic Algorithms, pp. 299-306, 1997.
17. K. P. Ng and K. C. Wong. A new diploid scheme and dominance change mechanism, for non-stationary function optimisation. Proc. of the 6th Int. Conf. on Genetic Algorithms, 1995.
18. C. Ryan. The degree of oneness. Proc. of the 1994 ECAI Workshop on Genetic Algorithms, 1994.
19. A. Simões and E. Costa. An immune system-based genetic algorithm to deal with dynamic environments: diversity and memory. Proc. of the 6th Int. Conf. on Neural Networks and Genetic Algorithms, pp. 168-174, 2003.
20. K. Trojanowski and Z. Michalewicz. Searching for optima in nonstationary environments. Proc. of the 1999 Congress on Evol. Comput., pp. 1843-1850, 1999.
21. A. Ş. Uyar and A. E. Harmanci. Investigation of new operators for a diploid genetic algorithm. Proc. of SPIE: Applications and Science of Neural Netwroks, Fuzzy Systems and Evolutionary Computation II, 1999.
22. A. Ş. Uyar and A. E. Harmanci. A new population based adaptive dominance change mechanism for diploid genetic algorithms in dynamic environments. Soft Computing, vol. 9, no. 11, pp. 803-815, 2005.
23. S. Yang. Non-stationary problem optimization using the primal-dual genetic algorithm. Proc. of the 2003 Congress on Evol. Comput., vol. 3, pp. 2246-2253, 2003.
24. S. Yang. Memory-based immigrants for genetic algorithms in dynamic environments. Proc. of the 2005 Genetic and Evol. Comput. Conference, vol. 2, pp. 1115-1122, 2005.
25. S. Yang and X. Yao. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Computing, vol. 9, no. 11, pp. 815-834, 2005.