Associative memory scheme for genetic algorithms in dynamic environments

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

Volumn 3907 LNCS, Issue , 2006, Pages 788-799

  Yang, Shengxiang ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ASSOCIATIVE STORAGE; COMPUTER SCIENCE; OPTIMIZATION; PROBLEM SOLVING;

ASSOCIATIVE MEMORY; DYNAMIC ENVIRONMENTS; RE-EVALUATED MEMORY;

GENETIC ALGORITHMS;

EID: 33745823878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11732242_76     Document Type: Conference Paper

References (19)

1. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Report CMU-CS-94-163, Carnegie Mellon University, 1994.
2. J. Branke. Memory enhanced evolutionary algorithms for changing optimization problems. Proc. of the 1999 Congr. on Evol. Comput., vol. 3, pp. 1875-1882, 1999.
3. J. Branke, T. Kaußler, C. Schmidth, and H. Schmeck. A multi-population approach to dynamic optimization problems. Proc. of the Adaptive Computing in Design and Manufacturing, pp. 299-308, 2000.
4. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, 2002.
5. 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.
6. 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.
7. J. J. Grefenstette. Genetic algorithms for changing environments. Proc. of the 2nd Int. Conf. on Parallel Problem Solving from Nature, pp. 137-144, 1992.
8. A. Karaman, S. Uyar, and G. Eryigit. The memory indexing evolutionary algorithm for dynamic environments. EvoWorkshops 2005, LNCS 3449, pp. 563-573, 2005.
9. E. H. J. Lewis and G. Ritchie. A comparison of dominance mechanisms and simple mutation on non-stationary problems. Proc. of the 5th Int. Conf. on Parallel Problem Solving from Nature, pp. 139-148, 1998.
10. 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.
11. R. W. Morrison and K. A. De Jong. Triggered hypermutation revisited. Proc. of the 2000 Congress on Evol. Comput., pp. 1025-1032, 2000.
12. 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, 1997.
13. C. L. Ramsey and J. J. Greffenstette. Case-based initializtion of genetic algorithms. Proc. of the 5th Int. Conf. on Genetic Algorithms, 1993.
14. 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.
15. K. Trojanowski and Z. Míchalewicz. Searching for optima in non-stationary environments. Proc. of the 1999 Congress on Evol. Comput., pp. 1843-1850, 1999.
16. S. Yang. Non-stationary problem optimization using the primal-dual genetic algorithm. Proc. of the 2003 IEEE Congress on Evol. Comput., vol. 3, pp. 2246-2253, 2003.
17. S. Yang. Population-based incremental learning with memory scheme for changing environments. Proc. of the 2005 Genetic and Evol. Comput. Conference, vol. 1, pp. 711-718, 2005.
18. 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.
19. S. Yang and X. Yao. Population-based incremental learning with associative memory for dynamic environments. Submitted to IEEE Trans. on Evol. Comput., 2005.