改进遗传算法搜索性能的大变异操作*
The Big Mutation:An Operation to Improve the ormance ofGenetic Algorithms
摘要点击 702  全文点击 141  投稿时间:1996-05-06  修订日期:1997-05-27
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  1998,15(3):404-408
中文关键词  遗传算法  函数优化  大变异操作
英文关键词  genetic algorithms  function optimization  big mutation operation
基金项目  
学科分类代码  
作者单位
马钧水, 刘贵忠, 贾玉兰  
中文摘要
      遗传算法是一种模仿自然界生物进化过程中选择和遗传的机理而构造出的一种优化搜索算法. 但是,简单遗传算法的收敛速度较慢,稳定性较差,针对这些问题,本文提出了一种被称为“大变异”的改善遗传算法性能的操作,在文中分别讨论了该操作的思路,实现的方法,并给出了它的有效性的数值实验证明.
英文摘要
      With the increasingly wide applications of genetic algorithms(GAs) , its instinct drawback, the extraordinarily slow convergence, becomes the biggest obstacle of its further acceptation in many application Fields. To combat this problem, a kind of operation, named big mutation, is discussed in this paper. After giv-ng some explanation of the background and implementation of this operation, this paper provides the results of a numerical experiment to prove its efficiency and stability.