A new approach to estimating the expected first hitting time of evolutionary algorithms

Artificial Intelligence

Volumn 172, Issue 15, 2008, Pages 1809-1832

  Yu, Yang ^a   Zhou, Zhi Hua ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

Computational complexity; Convergence rate; Evolutionary algorithms; Expected first hitting time

Indexed keywords

BRIDGES; CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY;

COMPUTATIONAL TIME COMPLEXITY; CONVERGENCE RATE; CONVERGENCE RATES; EXPECTED FIRST HITTING TIME; GENERAL APPROACH; HARD PROBLEMS; HITTING TIME; MUTATION OPERATORS; NEW APPROACHES; PRACTICAL PROBLEMS; TIME-VARIANT;

EVOLUTIONARY ALGORITHMS;

EID: 50649124687     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.07.001     Document Type: Article

References (27)

1. Bäck T. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms (1996), Oxford University Press, Oxford, UK
2. Beyer H.-G., Schwefel H.-P., and Wegener I. How to analyse evolutionary algorithms. Theoretical Computer Science 287 1 (2002) 101-130
3. Chang S.-J., Hou H.-S., and Su Y.-K. Automated passive filter synthesis using a novel tree representation and genetic programming. IEEE Transactions on Evolutionary Computation 10 1 (2006) 93-100
4. Chang Y.-C., and Chen S.-M. A new query reweighting method for document retrieval based on genetic algorithms. IEEE Transactions on Evolutionary Computation 10 5 (2006) 617-622
5. S. Droste, T. Jansen, I. Wegener, On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm, in: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V), Amsterdam, Netherlands, 1998
6. Droste S., Jansen T., and Wegener I. A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with boolean inputs. Evolutionary Computation 6 2 (1998) 185-196
7. Droste S., Jansen T., and Wegener I. On the analysis of the (1 + 1) evolutionary algorithm. Theoretical Computer Science 276 1-2 (2002) 51-81
8. Eiben A.E., Hinterding R., and Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3 2 (1999) 124-141
9. Freitas A.A. A survey of evolutionary algorithms for data mining and knowledge discovery. In: Ghosh A., and Tsutsui S. (Eds). Advances in Evolutionary Computing: Theory and Applications (2003), Springer-Verlag, New York, NY 819-845
10. Garnier J., Kallel L., and Schoenauer M. Rigorous hitting times for binary mutations. Evolutionary Computation 7 2 (1999) 173-203
11. Hajek B. Hitting time and occupation time bounds implied by drift analysis with applications. Advances in Applied Probability 14 (1982) 502-525
12. He J., and Kang L. On the convergence rates of genetic algorithms. Theoretical Computer Science 229 1-2 (1999) 23-39
13. He J., and Yao X. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127 1 (2001) 57-85
14. He J., and Yao X. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence 145 1-2 (2003) 59-97
15. He J., and Yao X. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3 1 (2004) 21-35
16. He J., and Yu X. Conditions for the convergence of evolutionary algorithms. Journal of Systems Architecture 47 7 (2001) 601-612
17. Ma P.C.H., Chan K.C.C., Yao X., and Chiu D.K.Y. An evolutionary clustering algorithm for gene expression microarray data analysis. IEEE Transactions on Evolutionary Computation 10 3 (2006) 296-314
18. Nix A.E., and Vose M.D. Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5 1 (1992) 77-88
19. Oliveto P.S., He J., and Yao X. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing 4 3 (2007) 281-293
20. Rosenthal J.S. Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association 90 430 (1995) 558-566
21. Rudolph G. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5 1 (1994) 96-101
22. Rudolph G. How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation 4 2 (1996) 195-205
23. Rudolph G. Convergence Properties of Evolutionary Algorithms (1997), Verlag Dr. Kovač, Hamburg, Germany
24. Rudolph G. Finite Markov chain results in evolutionary computation: A tour d'horizon. Fundamenta Informaticae 35 1-4 (1998) 67-89
25. Suzuki J. A Markov chain analysis on simple genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics 25 4 (1995) 655-659
26. Wolpert D., and Macready W.G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1 1 (1997) 67-82
27. Y. Yu, Z.-H. Zhou, A new approach to estimating the expected first hitting time of evolutionary algorithms, in: Proceeding of the 21st National Conference on Artificial Intelligence, Boston, WA, 2006, pp. 555-560