期刊文献+

一种结合微粒群算法的混合MIMIC算法 被引量:6

A Hybrid MIMIC Algorithm Combining With Hybrid Particle Algorithm
下载PDF
导出
摘要 分布估计算法是基于遗传算法的基础上发展起来的一种新型的优化算法,它采用的是概率图的模型来表示基因中变量之间的关系,从而构建优良解集的概率分布模型进行采样来实现迭代进化。但是分布估计算法在问题求解过程中容易陷入局部最优,针对此缺点,引入微粒群算法,提出了一种结合微粒群算法的分布估计算法。这种算法将分布估计算法与微粒群算法的思想紧密结合起来,不仅保持了种群的多样性,而且具有更全面的学习能力,提高了算法的寻优能力以及避免早熟收敛的能力。通过对测试函数的仿真试验,表明该算法具有良好的性能。 The estimation of distribution algorithm is developed on the basis of genetic algorithm; it is a kind of new optimization algorithm which uses probability graph model to express the relationship among variables to construct the gene so as to build excellent solution set of probability distribution model for sampling to realize iterative evolution. But the estimation of distribution algorithm easily falls into local optimum in the problem solving process. Aiming at this disadvantage,the particle swarm algorithm is proposed to estimate algorithm combined with the distribution of particle swarm optimization algorithm. The new algorithm combines the estimation of distribution algorithm with particle swarm algorithm,keeps the diversity of population,has more comprehensive learning ability and improves searching ability to avoid premature convergence. Through simulation test of test function,the algorithm is proved to have good performance.
出处 《太原科技大学学报》 2015年第5期406-410,共5页 Journal of Taiyuan University of Science and Technology
基金 山西省自然基金(2014011006-2)
关键词 分布估计算法 微粒群算法 MIMIC算法 estimation of distribution algorithms hybrid particle algorithm MIMIC algorithm
  • 相关文献

参考文献7

二级参考文献121

  • 1夏桂梅,曾建潮.微粒群算法的研究现状及发展趋势[J].山西师范大学学报(自然科学版),2005,19(1):23-25. 被引量:19
  • 2熊鹰,周树民,祁辉.一种新型的求解约束优化问题的微粒群算法[J].广东广播电视大学学报,2006,15(3):32-34. 被引量:2
  • 3周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 4粟塔山 彭维杰 周作益.最优化计算原理与算法程序设计[M].长沙:国防科学技术大学出版社,2002..
  • 5Shapiro J L. Drift and scaling in estimation of distribution algorithms. Evolutionary Computation, 2005, 13(1):99-123
  • 6Zhang Q, Miihlenbein H. On the convergence of a class of estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation, 2004, 8(2): 127-136
  • 7Zhang Q. On the convergence of a factorized distribution algorithm with truncation selection[Online], available: http://cswww.essex.ac.uk/staff/zhang/EDAWEB/,May 10, 2006
  • 8Zhang Q. On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Transactions on Evolutionary Computation, 2004, 8(1): 80-93
  • 9Rastegax R, Meybodi M Ft. A study on the global convergence time complexity of estimation of distribution algorithms. Lecture Notes in Computer Science, 2005, 3641:441-450
  • 10Gao Y, Culberson J. Space complexity of estimation of distribution algorithms. Evolutionary Computation, 2005,13(1): 125-143

共引文献213

同被引文献28

引证文献6

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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