2019
DOI: 10.1109/access.2018.2889854
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Gravitational Search Algorithm for Function Optimization

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…The first term in (22) is the field produced by the solenoids of the length (2l+s) and radius "rc1" and the second term is the field produced by the solenoid of length "s" and radius "rc2".…”
Section: Pseudo Code Of Igsamentioning
confidence: 99%
See 1 more Smart Citation
“…The first term in (22) is the field produced by the solenoids of the length (2l+s) and radius "rc1" and the second term is the field produced by the solenoid of length "s" and radius "rc2".…”
Section: Pseudo Code Of Igsamentioning
confidence: 99%
“…The amalgamation of all these factors that are: the relation between masses and the objective function, dependency on the distance, and combine the behavior of all the agents' gravitational force make the GSA algorithm unique. [22]. This algorithm works on the following mechanism.…”
Section: Introductionmentioning
confidence: 99%
“…To further validate the performance of the proposed algorithm, the three latest GSA variants, i.e., NFGSA [21], PSGSA [21] and EKRGSA [20], are selected for comparison.…”
Section: Comparison With the Latest Gsa Variantsmentioning
confidence: 99%
“…S. He et al proposed EKRGSA and modified the function of Kbest, which decreases exponentially with the number of iterations from N to 1 in Eq. (2) [20]:…”
Section: Introductionmentioning
confidence: 99%
“…In [27], chaotic operators were utilized to enhance the performance of GSA. Besides, Kepler operator [28], escaping operator [29] and repulsive operator [30] were introduced to optimize particles' positions. These operators effectively improve particles' movements.…”
Section: Introductionmentioning
confidence: 99%