遗传算法的运行机理分析
The Analysis on Running Mechanism of Genetic Algorithm
摘要点击 958  全文点击 104  投稿时间:1993-12-15  修订日期:1995-03-30
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  1996,13(3):297-304
中文关键词  遗传算法  全局收敛性  搜索效率
英文关键词  Genetic algorithm  global optimum  searching efficiency
基金项目  
学科分类代码  
作者单位
恽为民,席裕庚 上海交通大学自动化系 
中文摘要
      遗传算法是一种自适应启发式群体型选代式全局搜索算法,正受到许多学科的重视.本文首先以函数优化为例分析了遗传算法的运行过程,然后着重探讨了遗传算法的全局收敛性和效率问题,提出了有效基因的新概念及有效基因突变操作,推导出每次遗传搜索产生O(2l-1)数量级的新模式,最后给出了结论.
英文摘要
      Genetic algorithm(GA) is a kind of adaptive,heuristic,probabilistic and iterated searching algorithm,which has attracted many subjects. The architecture and running process of genetic algorithm are analyzed first as the example of function optimization in the paper,then,the global optimum and seaching efficiency are studied. The new concept of effective gene and effective gene mutation are proposed. The new schema produced during one.genetic operation are derived as O(2n-1). Finally,the conclusion is given.