基于混沌局部搜索算子的人工蜂群算法

《基于混沌局部搜索算子的人工蜂群算法》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)。

1、基于混沌局部搜索算子的人工蜂群算法摘要:在求解函數(shù)優(yōu)化問(wèn)題時(shí)，為了提升人工蜂群算法局部搜索能力，提出了一種新穎的混沌蜂群算法。新算法設(shè)計(jì)了一種混沌局部搜索算子，并將其嵌入蜂群算法框架中；該算子不僅能夠?qū)崿F(xiàn)在最優(yōu)食物源周?chē)植克阉?，還能夠隨著進(jìn)化代數(shù)增加使搜索范圍不斷縮小。仿真實(shí)驗(yàn)結(jié)果表明,與人工蜂群算法相比，新算法在rosenbrock函數(shù)上，求解精度和收斂速度明顯占優(yōu)；此外新算法在多模函數(shù)griewank和rastrigin上，收斂速度明顯占優(yōu)。關(guān)鍵詞:優(yōu)化；混沌；人工蜂群算法；局部搜索artif

2、icialbeecolonyalgorithmbasedonchaoslocalsearchoperatorwangxiang1*,lizhi.yong2,xuguo.yi3,wangyan4(1.schoolofcivilengineering,zhengzhouinstituteofaeronauticalindustrymanagement,zhengzhouhenan450015,china;2.departmentofmathematicsandphysics,zhengz

3、houinstituteofaeronauticalindustrymanagement,zhengzhouhenan450015,china;3.schoolofaccounting,zhengzhouinstituteofaeronauticalindustrymanagement,zhengzhouhenan450015,china;4.departmentofcomputerscienceandapplication,zhengzhouinstituteofaeronauticali

4、ndustrymanagement,zhengzhouhenan450015,chinaabstract:inordertoimprovetheabilityofartificialbeecolonyalgotithmatexploitation,anovelchaos-artificialbeecolonyalgorithmisproposedforcontinuousfunctionoptimizationproblems.anewchaoticlocalsearchoperatorisembedd

5、edintheframeworkofthenewalgorithm.thenewoperator,whosesearchradiusshrinkswiththeevolutiongeneration,candothelocalsearcharoundthebestfoodsource.thesimulationresultsshowthat:comparedwiththoseofartificialbeecolonyalgorithm,thesolutionqualityandtheconvergenc

6、espeedofthenewalgorithmarebetterforrosenbrockandtheconvergencespeedofthenewalgorithmisbetterforgriewankandrastrigin.inordertoimprovetheabilityofartificialbeecolony(abc)algorithmatexploitation,anewchaosartificialbeecolony(ch.abc)algorithmwasproposedforcon

7、tinuousfunctionoptimizationproblems.anewchaoticlocalsearchoperatorwasembeddedintheframeworkofthenewalgorithm.thenewoperator,whosesearchradiusshrinkswiththeevolutiongeneration,candothelocalsearcharoundthebestfoodsource.thesimulationresultsshowthat:compare

8、dwiththoseofabcalgorithm,thesolutionqualityandtheconvergencespeedofthenewalgorithmarebetterforrosenbrockandtheconvergencespeedofthenewalgorithmisbetterforgriewankandrastrigin.keywords:optimization;chaos;artificialbeecolon