2011
DOI: 10.1016/j.ins.2010.05.025
|View full text |Cite
|
Sign up to set email alerts
|

Cellular particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
90
0
2

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
3
1

Relationship

1
9

Authors

Journals

citations
Cited by 205 publications
(92 citation statements)
references
References 32 publications
(34 reference statements)
0
90
0
2
Order By: Relevance
“…and the references cited therein [31]. Another parameter called constriction coefficient is introduced with the hope that it can insure a PSO to converge.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…and the references cited therein [31]. Another parameter called constriction coefficient is introduced with the hope that it can insure a PSO to converge.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…The ω can be estimated by the week stable region. The average of ω is 0.75 [31]. Linearly Decreasing Inertia Weight Method (LDIWM)…”
Section: B Wmn-pso System For Mesh Router Node Placementmentioning
confidence: 99%
“…It has been found to be effective in solving large-scale problems in many applications (Al-Shihabi et al, 2008;Shi andÓlafsson, 2000a,b;Shi et al, 2011 At each iteration of the NP algorithm, the feasible region is divided into two subsets heuristically; one called "most promising" and the other called "complimentary". The algorithm then further partitions the "most promising" subset into M smaller subregions.…”
Section: Nested Partitionmentioning
confidence: 99%