On the analysis of evolutionary algorithms —a proof that crossover really can help

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

Volumn 1643, Issue , 1999, Pages 184-193

  Jansen, Thomas ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EXPERIMENTAL EVIDENCE;

EVOLUTIONARY ALGORITHMS;

EID: 84958045928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_17     Document Type: Conference Paper

References (22)

1. th Conference on Computational Learning Theory (COLT’95), (1995) 230–239.
2. Droste, S., Jansen, Th., andWegener, I.: On the Analysis of the (1+1) Evolutionary Algorithm. Tech. Report CI-21/98. Collaborative Research Center 531, Reihe Computational Intelligence, Univ. of Dortmund, Germany, (1998).
3. Droste, S., Jansen, Th., Wegener, I.: A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation 6(2) (1998) 185–196.
4. Fogel, L. J., Owens, A. J., and Walsh, M. J.: Artificial Intelligence Through Simulated Evolutions. (1966)Wiley, NewYork.
5. Forrest, S. and Mitchell, M.: Relative building block fitness and the building block hypothesis. In D. Whitley (Ed.): Foundations of Genetic Algorithms 2, (1993) 198–226, Morgan Kaufmann, San Mateo, CA.
6. Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. (1989) AddisonWesley, Reading, Mass.
7. Holland, J. H.: Adaption in Natural and Artificial Systems. (1975) Univ. of Michigan.
8. Horn, J., Goldberg, D. E., and Deb, K.: Long Path problems. In Y. Davidor, H.-P. Schwefel, and R.Männer (Eds.): Parallel Problem Solving from Nature (PPSN III), (1994) 149–158, Springer, Berlin, Germany.
9. Jerrum, M. and Sinclair, A.: The Markov Chain Monte Carlo method: An approach to approximate counting and integration. In D. S. Hochbaum (Ed.): Approximation Algorithms for NP-hard Problems. (1997) 482–520, PWS Publishers, Boston, MA.
10. Jerrum, M. and Sorkin, G. B.: The Metropolis algorithm for graph bisection. Discrete Applied Mathematics 82 (1998) 155–175.
11. Juels, A. and Wattenberg, M.: Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms, Tech. Report CSD-94-834, (1994), Univ. of California.
12. van Laarhoven, P. J. M. and Aarts, E. H. L.: Simulated Annealing. Theory and Applications, (1987), Reidel, Dordrecht, The Netherlands.
13. Mitchell, M. and Forrest, S.: Royal Road functions. In Th. Bäck, D. B. Fogel and Z. Michalewicz (Eds.): Handbook of Evolutionary Computation, (1997) B2.7:20–B2.7:25, Oxford University Press, Oxford UK.
14. Mitchell, M., Forrest, S., and Holland, J. H.: The Royal Road function for genetic algorithms: Fitness landscapes and GA performance. In F. J. Varela and P. Bourgine (Eds.): Proceedings of the First European Conference on Artificial Life, (1992) 245–254, MIT Press, Cambridge, MA.
15. Mitchell, M., Holland, J. H., and Forrest, S.: When will a genetic algorithm outperform hill climbing? In J. Cowan, G. Tesauro, and J. Alspector (Eds.): Advances in Neural Information Processing Systems, (1994), Morgan Kaufmann, San Francisco, CA.
16. Motwani, R. and Raghavan, P.: Randomized Algorithms. (1995) Cambridge University Press, Cambridge.
17. Rabani, Y., Rabinovich, Y., and Sinclair, A.: A computational view of population genetics. Random Structures and Algorithms 12(4) (1998) 314–334.
18. Rabinovich, Y., Sinclair, A., and Wigderson, A.: Quadratical dynamical systems (preliminary version). In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS’92), (1992) 304–313, IEEE Press Piscataway, NJ.
19. Ronald, S.: Duplicate genotypes in a genetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC’98), (1998) 793–798, IEEE Press Piscataway, NJ.
20. Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4(2) (1997) 195–205.
21. Sarma J. and De Jong, K.: Generation gap methods. In Th. Bäck, D. B. Fogel and Z. Michalewicz (Eds.): Handbook of Evolutionary Computation, (1997) C2.7, Oxford University Press, UK.
22. Schwefel, H.-P.: Evolution and Optimum Seeking. (1995) Wiley, New-York, NY.