4.7 Article

An aggregative learning gravitational search algorithm with self-adaptive gravitational constants

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 152, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2020.113396

关键词

Gravitational search algorithm; Gravitational constant; Elite individuals; Exploration and exploitation; Aggregative learning; Neural network learning

资金

  1. National Natural Science Foundation of China [61872271, 11972115]
  2. Beijing Natural Science Foundation [4192029]
  3. Fundamental Research Funds for the Central Universities [22120190208]

向作者/读者索取更多资源

The gravitational search algorithm (GSA) is a meta-heuristic algorithm based on the theory of Newtonian gravity. This algorithm uses the gravitational forces among individuals to move their positions in order to find a solution to optimization problems. Many studies indicate that the GSA is an effective algorithm, but in some cases, it still suffers from low search performance and premature convergence. To alleviate these issues of the GSA, an aggregative learning GSA called the ALGSA is proposed with a self-adaptive gravitational constant in which each individual possesses its own gravitational constant to improve the search performance. The proposed algorithm is compared with some existing variants of the GSA on the IEEE CEC2017 benchmark test functions to validate its search performance. Moreover, the ALGSA is also tested on neural network optimization to further verify its effectiveness. Finally, the time complexity of the ALGSA is analyzed to clarify its search performance. (C) 2020 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据