Some theoretical results about the computation time of evolutionary algorithms

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1409-1415

  Ding, Lixin ^a,b   Yu, Jinghu ^a,b  

^a WUHAN UNIVERSITY   (China)

^b Chinese Academy of Sciences   (China)

Author keywords

Computation time; Drift analysis; Dynkin's formula; Evolutionary algorithms

Indexed keywords

COMPUTATION THEORY; MARKOV PROCESSES;

COMPUTATION TIME; DRIFT ANALYSIS; DYNKIN'S FORMULA;

EVOLUTIONARY ALGORITHMS;

EID: 32444450373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068234     Document Type: Conference Paper

References (22)

1. G. Rudolph. Finite Markov chain results in evolutionary computation: A tour d'Horizon. Fundamenta Informaticae, 35(1-4):67-89, 1998.
2. A. E. Eiben and G. Rudolph. Theory of evolutionary algorithms: A bird's eye view. Theoretical Computer Science, 229(1-2):3-9, 1999.
3. T. Bäck. The interaction of mutation rate, selection and self-adaption within a genetic algorithm. In PPSN-II Conference Proceedings, pages 85-94. North-Holland, Amsterdam, 1992.
4. H. Mühlenbein. How genetic algorithms really works I: Mutation and hill-climbing. In PPSN-II Conference Proceedings, pages 15-25. North-Holland, Amsterdam, 1992.
5. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Ph.D. Thesis, Verlag Dr. Kovač, Hamburg, 1997.
6. J. Garnier, L. Kallel, and M. Schoenauer. Rigorous hitting times for binary mutations. Evolutionary Computation, 7(2):167-203, 1999.
7. S. Droste, T. Jansen, and I. Wegener. A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with Boolean inputs. Evolutionary Computation, 6(2):185-196, 1998.
8. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1 + 1) evolutionary algorithms. Theoretical Computer Science, 276(1-2):51-81, 2002.
9. G. Rudolph. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation, 4(2):194-205, 1996.
10. J. Garnier and L. Kallel. Statistical distribution of the convergence time of evolutionary algorithms for long path problems. IEEE Trans.on Evolutionary Computation, 4(1):16-30, 2000.
11. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57-85, 2001.
12. J. He and X. Yao. From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. on Evolutionary computation, 6(5):495-511, 2002.
13. J. He and X. Yao. Towards an analytic framework for analyzing the computation time of evolutionary algorithms. Artificial Intelligence, 145(1-2):59-97, 2003.
14. J. He and X. Yao. An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In CEC'03 Conference Proceedings, pages 2004-2010. IEEE Press, 2003.
15. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3:21-35, 2004.
16. J. He and X. Yao. Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching. Journal of Computer science & Technology, 19(4):450-458, 2004.
17. E. A. Nix and M. D. Vose. Modeling genetic algorithms with Markov chain. Ann. Math. Artificial Intelligence, 5:79-88, 1992.
18. J. Suzuki. A Markov chain analysis on simple genetic algorithms. IEEE Trans. on Systems Man & Cybernetics, 25:655-659, 1995.
19. M. D. Vose. The Simple Genetic Algorithms: Foundations and Theory. MIT Press, Cambridge, 1999.
20. G. H. Sasaki and B. Hajek. The time complexity of maximum matching by simulated annealing. J ACM, 35(2):387-403, 1988.
21. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability, (3rd ed.). Springer-Verlag, New York, 1996.
22. H. -G. Beyer. The Theory of Evolutionary Strategies. Springer-Verlag, Berlin, 2001.