An analysis of the behavior of simplified evolutionary algorithms on trap functions

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 1, 2003, Pages 11-22

  Nijssen, Siegfried ^a   Bäck, Thomas ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b NuTech Solutions GmbH   (Germany)

Author keywords

Absorption time; Convergence velocity; Evolutionary algorithm; Genetic algorithm; Mutation; Trap functions

Indexed keywords

FUNCTIONS; GLOBAL OPTIMIZATION; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING;

TRAP FUNCTIONS;

GENETIC ALGORITHMS;

EID: 0037297422     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2002.806169     Document Type: Article

References (18)

1. H.-G. Beyer and D. V. Arnold, "Theory of evolution strategies-A tutorial," in Theoretical Aspects of Evolutionary Computing, ser. Natural Computing Series, L. Kallel et al., Eds. Berlin, Germany: Springer-Verlag, 2001, pp. 109-133.
2. Th. Bäck, "The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm," in Parallel Problem Solving From Nature 2, R. Männer and B. Manderick, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 85-94.
3. _, "Optimal mutation rates in genetic search," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 2-8.
4. _, "Order statistics for convergence velocity analysis in simplified evolutionary algorithms," in Foundations of Genetic Algorithms 3, D. Whitley and M. Vose, Eds. San Mateo, CA: Morgan Kaufmann, 1995, pp. 91-102.
5. _, Evolutionary Algorithms in Theory and Practice. New York: Oxford Univ. Press, 1996.
6. H.-G. Beyer, The Theory of Evolution Strategies, ser. Natural Computing. Berlin, Germany: Springer, 2001.
7. K. Deb and D. E. Goldberg, "Analyzing deception in trap functions," in Foundations of Genetic Algorithms 2, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 93-108.
8. W. Dörfler, Mathematik für Informatiker. München, Germany: Carl Hanser, 1978, vol. 1.
9. A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, "Global convergence of genetic algorithms: An infinite Markov chain analysis," in Parallel Problem Solving From Nature-Proc. 1st Workshop PPSN 1. ser. Lecture Notes in Computer Science, H.-P. Schwefel and R. Männer, Eds. Berlin, Germany: Springer, 1991, vol. 496, pp. 4-12.
10. R. Galar, "Handicapped individual in evolutionary processes," Biol. Cybern., vol. 53, pp. 1-9, 1985.
11. _, "Evolutionary search with soft selection," Biol. Cybern., vol. 60, pp. 357-364, 1989.
12. T. Jansen and I. Wegener, "On the analysis of evolutionary algorithms-A proof that crossover really can help," in Proc. 7th Annu. Eur. Symp. Algorithms (ESA '99). ser. Lecture Notes in Computer Science, J. Nesetril, Ed. Berlin, Germany: Springer, 1999, vol. 1643, pp. 184-193.
13. L. Kallel, B. Naudts, and A. Rogers, Eds., Theoretical Aspects of Evolutionary Computing, ser. Natural Computing Series. Berlin, Germany: Springer-Verlag, 2001.
14. H. Mühlenbein, "How genetic algorithms really work: I. Mutation and hillclimbing," in Parallel Problem Solving From Nature 2, R. Männer and B. Manderick, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 15-25.
15. I. Rechenberg, Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart, Germany: Frommann-Holzboog, 1973.
16. A. Rogers and A. Prügel-Bennett, "A solvable model of a hard optimization problem," in Theoretical Aspects of Evolutionary Computing. ser. Natural Computing Series, L. Kallel, B. Naudts, and A. Rogers, Eds. Berlin, Germany: Springer-Verlag, 2001, pp. 207-221.
17. G. Rudolph, Covergence Properties of Evolutionary Algorithms. Hamburg, Germany: Verlag Dr. Kovač, 1997.
18. H.-P. Schwefel, "Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie," in Interdisciplinary Systems Research. Basel, Germany: Birkhäuser, 1977, vol. 26.