| Convergence Rate and Convergence of Genetic Algorithms |
| |
| 作者姓名： | LIU Feng LIU Guizhong ZHANG Zhuosheng |
| |
| 作者单位： | Institute for Information Engineering，School of Electronics and Information Engineering，Xi'an Jiaotong; University，Xi'an 710049，China |
| |
| 摘 要： | IntroductionTheanalysisfortheconvergencerateandconvergenceofthegeneticalgorithmsisveryimportanttounderstanditsproperties.Manyresultshavebeenmadeinthispield.A.E.Eib..1]hasprovedthataclassofabstractgeneticalgorithms(AGA's)convergewithprobabilityoneunderelitistselection.G.Rudolphl']hasstudiedtileasymptoticconvergenceofthecannonicalgeneticalgorithms(CGA's),buttheresultsdonotcoverthecaseofelitistselection.SomeotherimportanttheoreticalanalysesforGA'shavebeencontributedbyD.B.Foge'']andX.Qi'…
|
Convergence Rate and Convergence of GeneticAlgorithms |
| |
| LIU Feng, LIU Guizhong, ZHANG Zhuosheng.Convergence Rate and Convergence of Genetic Algorithms[J].Journal of Systems Science and Systems Engineering,1999(1). |
| |
| Authors: | LIU Feng LIU Guizhong ZHANG Zhuosheng |
| |
| Abstract: | This paper analyzes the convergence rate and convergence for a class of genetic algorithms(GA's) under elitist selection. The classification method about the state space is presented afterthe GA's are described as a Markov chain. It is proved by means of this method that the GA's have ageometric convergence rate. The final part shows that the best solution in the population converges tothe global optimum with probability one. |
| |
| Keywords: | genetic algorithm markov chain gonvergence convergence rate |
| 本文献已被 CNKI 等数据库收录！ |
