首页> 外文会议>International Conference on Contemporary Computing >Chaotic Kbest gravitational search algorithm (CKGSA)
【24h】

Chaotic Kbest gravitational search algorithm (CKGSA)

机译:混沌Kbest引力搜索算法(CKGSA)

获取原文

摘要

Gravitational search algorithm is a popular adaptive search algorithm among nature-inspired algorithms and has been successfully used for optimizing many real-world problems. Gravitational search algorithm uses the law of Newton gravity for finding the optimal solution. The performance of gravitational search algorithm is controlled by exploration and exploitation capabilities and Kbest is one of its parameters that controls this trade-off. In this paper, a novel chaotic Kbest gravitational search algorithm has been proposed that uses the chaotic model in Kbest to balance the exploration and exploitation non-linearly. The proposed algorithm shows better convergence rate at later iterations with high precision and does not trap into local optima. The experimental results validate that the proposed algorithm outperforms.
机译:引力搜索算法是自然启发算法中一种流行的自适应搜索算法,已成功用于优化许多现实世界中的问题。引力搜索算法利用牛顿引力定律找到最优解。重力搜索算法的性能受勘探和开发能力的控制,而Kbest是控制这种权衡的参数之一。本文提出了一种新颖的混沌Kbest引力搜索算法,该算法利用Kbest中的混沌模型来非线性地平衡勘探和开发。所提出的算法在较高的精度下具有较高的收敛速度,并且不会陷入局部最优解。实验结果验证了该算法的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号