On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions

Journal of Discrete Algorithms

Volumn 3, Issue 1, 2005, Pages 61-78

  Wegener, Ingo ^a   Witt, Carsten ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

(1+1) EA; Boolean functions; Complexity analysis; Evolution strategies; Evolutionary algorithms; Quadratic functions

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

(1+1) EVOLUTIONARY ALGORITHMS; COMPLEXITY ANALYSIS; EVOLUTION STRATEGIES; QUADRATIC FUNCTIONS;

EVOLUTIONARY ALGORITHMS;

EID: 13544270839     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.02.001     Document Type: Article

References (19)

1. Ackley D. A Connectionist Machine for Genetic Hillclimbers. 1987;Kluwer Academic, Boston
2. Droste S., Jansen T., Wegener I. A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with boolean inputs. Proc. of WCCI '98: Int. Conference on Evolutionary Computation (ICEC '98). 1998;499-504
3. Droste S., Jansen T., Wegener I. A natural and simple function which is hard for all evolutionary algorithms. Proc. of 26th IEEE Conf. Industrial Electronics, Control and Instrumentation (IECON 2000). 2000;2704-2709
4. Droste S., Jansen T., Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theoret. Comput. Sci. 276:2002;51-81
5. Durand N., Alliot J.-M. Genetic crossover for partially separable functions. Koza J.R., Banzhaf W., Chellapilla K., Deb K., Dorigo M., Fogel D.B., Garzon M.H., Goldberg D.E., Iba H., Riolo R.L. Proc. of 3rd Genetic Programming Conference (GP '98). 1998;487-494 Morgan Kaufmann, San Mateo, CA
6. Fogel D.B. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. 1995;IEEE Press, Piscataway, NJ
7. Garnier J., Kallel L., Schoenauer M. Rigorous hitting times for binary mutations. Evolutionary Computation. 7:1999;173-203
8. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. 1989;Addison Wesley, Reading, MA
9. Holland J.H. Adaption in Natural and Artificial Systems. 1975;The University of Michigan Press, Ann Arbor, MI
10. Horn J., Goldberg D.E., Deb K. Long path problems. Davidor Y., Schwefel H.-P., Männer R. Proc. of 3rd Parallel Problem Solving from Nature (PPSN III). Lecture Notes in Comput. Sci. vol. 866:1994;149-158 Springer, Berlin
11. Jansen T., Wegener I. On the analysis of evolutionary algorithms - a proof that crossover really can help. Nešetřil J. Proc. of 7th Annual European Symposium on Algorithms (ESA '99). Lecture Notes in Comput. Sci. vol. 1643:1999;184-193 Springer, Berlin
12. Jansen T., Wegener I. Real royal road functions - functions where crossover provably is essential. Spector L., Goodman E.D., Wu A., Langdon W.B., Voigt H.-M., Gen M., Sen S., Dorigo M., Pezeshk S., Garzon M.H., Burke E. Proc. of 3rd Genetic and Evolutionary Computation Conference (GECCO 2001). 2001;375-382 Morgan Kaufmann, San Mateo, CA
13. Koza J.R. Genetic Programming: On the Programming of Computers by Natural Selection. 1992;MIT Press, Cambridge, MA
14. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press
15. Mühlenbein H. How genetic algorithms really work I. Mutation and hillclimbing. Männer R., Manderick B. Proc. of 2nd Parallel Problem Solving from Nature (PPSN II). 1992;15-25 Elsevier Science, Amsterdam
16. Rosenberg I.G. Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d'Etudes de Recherche Operationnelle. 17:1975;71-74
17. Rudolph G. How mutation and selection solve long-path problems in polynomial expected time. Evolutionary Computation. 4:1997;195-205
18. Schwefel H.-P. Evolution and Optimum Seeking. 1995;Wiley, New York
19. Whitley D., Mathias K., Rana S., Dzubera J. Evaluating evolutionary algorithms. Artificial Intelligence. 85:1996;245-276