Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational and Information Science

CIS 2006: Computational Intelligence and Security pp 209–219Cite as

About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space

  • Conference paper

  • 967 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4456))

Abstract

We consider some problems about the computation time of evolutionary algorithms in this paper. First, some exact analytic expressions of the mean first hitting times of general evolutionary algorithms in finite search spaces are obtained theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin’s Formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated rigorously under some mild conditions listed in the paper. Those results in this paper are commonly useful. Also, the analytic techniques adopted in the paper are widely instructive for analyzing the computation time of evolutionary algorithms in a given search space as long as some specific mathematical arts are introduced accordingly.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d’Horizon. Fundamenta Informaticae 35, 67–89 (1998)

    MathSciNet  MATH  Google Scholar 

  2. Eiben, A.E., Rudolph, G.: Theory of evolutionary algorithms: A bird’s eye view. Theoretical Computer Science 229, 3–9 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bäck, T.: The interaction of mutation rate, selection and self-adaption within a genetic algorithm. In: PPSN-II Conference Proceedings. pp. 85–94 (1992)

    Google Scholar 

  4. Mühlenbein, H.: How genetic algorithms really works I: Mutation and hill-climbing. In: PPSN-II Conference Proceedings. pp. 15–25 (1992)

    Google Scholar 

  5. Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Ph.D. Thesis, Verlag Dr. Kovac̆, Hamburg (1997)

    Google Scholar 

  6. Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation 7, 173–203 (1999)

    Article  Google Scholar 

  7. Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs. Evolutionary Computation 6, 185–196 (1998)

    Article  Google Scholar 

  8. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithms. Theoretical Computer Science 276, 51–81 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  10. Garnier, J., Kallel, L.: Statistical distribution of the convergence time of evolutionary algorithms for long path problems. IEEE Trans. on Evolutionary Computation 4, 16–30 (2000)

    Article  Google Scholar 

  11. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 57–85 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. on Evolutionary computation 6, 495–511 (2002)

    Article  Google Scholar 

  13. He, J., Yao, X.: Towards an analytic framework for analyzing the computation time of evolutionary algorithms. Artificial Intelligence 145, 59–97 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. He, J., Yao, X.: An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In: Proc. of CEC pp. 2004–2010 (2003)

    Google Scholar 

  15. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3, 21–35 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. He, J., Yao, X.: Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching. Journal of Computer science & Technology 19, 450–458 (2004)

    Article  MathSciNet  Google Scholar 

  17. Nix, A.E., Vose, M.D.: Modeling genetic algorithms with Markov chains. Ann. of Math. & Artificial Intelligence 5, 79–88 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Suzuki, J.: A Markov chain analysis on simple genetic algorithms. IEEE Trans. on Systems Man & Cybernetics 25, 655–659 (1995)

    Article  Google Scholar 

  19. Vose, M.D.: The Simple Genetic Algorithms: Foundations and Theory. MIT Press, Cambridge (1999)

    MATH  Google Scholar 

  20. Sasaki, G.H., Hajek, B.: The time complexity of maximum matching by simulated annealing. J. of the ACM 35, 387–403 (1988)

    Article  MathSciNet  Google Scholar 

  21. Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 3rd edn. Springer, New York (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Lab of Software Engineering, Wuhan University, Wuhan 430072, China

    Lixin Ding & Yingzhou Bi

  2. Department of Information Technology, Guangxi Teachers Education University, Nanning 530001, China

    Yingzhou Bi

Authors
  1. Lixin Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yingzhou Bi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Technology , Xidian University, 710071, Xi’an, China

    Yuping Wang

  2. Department of Computer Science , Hong Kong Baptist University, Hong Kong, China

    Yiu-ming Cheung

  3. Faculty of Applied Mathematics , Guangdong University of Technology, 5100006, Guangzhou, China

    Hailin Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, L., Bi, Y. (2007). About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74377-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74376-7

  • Online ISBN: 978-3-540-74377-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation