2015
DOI: 10.1007/s12204-015-1585-z
|View full text |Cite
|
Sign up to set email alerts
|

Simplified group search optimizer algorithm for large scale global optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 3 publications
0
8
0
Order By: Relevance
“…When complex environmental factors and constraints are involved, the GWO algorithm easily falls into the local optimal solution resulting in low search accuracy [25]. Yang Zhang [26] proposed MGWO, which introduced an exponential regular convergence factor strategy, an adaptive update strategy, and a dynamic weighting strategy to improve GWO's search capabilities. Experimental results prove that its convergence speed and the algorithm's search ability are improved effectively.…”
Section: Related Workmentioning
confidence: 99%
“…When complex environmental factors and constraints are involved, the GWO algorithm easily falls into the local optimal solution resulting in low search accuracy [25]. Yang Zhang [26] proposed MGWO, which introduced an exponential regular convergence factor strategy, an adaptive update strategy, and a dynamic weighting strategy to improve GWO's search capabilities. Experimental results prove that its convergence speed and the algorithm's search ability are improved effectively.…”
Section: Related Workmentioning
confidence: 99%
“…The Simplified Group Search Optimizer (SGSO) [ 24 ] is an improved GSO version. It is more efficient and simpler than the original version.…”
Section: Related Workmentioning
confidence: 99%
“… The remaining members are rangers, who take a random step according to where r 3 is a standard normal distribution D -dimensional vector, step is a constant, representing the basic step size, and f is a D -dimensional Boolean random vector indicating which dimensions will change. The probability of change is set to be 1.2/ D as given in [ 24 ]. f is calculated by where j ∈ {1,2,…, D }, rand(1) is a function that produces a uniform random number in the range (0, 1), and j rand is a randomly chosen index ∈ {1,2,…, D }, which ensures that at least one component in f is set to 1.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations