...
首页> 外文期刊>Expert Systems with Application >Neural network and fuzzy system for the tuning of Gravitational Search Algorithm parameters
【24h】

Neural network and fuzzy system for the tuning of Gravitational Search Algorithm parameters

机译:重力搜索算法参数调整的神经网络和模糊系统

获取原文
获取原文并翻译 | 示例
           

摘要

A good trade-off between exploration and exploitation to find optimal values in search algorithms is very hard to achieve. On the other hand, the combination of search methods may cause computational complexity increase problems. The Gravitational Search Algorithm (GSA) is a swarm optimization algorithm based on the law of gravity, where the solution search process depends on the velocity of particles. The application of intelligent techniques can improve the search performances of GSA. This paper proposes the design of a Neuro and Fuzzy Gravitational Search Algorithm (NFGSA) to achieve better results than GSA in terms of global optimum search capability and convergence speed, without increasing the computational complexity. Both the algorithms have the same computational complexity O(nd), where n is the number of agents and d is the search space dimension. The main task of the designed intelligent system is to adjust a GSA parameter on a revised version of GSA. NFGSA is compared with GSA, a Plane Surface Gravitational Search Algorithm (PSGSA) and a Modified Gravitational Search Algorithm (MGSA). The results show that NFGSA improves the optimization performances of GSA and PSGSA, without adding computational costs. Moreover, the proposed algorithm is better than MGSA for a benchmark function and achieves similar results for two test functions. The analysis on the computational complexity shows that NFGSA has a better computational complexity than MGSA, because NFGSA has complexity O(nd), whereas MGSA has complexity O((nd)(2)). (C) 2018 Elsevier Ltd. All rights reserved.
机译:要在搜索算法中找到最佳值的探索与开发之间的良好权衡很难实现。另一方面,搜索方法的组合可能导致计算复杂性增加的问题。引力搜索算法(GSA)是一种基于重力定律的群体优化算法,其中解搜索过程取决于粒子的速度。智能技术的应用可以提高GSA的搜索性能。本文提出了一种神经和模糊引力搜索算法(NFGSA)的设计,以在全局最优搜索能力和收敛速度方面实现比GSA更好的结果,而不会增加计算复杂性。两种算法都具有相同的计算复杂度O(nd),其中n是代理数,d是搜索空间维。设计的智能系统的主要任务是在GSA的修订版上调整GSA参数。将NFGSA与GSA,平面表面引力搜索算法(PSGSA)和改进的引力搜索算法(MGSA)进行了比较。结果表明,NFGSA在不增加计算成本的情况下提高了GSA和PSGSA的优化性能。此外,对于基准功能,该算法优于MGSA,并且对于两个测试功能,其结果均相似。对计算复杂度的分析表明,由于NFGSA具有复杂度O(nd),而MGSA具有复杂度O((nd)(2)),因此NFGSA具有比MGSA更好的计算复杂度。 (C)2018 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号