2013 International Conference on Parallel and Distributed Computing, Applications and Technologies 2013
DOI: 10.1109/pdcat.2013.10
|View full text |Cite
|
Sign up to set email alerts
|

A Variant of Unified Bare Bone Particle Swarm Optimizer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…Motivated by the unified particle swarm optimization scheme [22], a unified bare bone particle swarm optimization algorithm is also proposed by the author [23]. Instead of just using the neighborhood's best and personal best to calculate the mean and standard deviation adopted by BPSO, this paper considers the possibility of replacing the neighborhood's best with a new approach.…”
Section: The Bare Bone Particle Swarm Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Motivated by the unified particle swarm optimization scheme [22], a unified bare bone particle swarm optimization algorithm is also proposed by the author [23]. Instead of just using the neighborhood's best and personal best to calculate the mean and standard deviation adopted by BPSO, this paper considers the possibility of replacing the neighborhood's best with a new approach.…”
Section: The Bare Bone Particle Swarm Optimizationmentioning
confidence: 99%
“…It is expected that proper steers these two abilities will result in enhanced performance, for example [22,23]. In original bare bone particle swarm optimization algorithm, the step size is generated from a Gaussian distribution function with mean and standard deviation calculated from global best and personal best particles.…”
Section: The Proposed Algorithmmentioning
confidence: 99%
“…One of the centers is using local best positions and is considered to have exploration characteristics, while the other is based on the global best position and is used for better exploitation around the best particle. At early iterations, exploration has a bigger weight which gradually decreases in the favor of exploitation [31,32].…”
Section: Introductionmentioning
confidence: 99%