期刊文献+

一种改进的小生境遗传算法 被引量:23

Improved niching genetic algorithm
在线阅读 下载PDF
导出
摘要 简单遗传算法(SGA)存在早熟收敛和后期收敛速度慢的弱点,基于小生境(niche)技术的改进遗传算法因其较好地保持了种群多样性,显示出更优的性能,但它存在操作复杂、比简单遗传算法更费时的缺陷,因此提出了一种基于自适应的小生境遗传算法。该算法在多模函数的优化中能够保持种群多样度的稳定性,获取合适的子种群规模,从而以更快的收敛速度获得更优的解。仿真结果表明该算法高效、可靠,易于实现。 Simple Genetic Algorithm (SGA) has the weaknesses of premature convergence and low speed of convergence in later stage then, the improved Genetic Algorithm based on Niche technique shows a better performance because it keeps the population diversity well, but it is more complex than SGA in operation and is more time consuming. This paper presents a new method based on self-adaptive, it can keep the population diversity stable and determine a suitable size of sub population in optimization of multimodal functions, so it can obtain more optimal solution at a much higher speed. The simulation experiment indicates that this new algorithm is efficient, reliable and easy to program.
作者 郏宣耀 王芳
出处 《重庆邮电学院学报(自然科学版)》 2005年第6期721-723,744,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
基金 浙江大学宁波理工学院青年创新基金资助项目(2004-11)
关键词 简单遗传算法 小生境 多模函数优化 早熟收敛 自适应 SGA niche multimodal function optimization premature convergence self-adaptive
作者简介 郏宣耀(1982-),男,浙江舟山人,研究方向为遗传算法、最优化理论。E-mail:yingzhou866@163.com
  • 相关文献

参考文献5

二级参考文献23

  • 1梁吉业,王俊红.基于概念格的规则产生集挖掘算法[J].计算机研究与发展,2004,41(8):1339-1344. 被引量:57
  • 2张宗炳.遗传与进化[M].北京:人民教育出版社,1981..
  • 3R Sikora, M J Shaw. A double-layered learning approach to acquiring rules for classification: Integrating genetic algorithms with similarity-based learning. ORSA Journal on Computing, 1994, 6(2): 174-187.
  • 4J Horm, D E Goldberg, K Deb. Implicit niching in a learning classifier system: Nature' s way. Evolutionary Computation, 1994, 2(1): 37-66.
  • 5D Beasley, D R Bull, R R Martin. A sequential niche technique for multimodal function optirniz.ation. Evolutionary Computation, 1993, 1(2): 101-125.
  • 6M Pelikan, D E Goldberg, E Cantfi-Paz. Hierarchical problem solving by the Bayesian optimization algorithm. University of Illinois at Urbana-Charnpaign, Illinois Genetic Algorithms Laboratory, Tech Rep: 2000002, 2000.
  • 7S W Mahfoud. Niching methods for genetic algorithms [ Ph D dissertation ] . University of Illinois at Urbana-Champaign, Urbana, IL, USA, 1995.
  • 8O J Mengshoel, D E Goldberg. Pmbabilistic crowding: Deterministic crowding with probabilistic replacement. In: W Banzha{ et al eds. Proc of the Genetic and Evolutionary Computation Conf 1999 (GECCO-99) . San Francisco, CA: Morgan Kaufmann, 1999. 409-416.
  • 9S W Mahfoud. Crowding and preselection revisited. In: R Manner, B Manderick eds. Parallel Problem Solving from Nature. Amsterdam, Netherlands: Elsevier Science, 1992. 27-36.
  • 10D E Goldberg, J J Richardson. Genetic algorithms with sharing for multirnodal function optimization. The 2nd Int'l Conf on Genetic Algorithms, Cambridge, MA, 1987.

共引文献116

同被引文献166

引证文献23

二级引证文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部