一种混合的IWOPSO改进入侵性杂草优化算法  

A hybrid IWOPSO modified invasive weed optimization algorithm

作　　者：陶玲[1] 高晓智 

机构地区：[1]上海海事大学信息工程学院,上海201306 [2]芬兰阿尔托大学,芬兰赫尔辛基00076

出　　处：《微型机与应用》2014年第24期66-68,共3页Microcomputer & Its Applications

基　　金：芬兰科学院基金(135225)

摘　　要：为了提高入侵性杂草优化算法(IWO)在搜索深度上的不足,使算法在处理连续性问题时具有更好的全局收敛性,根据杂草算法在搜索上的广度和粒子群算法(PSO)在搜索上的深度,提出了一种改进的IWOPSO混合算法。该算法在子代扩散中以PSO算法中的位置、速度公式代替了杂草算法中的正态分布方式,引入一个随机数对新的子代个体进一步正态分布,提高了算法后期的局部搜索能力,使算法收敛到更好的全局最优解。利用5个benchmark函数测试算法的寻优能力,仿真结果表明,无论对于多峰还是单峰函数,低维还是高维函数,IWOPSO算法的收敛速度和最优解都要优于标准IWO和PSO算法。In order to improve the invasive weed optimization algorithm （IWO） deficiency in the search depth, and make the global convergence of the algorithm better in processing continuous problem, according to weed algorithm in search of the breadth and particle swam] optimization （PSO） in the search depth, this paper proposes an improved IWOPSO hybrid algorithm. In the progeny of diffusion, this algorithm insteads the normal distribution of weed with position and velocity formula of PSO algorithm, and a random number of offspring to normal distribution is introduced to enhance the local s.earehing ability of the later algorithm, and converge to the global optimal better solutions. This paper uses 5 benchmark function to test the searching capability of the algorithm. The simulation results show that, whether for muhimodal and unimodal function, low dimensional and high-dimensional function, the convergence speed of IWOPSO algorithm and the optimal solution is better than the standard IWO algorithm and PSO algorithm.

关 键 词：入侵性杂草优化 混合 正态分布 全局优化 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]