Some comments on evolutionary algorithm theory

Evolutionary Computation

Volumn 4, Issue 4, 1996, Pages 405-415

  Salomon, Ralf ^a  

^a UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Evolutionary algorithm theory; Multimodal functions; Performance degradation; Search bias; Spherical symmetry

Indexed keywords

EID: 0006445234     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1996.4.4.405     Document Type: Article

References (17)

1. Altenberg, L. (1995). The schema theorem and the Price's theorem. In L. D. Whitley & M. D. Vose (Eds.), Foundations of gene tic algorithms 3 (pp. 23-49). San Mateo, CA: Morgan Kaufmann.
2. Bäck, T. (1993). Optimal mutation rates in genetic search. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 2-8). San Alateo, CA: Morgan Kaufmann.
3. Beyer, H.-G. (1993). Toward a theory of evolution strategies: Some asymptotical results from the (1 ± λ)-theory. Evolutionary Computation 1(2):165-188.
4. Beyer, H.-G. (1995). Toward a theory of evolution strategies: The (μ, λ)-theory. Evolutionary Computation 2(4):381-407.
5. Beyer, H.-G. (1996). Toward a theory of evolution strategies: Self-adaptation. Evolutionary Computation 3(1)311-347.
6. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
7. Grefenstette, J. J., & Baker, J. E. (1989). How genetic algorithms work: A critical look at implicit parallelism. In J. D. Schaffer (Ed.), Proceedings of the International Conference on Genetic Algorithms ICGA3 (pp. 20-27). San Alateo, CA: Alorgan Kaufmann.
8. Luenberger, D. G. (1984). Linear and nonlinear programming. Reading, MA: Addison-Wesley.
9. Mühlenbein, H., & Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm I. Evolutionary Computation 7(1):25-50.
10. Ostermeier, A., Gawelczyk, A., & Hansen, N. (1994). A derandomized approach to self-adaptation of evolution strategies. Evolutionary Computation 2(4):369-380.
11. Rechenberg, I. (1973). Evolutionsstrategie. Stuttgart: Frommann-Holzboog Verlag.
12. Salomon, R. (1996a). Performance degradation of genetic algorithms under coordinate rotation. In L. J. Fogel, P. J. Angeline, & T. Back (Eds.), Proceedings of the Fifth Annual Conference on Evolutionary Programming. Cambridge, MA: MIT Press.
13. Salomon, R.(1996b). Implicit independence assumptions: A notorious problem for genetic algorithms. In P. G. Anderson & K. Warwick (Eds.), Proceedings of the International ICSC Symposia on Intelligent Industrial Automation and on Soft Computing (SOCO'96) (pp. B 93-B 99). Canada/Switzerland: ICSC Academic Press.
14. Schlierkamp-Voosen, D., & Mühlenbein, H. (1994). Strategy adaptation by competing subpopulations. In Y. Davidor, H.-P. Schwefel, & R. Manner (Eds.), Parallel Problem Solving from Nature (PPSN 111) (pp. 199-208). Berlin: Springer-Verlag.
15. Schwefel, H. P. (1995). Evolution and optimum seeking. New York: John Wiley.
16. Srinivas, M., & Patnaik, L. (1994). Genetic algorithms: A survey. IEEE Computer 27(6), 17-26.
17. Vose, M. D. (1991). Generalizing the notion of schema in genetic algorithms. Artificial Intelligence 50, 385-396.