An analysis of the (ì+1) EA on simple pseudo-Boolean functions

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

Volumn 3102, Issue , 2004, Pages 761-773

  Witt, Carsten ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; EVOLUTIONARY ALGORITHMS; RANDOM PROCESSES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COMPLICATED FUNCTIONS; EVOLUTIONARY ALGORITHMS (EAS); LOWER BOUNDS; PSEUDO-BOOLEAN FUNCTION; RANDOM RECURSIVE TREE; RIGOROUS ANALYSIS; SEARCH SPACES; UPPER AND LOWER BOUNDS;

FORESTRY;

EID: 35048894861     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_77     Document Type: Article

References (16)

1. Droste, S., Jansen, T., Wegener, I: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
2. Droste, S., Jansen, T., Tinnefeld, K., Wegener, I.: A new framework for the valuation of algorithms for black-box optimization. In: Proc. of Foundations of Genetic Algorithms 7 (FOGA 2002), Morgan Kaufmann (2003) 253-270
3. Gamier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation 7 (1999) 173-203
4. Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: Proc. of the 2003 Congress on Evol. Computation, IEEE Press (2003) 1918-1925
5. He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation 6 (2002) 495-511
6. Jansen, T., De Jong, K.: An analysis of the role of offspring population size in EAs. In: Proc. of GECCO 2002. (2002) 238-246
7. Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation 5 (2001a) 589-599
8. Jansen, T., Wegener, I.: On the utility of populations. In: Proc. of GECCO 2001. (2001b) 1034-1041
9. Jansen, T., Wegener, I.: Real royal road functions - where crossover provably is essential. In: Proc. of GECCO 2001. (2001c) 375-382
10. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambr. Univ. Press (1995)
11. Pittel, B.: Note on the heights of random recursive trees and random m-ary search trees. Random Structures and Algorithms 5 (1994) 337-348
12. Rabani, Y., Rabinovich, Y., Sinclair, A.: A computational view of population genetics. Random Structures and Algorithms 12 (1998) 313-334
13. Smythe, R.T., Mahmoud, H.M.: A survey of recursive trees. Theory of Probability and Mathematical Statistics 51 (1995) 1-27
14. Storch, T., Wegener, I.: Real royal road functions for constant population size. In: Proc. of GECCO 2003. (2003) 1406-1417
15. Wegener, I., Witt, C.: On the optimization of monotone polynomials by the (1+1) EA and randomized local search. In: Proc. of GECCO 2003. (2003) 622-633
16. Witt, C.: Population size vs. runtime of a simple EA. In: Proc. of the 2003 Congress on Evol. Computation. Volume 3., IEEE Press (2003) 1996-2003