On the expected runtime and the success probability of evolutionary algorithms: (Invited presentation)

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

Volumn 1928, Issue , 2000, Pages 1-10

  Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; GRAPH THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION; PROBABILITY;

BLACK-BOX OPTIMIZATION; EXPECTED TIME; LINEAR FUNCTIONS; OPTIMAL SEARCH; PSEUDO-BOOLEAN; RANDOMIZED SEARCH HEURISTICS; RUNTIMES; SIMPLE METHOD;

EVOLUTIONARY ALGORITHMS;

EID: 84958776704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40064-8_1     Document Type: Conference Paper

References (20)

1. Bäck, T. (1993). Optimal mutation rates in genetic search. 5th Int. Conf. on Genetic Algorithms (ICGA), 2-8.
2. Bäck, T. (1998). An overview of parameter control methods by self-adaptation in evolutionary algorithms. Fundamenta Informaticae 34, 1-15.
3. Droste, S., Jansen, T., and Wegener, I. (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with boolean inputs. ICEC '98, 499-504.
4. Droste, S., Jansen, T., and Wegener, I. (2000). On the analysis of the (1 + 1) evolutionary algorithm. Submitted: Theoretical Computer Science.
5. Fogel, D. B. (1995). Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press.
6. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley.
7. Hagerup, T. and Rüb, C. (1989). A guided tour of Chernoff bounds. Information Processing Letters 33, 305-308.
8. Holland, J. H. (1975). Adaption in Natural and Artificial Systems. Univ. of Michigan.
9. Horn, J., Goldberg, D. E., and Deb, K. (1994). Long path problems. 3rd Int. Conf. on Parallel Problem Solving from Nature (PPSN), LNCS 866, 149-158.
10. Jansen, T. and Wegener, I. (1999). On the analysis of evolutionary algorithms - a proof that crossover really can help. ESA '99, LNCS 1643, 184-193.
11. Jansen, T. and Wegener, I. (2000). On the choice of the mutation probability for the (1 + 1) EA. Submitted: PPSN 2000.
12. Jerrum, T. and Sorkin, G. B. (1998). The Metropolis algorithm for graph bisection. Discrete Applied Mathematics 82, 155-175.
13. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge Univ. Press.
14. Mühlenbein, H. (1992). How genetic algorithms really work. I. Mutation and hillclimbing. 2nd Int. Conf. on Parallel Problem Solving from Nature (PPSN), 15-25.
15. Rabani, Y., Rabinovich, Y., and Sinclair, A. (1998). A computational view of population genetics. Random Structures and Algorithms 12, 314-334.
16. Rabinovich, Y., Sinclair, A., and Widgerson, A. (1992). Quadratical dynamical systems. 33rd FOCS, 304-313.
17. Rechenberg, I. (1994). Evolutionsstrategie '94. Frommann-Holzboog, Stuttgart.
18. Rudolph, G. (1997a). How mutations and selection solve long path problems in polynomial expected time. Evolutionary Computation 4, 195-205.
19. Rudolph, G. (1997b). Convergence Properties of Evolutionary Algorithms. Ph.D. Thesis. Dr. Kova_c, Hamburg.
20. Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Wiley.