2019
DOI: 10.1007/s00521-019-04255-0
|View full text |Cite
|
Sign up to set email alerts
|

Network characteristics for neighborhood field algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 42 publications
0
2
0
Order By: Relevance
“…In the CSO algorithm, the swarm size is 1500 and the iteration number is 10000. e neighborhood field is defined to be the nearest superior particle and inferior particle. e details of such a neighborhood field can be referred to [30,31].…”
Section: Simulationsmentioning
confidence: 99%
“…In the CSO algorithm, the swarm size is 1500 and the iteration number is 10000. e neighborhood field is defined to be the nearest superior particle and inferior particle. e details of such a neighborhood field can be referred to [30,31].…”
Section: Simulationsmentioning
confidence: 99%
“…Swarm intelligence algorithm is applied to high-dimensional function optimization problems by many scholars. e study in [7] used neighborhood factors to improve the NFO algorithm, which is applied to complex optimization problems and achieves good results. Compared with the traditional particle swarm optimization (PSO) algorithm, the improved particle swarm optimization algorithm in [8] is applied to high-dimensional function optimization because its convergence accuracy in highdimensional function is improved.…”
Section: Introductionmentioning
confidence: 99%