引用本文:喻寿益, 郭观七.遗传算法的平均收敛速度及其估计[J].控制理论与应用,2003,20(3):467~469.[点击复制]
YU Shou-yi, GUO Guan-qi.Estimating average convergence velocity of genetic algorithms[J].Control Theory and Technology,2003,20(3):467~469.[点击复制]
遗传算法的平均收敛速度及其估计
Estimating average convergence velocity of genetic algorithms
摘要点击 1647  全文点击 1904  投稿时间:2001-10-15  修订日期:2002-04-05
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  2003,20(3):467-469
中文关键词  遗传算法  平均收敛速度  马尔可夫链
英文关键词  genetic algorithms  average convergence velocity  Markov chain
基金项目  国家自然科学基金(59835170, 50275170).
作者单位E-mail
喻寿益, 郭观七 中南大学 信息科学工程学院, 湖南 长沙 410083
湖南理工学院 机电工程系, 湖南 岳阳 414000 
s_yushouyi@sina.com 
中文摘要
      给出了独立于表示的变异算子和交叉算子的数学描述, 建立了遗传算法种群的精确马尔可夫链模型, 导出了种群中最佳个体的马尔可夫链及其随机矩阵, 将遗传算法的平均收敛速度定义为最佳个体转移至吸收态的平均吸收时间的数学期望, 提出了应用最佳个体的随机矩阵估计遗传算法平均收敛速度的理论方法和计算步骤.
英文摘要
      The description of mutation and crossover operators independent of representation of solutions is formulized. The precisely quantitative Markov chain model of populations of a genetic algorithm is presented. Based on this model, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness in populations is derived. The average convergence velocity of a genetic algorithm is defined as the mathematical expectation of the mean absorbing time that the best-so-far individual transfers to the absorbing state. The theoretic method and computing process of estimating the average convergence velocity of a genetic algorithm are proposed.