引用本文:恽为民,席裕庚.遗传算法的全局收敛性和计算效率分析*[J].控制理论与应用,1996,13(4):455~460.[点击复制]
YUN Weimin and XI Yugeng.The Analysis of Global Convergence and Computational Efficiency for Genetic Algorithm[J].Control Theory and Technology,1996,13(4):455~460.[点击复制]
遗传算法的全局收敛性和计算效率分析*
The Analysis of Global Convergence and Computational Efficiency for Genetic Algorithm
摘要点击 5996  全文点击 1057  投稿时间:1995-03-31  修订日期:1996-04-05
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  1996,13(4):455-460
中文关键词  全局收敛性  计算效率  简单遗传算法(SGA)  最优保存简单遗传算法(OMSGA) 自适应遗传算法(AGA)
英文关键词  global convergence  computational efficiency  simple genetic algorithm (SGA)  optimum maitaining SGA(OMSGA)  adaptive genetic algorithm (SGA)
基金项目  
作者单位
恽为民,席裕庚 上海交通大学自动化系 
中文摘要
      本文应用齐次有限马尔科夫链分析了简单遗传算法、最优保存简单遗传算法和自适应遗传算法的收敛性,然后对计算效率进行了定性分析,得到了指导基因操作策略设计的极限分布概率原则.
英文摘要
      In the paper,the global convergence of simple genetic algorithm (SGA),optimum maitaining SGA (OMSGA) and adaptive genetic algorithm is analyzed using homogeneous finite Markov chain and the computational efficiency is discussed. The limit distribution probabillity principle is obtained,which is useful to guide the design of gene operation schemes.