2013
DOI: 10.1007/s10115-013-0624-z
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic opposition-based particle swarm optimization with velocity clamping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(20 citation statements)
references
References 27 publications
0
20
0
Order By: Relevance
“…We cite for instance its use with differential evolution [66][67][68], artificial neural networks [69], particle swarm optimisation [70][71][72][73], bio-geography optimisation [74], ant colonies [75] and simulated annealing [76]. These hybridisations and others are well detailed in [67].…”
Section: Opposition-based Learningmentioning
confidence: 99%
“…We cite for instance its use with differential evolution [66][67][68], artificial neural networks [69], particle swarm optimisation [70][71][72][73], bio-geography optimisation [74], ant colonies [75] and simulated annealing [76]. These hybridisations and others are well detailed in [67].…”
Section: Opposition-based Learningmentioning
confidence: 99%
“…"Velocity clamping" [29] was used to set an upper bound for the velocity parameter as a way to limit particles flying out of the search space.…”
Section: Psomentioning
confidence: 99%
“…"Velocity clamping" [48] was used as a way to limit particles flying out of the search space. Another method is the "constriction coefficient" strategy, proposed by Clerc and Kennedy [49], as an outcome of a a theoretical analysis of swarm dynamic, in which the velocities are constricted too.…”
Section: Algorithm -Psomentioning
confidence: 99%