2014
DOI: 10.1007/s13042-014-0308-3
|View full text |Cite
|
Sign up to set email alerts
|

Particle swarm optimization with neighborhood-based budget allocation

Abstract: The standard particle swarm optimization (PSO) algorithm allocates the total available budget of function evaluations equally and concurrently among the particles of the swarm. In the present work, we propose a new variant of PSO where each particle is dynamically assigned different computational budget based on the quality of its neighborhood. The main goal is to favor particles with high-quality neighborhoods by asynchronously providing them with more function evaluations than the rest. For this purpose, we … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(8 citation statements)
references
References 31 publications
0
8
0
Order By: Relevance
“…The performance of the ABC algorithm is comprehensively analysed in [11]. The ABC algorithm is compared with other classical swarm intelligence algorithms such as differential evolution (DE) algorithm [12][13][14], particle swarm optimisation (PSO) algorithm [15,16], and genetic algorithm (GA) [17]. Experimental results show that the performance of the ABC algorithm is generally better than other similar algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…The performance of the ABC algorithm is comprehensively analysed in [11]. The ABC algorithm is compared with other classical swarm intelligence algorithms such as differential evolution (DE) algorithm [12][13][14], particle swarm optimisation (PSO) algorithm [15,16], and genetic algorithm (GA) [17]. Experimental results show that the performance of the ABC algorithm is generally better than other similar algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Note that the homogeneous architecture of sensor networks inevitably brings about poor fundamental limits and performance due mainly to the diversity of information in cyber-physical systems. Therefore, the effective information processing dependent on distributed, dynamical and heterogeneous multi-platform measurements is usually an indispensable step in the implementation of collaborative tasks [28,67,106]. For instance, the sequential design approach coupled with the minimum principle of Pontryagin and the Lagrange multiplier method has been employed in [106] to deal with the heterogeneity of sensors to realize the unbiasedness and optimality of distributed consensus filtering.…”
Section: ) Applications In Cyber-physical Systemsmentioning
confidence: 99%
“…where r 1 and r 2 are random variables that induce stochacity (Souravlias and Parsopoulos, 2016), c 1 is the cognitive parameter, c 2 is the social parameter and c 1 =c 2 =2 in most cases.…”
Section: D Inversion Using Particle Swarm Optimizationmentioning
confidence: 99%