Basic principles for understanding evolutionary algorithms

Fundamenta Informaticae

Volumn 55, Issue 3-4, 2003, Pages 387-403

  Weicker, Karsten ^a   Weicker, Nicole ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Evolutionary algorithm; Optimization; Schema theory; Theory; Working principles

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; HEURISTIC METHODS; OPTIMIZATION;

SCHEMA THEORY;

EVOLUTIONARY ALGORITHMS;

EID: 0141828974     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (45)

1. Altenberg, L.: The Schema Theorem and Price's Theorem, Foundations of Genetic Algorithms III (L. D. Whitley, M. D. Vose, Eds.), Morgan Kaufmann, San Francisco, CA, 1995.
2. Back, T.: Generalized Convergence Models for Tournament- and (μ, λ)-Selection, Proc. of the Sixth Int. Conf. on Genetic Algorithms (L. J. Eshelman, Ed.), Morgan Kaufmann, San Francisco, CA, 1995.
3. Bedau, M. A., Ronneburg, F., Zwick, M.: Dynamics of Diversity in an Evolving Population, Parallel problem solving from nature 2 (R. Männer, B. Manderick, Eds.), North-Holland, Amsterdam, 1992.
4. Beyer, H.-G.: Towards a Theory of Evolution Strategies: Results from the N-dependent (μ, λ) and the Multi-Recombinant (μ/μ, λ) Theory, Technical Report SYS-5/94, Systems Analysis Research Group, University of Dortmund, Dortmund, Germany, 1994.
5. Beyer, H.-G.: Toward a Theory of Evolution Strategies: On the Benefits of Sex - the (μ/μ, λ) Theory, Evolutionary Computation, 3(1), 1995, 81-111.
6. Beyer, H.-G.: An alternative explanation for the manner in which genetic algorithms operate, BioSystems, 41, 1997, 1-15.
7. Beyer, H.-G., Deb, K.: On the Desired Behaviors of Self-Adaptive Evolutionary Algorithms, Parallel Problem Solving from Nature - PPSN VI (M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, H.-P. Schwefel, Eds.), Springer, Berlin, 2000.
8. Blickle, T., Thiele, L.: A Comparison of Selection Schemes Used in Evolutionary Algorithms, Evolutionary Computation, 4(4), 1997, 361-394.
9. Culberson, J. C.: On the Futility of Blind Search: An Algorithmic View of "No Free Lunch", Evolutionary Computation, 6(2), 1998, 109-127.
10. Deb, K., Agrawal, S.: Understanding Interactions among Genetic Algorithm Parameters, in: Foundations of Genetic Algorithms 5 (W. Banzhaf, C. Reeves, Eds.), Morgan Kaufmann, San Francisco, CA, 1999, 265-286.
11. Eiben, A. E., Hinterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms, IEEE Trans. on Evolutionary Computation, 3(2), 1999, 124-141.
12. Eiben, A. E., Schippers, C. A.: On Evolutionary Exploration and Exploitation, Fundamenta Informaticae, 35, 1998, 35-50.
13. English, T. M.: Some Information Theoretic Results on Evolutionary Optimization, 1999 Congress on Evolutionary Computation, IEEE Service Center, Piscataway, NJ, 1999.
14. Fogel, D. B.: Evolutionary computation: toward a new philosophy of machine intelligence, IEEE Press, New York, 1995.
15. Fogel, D. B.: An Overview of Evolutionary Programming, in: Evolutionary Algorithms (L. D. Davis, K. De Jong, M. D. Vose, L. D. Whitley, Eds.), Springer, New York, 1999, 89-109.
16. Fogel, D. B., Atmar, J. W.: Comparing Genetic Operators with Gaussian Mutations in Simulated Evolutionary Processes Using Linear Systems, Biological Cybernetics, 63(2), 1990, 111-114.
17. Fogel, L. J., Owens, A. J., Walsh, M. J.: Artificial Intelligence Through simulated Evolution, John Wiley and Sons, New York, 1966.
18. Goldberg, D. E.: Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA, 1989.
19. Goldberg, D. E.: Zen and the Art of Genetic Algorithms, Proc. of the Third Int. Conf. on Genetic Algorithms (J. D. Schaffer, Ed.), Morgan Kaufmann, San Mateo, CA, 1989.
20. Goldberg, D. E., Richardson, J.: Genetic Algorithms with Sharing for Multimodal Function optimization, Genetic algorithms and their applications: Proc. of the Second Int. Conf. on Genetic Algorithms (J. J. Grefenstette, Ed.), Lawrence Erlbaum Assoc., Hillsdale, NJ, 1987.
21. Holland, J. H.: A new kind of turnpike theorem, Bulletin of the American Mathematical Society, 75(6), 1969, 1311-1317.
22. Holland, J. H.: Adaptation in Natural and Artifical Systems, University of Michigan Press, Ann Arbor, MI, 1975.
23. Holland, J. H.: Adaptation in Natural and Artifical Systems, MIT Press, Cambridge, MA, 1992.
24. Horn, J.: Resource-Based Fitness Sharing, Parallel Problem Solving from Nature - PPSN VII (J. J. Merelo Guervós, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, Eds.), Springer, Berlin, 2002.
25. Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search, Ph.D. Thesis, The University of New Mexico, Albuquerque, NM, 1995.
26. Mühlenbein, H., Schlierkamp-Voosen, D.: Predictive Models for the Breeder Genetic Algorithm: I. Continuous Parameter Optimization, Evolutionary Computation, 1(1), 1993, 25-49.
27. Poli, R.: Recursive Conditional Schema Theorem, Convergence and Population Sizing in Genetic Algorithms, in: Foundations of Genetic Algorithms 6 (W. N. Martin, W. M. Spears, Eds.), Morgan Kaufmann, San Francisco, 2001, 143-163.
28. Poli, R., McPhee, N. F.: Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the Study of the Evolution of Size, Genetic Programming: 4th European conference (J. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, W. B. Langdon, Eds.), Springer, Berlin, 2001.
29. Prügel-Bennett, A., Shapiro, J. L.: An Analysis of Genetic Algorithms Using Statistical Mechanics, Physical Review Letters, 72, 1994, 1305-1309.
30. Radcliffe, N. J.: Equivalence Class Analysis of Genetic Algorithms, Complex Systems, 5, 1991, 183-205.
31. Radcliffe, N. J., Surry, P. D.: Fitness variance of formae and performance prediction, Foundations of Genetic Algorithms III (L. D. Whitley, M. D. Vose, Eds.), Morgan Kaufmann, San Mateo, CA, 1995.
32. Rana, S., Whitley, L. D.: Search, Binary Representations and Counting Optima, in: Evolutionary Algorithms (L. D. Davis, K. De long, M. D. Vose, L. D. Whitley, Eds.), Springer, New York, 1999, 177-189.
33. Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, frommann-holzbog, Stuttgart, 1973, German.
34. Rudolph, G.: Convergence properties of evolutionary algorithms, Kovač, Hamburg, 1997.
35. [35] Rudolph, G.: Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon, Fundamenta Informaticae, 35, 1998, 67-89.
36. Sarma, J., De long, K.: Generation gap methods, in: Handbook of Evolutionary Computation (T. Bäck, D. B. Fogel, Z. Michalewicz, Eds.), Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997, C2.7:1-5.
37. Schumacher, C., Vose, M. D., Whitley, L. D.: The No Free Lunch and Problem Description Length, GECCO 2001: Proc. of the Genetic and Evolutionary Computation Conf. (L. Spector, E. D. Goodman, Eds.), Morgan Kaufmann, San Francisco, 2001.
38. Schwefel, H.-P.: Evolution and optimum seeking, Wiley, New York, 1995.
39. Smith, J. E., Vavak, F.: Replacement Strategies in Steady State Genetic Algorithms: Static Environments, in: Foundations of Genetic Algorithms 5 (W. Banzhaf, C. Reeves, Eds.), Morgan Kaufmann, San Francisco, CA, 1999, 219-233.
40. Spears, W. M.: Simple Subpopulation Schemes, Evolutionary Programming: Proc. of the Third Annual Conf. (A. V. Sebald, L. J. Fogel, Eds.), World Scientific Press, Singapore, 1994.
41. Stephens, C. R., Waelbroeck, H., Aguirre, R.: Schemata as Building Blocks: Does Size Matter?, in: Foundations of Genetic Algorithms 5 (W. Banzhaf, C. Reeves, Eds.), Morgan Kaufmann, San Francisco, CA, 1999, 117-133.
42. Weicker, K., Weicker, N.: Locality vs. Randomness - dependence of operator quality on the search state, in: Foundations of Genetic Algorithms 5 (W. Banzhaf, C. Reeves, Eds.), Morgan Kaufmann, San Francisco, CA, 1999, 147-163.
43. Weicker, K., Weicker, N.: Towards Qualitative Models of Interactions in Evolutionary Algorithms, in: Foundations of Genetic Algorithms VII (K. A. De Jong, R. Poli, J. E. Rowe, Eds.), Morgan Kaufmann, San Francisco, 2003, 365-382.
44. Weicker, N.: Qualitative No Free Lunch Aussagen für Evolutionäre Algorithmen, Cuvillier, Göttingen, 2001.
45. Wolpert, D. H., Macready, W. G.: No Free Lunch Theorems for Optimization, IEEE Trans. on Evolutionary Computation, 1(1), 1997, 67-82.