Skip to main content
SpringerLink
Log in

On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help

  • Conference paper
  • First Online:
Algorithms - ESA’ 99 (ESA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1643))

Included in the following conference series:

Abstract

There is a lot of experimental evidence that crossover is, for some functions, an essential operator of evolutionary algorithms. Nevertheless, it was an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved.

This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center “Computational Intelligence” (531).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baum, E. B., Boneh, D., and Garret, C.: On genetic algorithms. In Proceedings of the 8th Conference on Computational Learning Theory (COLT’ 95), (1995) 230–239.

    Google Scholar 

  2. Droste, S., Jansen, Th., and Wegener, 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).

    Google Scholar 

  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.

    Article  Google Scholar 

  4. Fogel, L. J., Owens, A. J., and Walsh, M. J.: Artificial Intelligence Through Simulated Evolutions. (1966) Wiley, NewYork.

    Google Scholar 

  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.

    Google Scholar 

  6. Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. (1989) AddisonWesley, Reading, Mass.

    MATH  Google Scholar 

  7. Holland, J. H.: Adaption in Natural and Artificial Systems. (1975) Univ. of Michigan.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. Jerrum, M. and Sorkin, G. B.: The Metropolis algorithm for graph bisection. Discrete Applied Mathematics 82 (1998) 155–175.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  12. van Laarhoven, P. J. M. and Aarts, E. H. L.: Simulated Annealing. Theory and Applications, (1987), Reidel, Dordrecht, The Netherlands.

    MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  16. Motwani, R. and Raghavan, P.: Randomized Algorithms. (1995) Cambridge University Press, Cambridge.

    MATH  Google Scholar 

  17. Rabani, Y., Rabinovich, Y., and Sinclair, A.: A computational view of population genetics. Random Structures and Algorithms 12(4) (1998) 314–334.

    Article  MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  20. Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4(2) (1997) 195–205.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  22. Schwefel, H.-P.: Evolution and Optimum Seeking. (1995) Wiley, New-York, NY.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS 2, Univ. Dortmund, 44221, Dortmund, Germany

    Thomas Jansen & Ingo Wegener

Authors
  1. Thomas Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ingo Wegener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics and DIMATIA Centre, Charles University, Malostranská nám. 25, CZ-11800, Prague 1, Czech Republic

    Jaroslav Nešetřil

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansen, T., Wegener, I. (1999). On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-48481-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66251-8

  • Online ISBN: 978-3-540-48481-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation