首页> 外文期刊>International Journal of Engineering Trends and Technology >A hybrid Bee colony algorithm for solving unconstrained optimization problems
【24h】

A hybrid Bee colony algorithm for solving unconstrained optimization problems

机译:混合蜂群算法求解无约束优化问题

获取原文
           

摘要

In this Paper, A hybrid algorithm between Bee colony algorithm and flower pollination algorithm (ABCFP) for optimization problems is proposed. The proposed algorithm is tested using several standard benchmark functions. A comparative study of the results with those obtained using wellknown intelligence algorithms are used to validate and verify the efficiency of ABCFP. A global optimal solution was reached in the solution of all benchmark problems proving the capability of the new algorithm to escape from local optimal.
机译:提出了蜂群算法与花粉授粉算法(ABCFP)的混合优化算法。使用几种标准基准功能对提出的算法进行了测试。将结果与使用知名智能算法获得的结果进行比较研究,以验证和验证ABCFP的效率。在所有基准问题的解决方案中达到了全局最优解,证明了新算法有能力摆脱局部最优。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号