.png){kind=icon}
返回
A Modified Gravitational Search Algorithm for Function Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2889854.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Gravitational search algorithm (GSA) is a population-based heuristic algorithm, which is inspired by Newton's laws of gravity and motion. Although GSA provides a good performance in solving optimization problems, it has a disadvantage of premature convergence. In this paper, the concept of repulsive force is introduced and the definition of exponential Kbest is used in a new version of GSA, which is called repulsive GSA with exponential Kbest (EKRGSA). In this algorithm, heavy particles repulse or attract all particles according to distance, and all particles search the solution space under the combined action of repulsive force and gravitational force. In this way, the exploration ability of the algorithm is improved and a proper balance between exploration and exploitation is established. Moreover, the exponential Kbest significantly decreases the computational time. The proposed algorithm is tested on a set of benchmark functions and compared with other algorithms. The experimental results confirm the high efficiency of EKRGSA.
Keyword:
Gravitational search algorithm
repulsive force
exponential Kbest
function optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。