基于混沌序列的多种群入侵杂草算法  

Multi-population invasive weed optimization algorithm based on chaotic sequence

作　　者：陈欢[1] 周永权[1,2] 赵光伟[1] 

机构地区：[1]广西民族大学信息科学与工程学院,南宁530006 [2]广西混杂计算与集成电路设计分析重点实验室(广西民族大学),南宁530006

出　　处：《计算机应用》2012年第7期1958-1961,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61165015);智能感知与图像理解教育部重点实验室开放基金资助项目(IPIU012011001);广西民族大学研究生创新项目(gxun-chx2011078)

摘　　要：针对入侵杂草优化算法存在的早熟现象,提出一种基于混沌序列的多种群入侵杂草优化算法。首先,算法初始化时,利用混沌序列初始化种群提高初始解的质量;其次,在算法迭代过程中,若个体的聚集程度小于阈值时,再次用混沌序列重新初始化种群,使得算法迭代过程中能够有效地跳出局部极小;最后,将杂草种群分为5个种群协同合作,可有效地避免算法早熟现象,提高算法的寻优精度和收敛速度。通过对8个测试函数的测试,结果表明,所提算法获得最优值比基本入侵杂草优化算法精度提高了25%～300%;标准差提高了50%～100%。Concerning the premature convergence of invasive weed optimization algorithm,a new invasive weed optimization with multi-population based on chaotic sequence（CMIWO） was proposed.Firstly,chaotic sequence was adopted to initialize population at the initialization of algorithm,which improved the quality of the initial solution.Secondly,threshold was used to estimate the cluster degree of individuals in iterations and if cluster degree was less than threshold,initializing population with chaotic sequence was implemented again,thus the algorithm could effectively jump out of local minima.Thirdly,the weed population was divided into five groups to collaborate so as to discourage premature convergence,thus improving the algorithm＇s precision and increasing the convergence speed.In the end,the test results on eight test functions show that the proposed algorithm improves the accuracy by 25% to 300% than basic algorithm in terms of optimal value and 50% to 100% for standard deviation.

关 键 词：入侵杂草优化算法 混沌 多种群 测试函数 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]