On the convergence rates of genetic algorithms

Theoretical Computer Science

Volumn 229, Issue 1-2, 1999, Pages 23-39

  He, Jun ^a   Kang, Lishan ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b WUHAN UNIVERSITY   (China)

Author keywords

Convergence rate; Genetic algorithms; Markov chain

Indexed keywords

EID: 0001891964     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00091-2     Document Type: Article

References (21)

1. K.B. Athreya, H. Doss, J. Sethuraman, On the convergence of the Markov chain simulation method, Ann. Statist. 24 (1996) 69-100.
2. T. Bäck, The interaction of mutation rate, selection and self-adaption within a genetic algorithm, in: R. Männer, B. Manderick (Eds.), Parallel Problem Solving from Nature vol. 2, North-Holland, Amsterdam, 1992, pp. 85-94.
3. L. Davis (Ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
4. J.L. Doob, Stochastic Processes, Wiley, New York, 1953.
5. A.E. Eiben, E.H.L. Aarts, K.M. Van Hee, Global convergence of genetic algorithm: a Markov chain analysis, in: H.-P Schwefel, R. Männer (Eds.), Parallel Problem Solving from Nature, Springer, Berlin, 1991, pp. 4-12.
6. S. Forrest (Ed.), Proc. 5th Internat. Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1993.
7. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
8. J. He, L. Kang, Y. Chen, Convergence of genetic evolution algorithms for optimization, Parallel Algorithms Appl. 5 (1995) 37-56.
9. J. He, Evolutionary computation from ecosystem, Doctoral dissertation, Department of Computer Science, Wuhan University, 1995.
10. J.H. Holland, Adaptation in Natural and Artificial System, MIT Press, Cambridge, MA, 1992.
11. R.B. Lund, R.L. Tweedie, Geometric convergence rates for stochastically ordered Markov chain, Math. Oper. Res. 21 (1996) 182-194.
12. K.L. Mengersen, R.L. Tweedie, Rates of convergence of the Hastings and Metropolis algorithms, Ann. Statist. 24 (1996) 101-121.
13. H. Mühlenbein, How genetic algorithms really works I: mutation and hill-climbing, in: R. Männer B. Manderick (Eds.), Parallel Problem Solving from Nature, vol. 2, North-Holland, Amsterdam, 1992, pp. 15-25.
14. G.O. Roberts, J.S. Rosenthal, Quantitative bounds for convergence rates of continuous time Markov processes, Electron. J. Probab. 1 (1996).
15. J.S. Rosenthal, Minorization conditions and convergence rates for Markov chain Monte Carlo, J. Amer. Statist. Assoc. 90 (1995) 558-566.
16. G. Rudolph, Convergence analysis of canonical genetic algorithms, IEEE Trans. Neural Networks 5 (1994) 96-101.
17. G. Rudolph, Convergence rates of evolutionary algorithms for a class of convex objective functions. Control and Cybernet. J. 26 (1997) 375-390.
18. G. Rudolph, Convergence Properties of Evolutionary Algorithms, Kovač, Hamburg, 1997.
19. R. Shi, Theory of the Markov Chain and its Application, Xian Dianzi Keji University Press, China, 1992.
20. J. Suzuki, A Markov chain analysis on simple genetic algorithms, IEEE Trans. Systems Man Cybernet. 25 (1995) 655-659.
21. J. Suzuki, A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy, IEEE Trans. Systems Man Cybernetics - Part B, 28 (1998) 95-102.