2009
DOI: 10.1007/s11047-009-9175-3
|View full text |Cite
|
Sign up to set email alerts
|

BGSA: binary gravitational search algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
337
0
3

Year Published

2012
2012
2022
2022

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 649 publications
(342 citation statements)
references
References 20 publications
2
337
0
3
Order By: Relevance
“…(12) calculates gravitational constant G(t) in time t. T is number of iterations, G(t 0 ) initial value of gravitational constant, t also refers to the moment of iteration [20][21][22][23][24]. (13) where, m pi (t), m aj (t) active and passive masses respectively, at iteration tR ij (t) is the Euclidian distance between two masses i th and j th at iteration t. ε is a small constant [20 ÷ 24].…”
Section: Gravitational Search Algorithmmentioning
confidence: 99%
“…(12) calculates gravitational constant G(t) in time t. T is number of iterations, G(t 0 ) initial value of gravitational constant, t also refers to the moment of iteration [20][21][22][23][24]. (13) where, m pi (t), m aj (t) active and passive masses respectively, at iteration tR ij (t) is the Euclidian distance between two masses i th and j th at iteration t. ε is a small constant [20 ÷ 24].…”
Section: Gravitational Search Algorithmmentioning
confidence: 99%
“…On the other hand, it can be observed that EOFA has the best performance for most of the test functions except for F2 and F11 where GSA outperforms EOFA. It is known from the reviews that, different algorithms may perform better than others for different problems (Elbeltagi et al 2005;Rashedi et al 2010). Performances in terms of convergence between FA, GSA and EOFA for randomly chosen functions are illustrated from Figure 3 to Figure 6.…”
Section: Resultsmentioning
confidence: 99%
“…Researchers have applied fuzzy logic to control the effectiveness of the parameters of GSA [5] [6] [7]. Initially, a GSA was devised for function optimization but later it has been redesigned for other optimization problems like binary optimization problem [8], multi-objective problems [9], discrete optimization problem [10] and multi-modal problems [11].…”
Section: ) Computing Accelerationmentioning
confidence: 99%