A method to reuse old populations in genetic algorithms

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

Volumn 7026 LNAI, Issue , 2011, Pages 138-152

  Castelli, Mauro ^a   Manzoni, Luca ^a   Vanneschi, Leonardo ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; OLDER POPULATION; OPTIMIZATION ABILITY; POPULATION DIVERSITY; STEADY-STATE GA; TWO PARAMETER;

ARTIFICIAL INTELLIGENCE;

GENETIC ALGORITHMS;

EID: 80054824852     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24769-9_11     Document Type: Conference Paper

References (14)

1. Cao, Y., Luo, W.: Novel associative memory retrieving strategies for evolutionary algorithms in dynamic environments. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds.) ISICA 2009. LNCS, vol. 5821, pp. 258-268. Springer, Heidelberg (2009)
2. De Castro, L.N., Von Zuben, F.J.: The clonal selection algorithm with engineering applications. In: GECCO 2002 - Workshop Proceedings, pp. 36-37. Morgan Kaufmann (2002)
3. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)
4. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
5. Greensmith, J., Whitbrook, A.M., Aickelin, U.: Artificial immune systems (2010). Computing Research Repository (CoRR), abs/1006.4949 (2010), http://arxiv.org/abs/1006.4949
6. Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
7. Kauffman, S.A.: Adaptation on rugged fitness landscapes. In: Stein, D. (ed.) Lectures in the Sciences of Complexity, Redwood City. SFI Studies in the Sciences of Complexity, Lecture, vol. I, Addison-Wesley (1989)
8. Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theoret. Biol. 128(1), 11-45 (1987)
9. Louis, S., Li, G.: Augmenting genetic algorithms with memory to solve traveling salesman problems. In: Proceedings of the Joint Conference on Information Sciences, pp. 108-111. Duke University Press (1997)
10. Moore, D.S.: The Basic Practice of Statistics, 2nd edn. W. H. Freeman & Co., New York (1999)
11. Schaffer, J.D., Eshelman, L.J.: On crossover as an evolutionary viable strategy. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4th International Conference on Genetic Algorithms, pp. 61-68. Morgan Kaufmann, San Francisco (1991)
12. Sheppard, J., Salzberg, S.: Combining genetic algorithms with memory based reasoning. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 452-459. Morgan Kaufmann (1995)
13. Wiering, M.: Memory-based memetic algorithms. In: Nowe, A., Lenaerts, T., Steenhout, K. (eds.) Benelearn 2004: Proceedings of the Thirteenth Belgian-Dutch Conference on Machine Learning, pp. 191-198 (2004)
14. Yang, S.: Genetic algorithms with memory-and elitism-based immigrants in dynamic environments. Evol. Comput. 16, 385-416 (2008)