新的基于混沌搜索的组优化算法.PDFVIP

第 31卷第 3期 计算机应用 Vo.l 31No. 3 2011年 3月 Journal of ComputerApp li ations M ar. 2011 : 100 1- 9081( 20 11) 03- 0657- 03 do:i 10. 3724 /SP. J. 1087. 2011. 00657 方振国, 陈得宝 (, 235000) ( fzg l750318@ sohu. om ) : 为提高组搜索优化( GSO)算法的性能, 结合混沌方法的全局搜索特性, 提出一种新的基 混沌搜索的组 搜索优化( CGSO)算法此方法中, 生产者利用混沌搜索方法不断寻找较好的位置; 占领者结合当前生产者的位置和 自己运动到目前为止的最好位置对自己当前的位置进行更新; 徘徊者采用混沌变异方法探索新的位置该算法运用 Logisti 映射的初值敏感性扩大搜索范围, 利用其全局遍历性进行位置搜索, 有效地提高了算法的全局收敛性采用 CGSOGSO算法对四个典型的函数优化问题进行了仿真实验, 仿真结果验证了方法的有效性 : Logisti 映射; 混沌优化; 组搜索优化; 混沌组搜索优化 : TP24; TP18 : A N ew group search optim izer algorithm based on chaotic search ing FANG Zhenguo, CHEN D ebao (School of Physics and E lectronic Inf ormation, HuaibeiN ormal University, H uaibeiAnhui 235000, China) A bstract: T o mi prove the performan e ofG roup Sear h Optmi izer (GSO), a new group sear h optmi izer algorithm based on Chaoti G roup Sear h Optmi izer ( CGSO) in om bination w ith the global sear h ing hara teristi of the haos m ethod w as proposed in the paper. In the m ethod, the good position of produ er w as updated by haoti sear h ing, the new pos ition of s roungerw as determ ined by the pos ition of produ er and the best position wh i h it had been a hieved so far, and the new position of rangers w as a h ieved by haoti m utation. The global onvergen t perform an e of GSO was mi proved by using the in itial sensitivity of the Logisti m ap to expand the s ope of the sear h and by em ploy ing the global ergod i ity to sear h the positions. Four fun tion optmi ization prob lem s were smi u lated by CGSO and GSO. The expermi en tal resu lts indi ate that CGSO is m o