On replacement strategies in steady state evolutionary algorithms

Evolutionary Computation

Volumn 15, Issue 1, 2007, Pages 29-59

  Smith, Jim ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

Replacement strategies; Selection; Steady State

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; EVOLUTION; GENETIC SELECTION; PROBABILITY;

ALGORITHMS; EVOLUTION; MARKOV CHAINS; MODELS, GENETIC; SELECTION (GENETICS);

EID: 34248139078     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2007.15.1.29     Document Type: Article

References (35)

1. Asoh, H. and Mühlenbein, H. (1994). On the mean convergence time of evolutionary algorithms without selection and mutation. In Davidor, Y., Schwefel, H.-P., and Männer, R., editors, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science, pages 88-97. Springer, Berlin.
2. Bäck, T. (1995). Generalised convergence models for tournament and (μ, λ) selection. In Eshelman, L., editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 2-8. Morgan Kaufmann, San Francisco.
3. Bäck, T., Fogel, D., and Michalewicz, Z., editors (1997). Handbook of Evolutionary Computation. Institute of Physics Publishing, Bristol, and Oxford University Press, New York.
4. Banzhaf, W. and Reeves, C., editors (1999). Foundations of Genetic Algorithms 5. Morgan Kaufmann, San Francisco.
5. Blickle, T. and Thiele, L. (1997). A comparison of selection schemes used in genetic algorithms. Evolutionary Computation, 4(4):261-294.
6. Chakraborty, U. (1995). An analysis of selection in generational and steady state genetic algorithms. In Proceedings of the National Conference on Molecular Electronics. NERIST (A.P.) India.
7. Chakraborty, U., Deb, K., and Chakraborty, M. (1997). Analysis of selection algorithms: A Markov Chain approach. Evolutionary Computation, 4(2):133-167.
8. De Jong, K. and Sarma, J. (1992). Generation gaps revisited. In (Whitley, 1993), pages 19-28.
9. Deb, K. and Goldberg, D. (1992). Analyzing deception in trap functions. In (Whitley, 1993), pages 93-108.
10. Forrest, S. and Mitchell, M. (1992). Relative building block fitness and the building block hypothesis. In (Whitley, 1993), pages 109-126.
11. Goldberg, D. (2002). The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Boston.
12. Goldberg, D. and Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In Rawlins, G., editor, Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann, San Francisco.
13. Goldberg, D. and Segrest, P. (1987). Finite Markov chain analysis of genetic algorithms. In Grefenstette, J., editor, Proceedings of the 2nd International Conference on Genetic Algorithms and Their Applications, pages 1-8. Lawrence Erlbaum, Hillsdale, New Jersey.
14. Mitchell, M., Forrest S., and Holland, J. (1992). The royal road for genetic algorithms: Fitness landscapes and ga performance. In Varela, F. and Bourgine, P., editors, Toward a Practice of Autonomous Systems: Proceedings of the 1st European Conference on Artificial Life, pages 245-254. MIT Press, Cambridge, MA.
15. Motoki, T. (2002). Calculating the expected loss of diversity of selection schemes. Evolutionary Computation, 10(4):397-422.
16. Nix, A. and Vose, M. (1992). Modelling genetic algorithms with Markov chains. Annals of Mathematics and Artifical Intelligence, pages 79-88.
17. Prügel-Bennet, A. and Shapiro, J. (1994). An analysis of genetic algorithms using statistical mechanics. Physical Review Letters, 72(9):1305-1309.
18. Radcliffe, N. (1991). Forma analysis and random respectful recombination. In Belew, R. and Booker, L., editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 222-229. Morgan Kaufmann, San Francisco.
19. Rogers, A. and Prügel-Bennett, A. (1999a). Genetic drift in genetic algorithm selection schemes. IEEE Transactions on Evolutionary Computation, 3(4):298-303.
20. Rogers, A. and Prügel-Bennett, A. (1999b). Modelling the dynamics of a steady-state genetic algorithm. In (Banzhaf and Reeves, 1999), pages 57-68.
21. Rudolph, G. (1999). The fundamental matrix of the general random walk with absorbing boundaries. Technical report, Collaborative Research Centre Computational Intelligence CI-75, University of Dortmund.
22. Rudolph, G. (2000). Takeover times and probabilities of non-generational selection rules. In Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., and Beyer, H.-G., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 903-910. Morgan Kaufmann, San Francisco.
23. Rudolph, G. (2001). Takeover times of noisy non-generational selection rules that undo extinction. In Kurková, V., Steele, N. C., Neruda, R., and Kárný, M., editors, Proceedings of International Conference on Neural Networks and Genetic Algorithms, ICAN-NGA 2001, pages 268-271. Springer, Berlin, Heidelberg, New York.
24. Smith, J. and Vavak, F. (1999a). Replacement strategies in steady state genetic algorithms: dynamic environments. Journal of Computing and Information Technology, 7(1):49-60.
25. Smith, J. and Vavak, F. (1999b). Replacement strategies in steady state genetic algorithms: static environments. In (Banzhaf and Reeves, 1999), pages 219-234.
26. Tamhane, A. (1979). A comparison of procedures for multiple comparisons of means with unequal variances. Journal of the American Statistical Association, 74:471-480.
27. Thierens, D. (1997). Selection schemes, elitist recombination and selection intensity. In Bäck, T., editor, Proceedings of the 7th International Conference on Genetic Algorithms, pages 152-159. Morgan Kaufmann, San Francisco.
28. Thierens, D. and Goldberg, D. (1993). Mixing in genetic algorithms. In Forrest, S., editor, Proceedings of the 5th International Conference on Genetic Algorithms, pages 38-45. Morgan Kaufmann, San Francisco.
29. van Nimwegen, E. and Crutchfield, J. (2001). Optimizing epochal evolutionary search: Population-size dependent theory. Machine Learning, 45(1):77-114.
30. van Nimwegen, E., Crutchfield, J., and Mitchell, M. (1999). Statistical dynamics of the Royal Road genetic algorithm. Theoretical Computer Science, 229:41-102.
31. Vavak, F. (1997). Genetic Algorithm Based Self-Adaptive Techniques for Direct Load Balancing in Nonstationary Environments. PhD thesis, University of the West of England.
32. Vose, M. (1999). The Simple Genetic Algorithm. MIT Press, Cambridge, MA.
33. Whitley, L., editor (1993). Foundations of Genetic Algorithms - 2. Morgan Kaufmann, San Francisco.
34. Whitley, L. and Kauth, J. (1988). Genitor: A different genetic algorithm. In Proceedings of the 3rd Annual Rocky Mountain Conference on AI, pages 118-130. Rocky Mountain Society for Artificial Intelligence.
35. Wright, A. and Zhou, Y. (1999). Markov models of genetic algorithms. In Banzhaf, W., Daida, J., Eiben, A., Garzon, M., Honavar, V., Jakiela, M., and Smith, R., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pages 734-741. Morgan Kaufmann, San Francisco.