The study on convergence and convergence rate of genetic algorithm based on an absorbing markov chain

Applied Mechanics and Materials

Volumn 239-240, Issue , 2013, Pages 1511-1515

  Jing, Jiang ^a   Meng, Lidong ^a   Xu, Xiumei ^a  

^a SHANDONG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Convergence; Convergence rate; Genetic algorithm; Markov chain

Indexed keywords

ABSORBING MARKOV CHAIN; CONVERGENCE; CONVERGENCE RATES; FIRST HITTING TIME; HITTING TIME; OPTIMIZATION EFFICIENCY; SUFFICIENT CONDITIONS;

MARKOV PROCESSES;

GENETIC ALGORITHMS;

EID: 84871915163     PISSN: 16609336     EISSN: 16627482     Source Type: Book Series    
DOI: 10.4028/www.scientific.net/AMM.239-240.1511     Document Type: Conference Paper

References (8)

1. He Shuyuan. Stochastic Process[M]. The Peking University Press, 2008
2. Wang Liyan, Shen Yubo, Liu Hong. Stochastic Process[M]. The Dalian University of Technology Press, 2008
3. Yu Y, Zhou Z H. A new approach to estimating the expected first hitting time of evolutionary algorithms. Proceedings of the 21st N ational Conference on Artificial Intelligence (AAAI 06). Boston, MA, California, USA, 2006: 555-572
4. Huang Han, Hao Zhifeng. Convergence rate of ant colony algorithm[J]. Chinese Journal of Computers, 2007, 30(8): 1344-1353.
5. Li Junhua, Li Ming. An analysis on convergence and convergence rate estimate of GA in noisy environments[J]. Chinese Journal of Electronics, 2011, 39(8): 1898-1902.
6. Lu wei, Huang Tianmin. An intuitive explanation of convergence of GA[J]. Journal of Mianyang Teachers College, 2002, 21(2): 22-23
7. Li Minqiang, Kou Jisong, Lin dan. Basic theories and applications of genetic algorithm[M]. Beijing: Science Press, 2002
8. T. Nakama. Theoretical analysis of genetic algorithms in noisy environments based on a Markov model[A]. Proceedings of the 2008 Genetic and Evolutionary Computation Conference. Atlanta, Georgia, USA: ACM, 2008,1001-1008.