节点文献

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

Artificial bee colony algorithm based on chaos local search operator

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王翔李志勇许国艺王艳

【Author】 WANG Xiang1,LI Zhi-yong2,XU Guo-yi3,WANG Yan4(1.School of Civil Engineering,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou Henan 450015,China; 2.Department of Mathematics and Physics,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou Henan 450015,China; 3.School of Accounting,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou Henan 450015,China; 4.Department of Computer Science and Application,Zhengzhou Institute of Aeronautical Industry Management,Zhengzhou Henan 450015,China)

【机构】 郑州航空工业管理学院土木建筑工程学院郑州航空工业管理学院数理系郑州航空工业管理学院会计学院郑州航空工业管理学院计算机科学与应用系

【摘要】 在求解函数优化问题时,为了提升人工蜂群算法局部搜索能力,提出了一种新颖的混沌蜂群算法。新算法设计了一种混沌局部搜索算子,并将其嵌入蜂群算法框架中;该算子不仅能够实现在最优食物源周围局部搜索,还能够随着进化代数增加使搜索范围不断缩小。仿真实验结果表明,与人工蜂群算法相比,新算法在Rosenbrock函数上,求解精度和收敛速度明显占优;此外新算法在多模函数Griewank和Rastrigin上,收敛速度明显占优。

【Abstract】 In order to improve the ability of Artificial Bee Colony(ABC) algorithm at exploitation,a new Chaos Artificial Bee Colony(CH-ABC) algorithm was proposed for continuous function optimization problems.A new chaotic local search operator was embedded in the framework of the new algorithm.The new operator,whose search radius shrinks with the evolution generation,can do the local search around the best food source.The simulation results show that: compared with those of ABC algorithm,the solution quality and the convergence speed of the new algorithm are better for Rosenbrock and the convergence speed of the new algorithm is better for Griewank and Rastrigin.

【基金】 河南省科技攻关项目(112102210024);河南省教育厅自然科学基金资助项目(2010B520030)
  • 【文献出处】 计算机应用 ,Journal of Computer Applications , 编辑部邮箱 ,2012年04期
  • 【分类号】TP18
  • 【被引频次】65
  • 【下载频次】867
节点文献中: 

本文链接的文献网络图示:

本文的引文网络