A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with Boolean inputs

Evolutionary Computation

Volumn 6, Issue 2, 1998, Pages 185-196

  Droste, Stefan ^a   Wegener, Ingo ^a   Jansen, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Complexity analysis; Evolutionary algorithm; Random walk; Separable function

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CROSSING OVER; MUTATION; SYSTEM ANALYSIS;

ALGORITHMS; CROSSING OVER, GENETIC; MODELS, GENETIC; MUTATION; PROBABILITY THEORY;

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

References (15)

1. 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 Mateo, CA: Morgan Kaufmann.
2. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. Cambridge, MA: MIT Press/New York, NY: McGraw-Hill.
3. Feller, W. (1968/1971). An introduction to probability theory and its applications. Volume I/II. New York, NY: Wiley.
4. Fogel, D. B. (1995). Evolutionary computation: Toward a new philosophy of machine intelligence. New York: IEEE Press.
5. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.
6. Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge, U.K.: Cambridge University Press.
7. Mühlenbein, H., & Schlierkamp-Voosen, D. (1993a). Predictive models for the breeder genetic algorithm I. Evolutionary Computation, 1, 25-50.
8. Mühlenbein, H., & Schlierkamp-Voosen, D. (1993b). The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1, 335-360.
9. Mühlenbein, H. (1992). How genetic algorithms really work. I. Mutation and hillclimbing. In R. Männer & R. Manderick (Eds.), Parallel problem solving from nature (PPSN II) (pp. 15-25). Amsterdam, The Netherlands: North-Holland.
10. Rechenberg, I. (1994). Evolutionsstrategie '94. Stuttgart: Frommann-Holzboog.
11. Rudolph, G. (1997). Convergence properties of evolutionary algorithms. Ph. D. thesis, Universitaet Dortmund, Dortmund, Germany. Hamburg, Germany: Verlag Dr. Kovač.
12. Salomon, R. (1996). Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. Bio Systems, 39, 263-278.
13. Schwefel, H.-P. (1995). Evolution and optimum seeking. New York, NY: Wiley.
14. Sedgewick, R. (1991). Algorithms. Reading, MA: Addison-Wesley.
15. van Leeuwen, J. (1990) (Ed.), Handbook of theoretical computer science. Amsterdam: Elsevier, Cambridge, MA: MIT Press.