2019
DOI: 10.3390/math7050414
|View full text |Cite
|
Sign up to set email alerts
|

An Entropy-Assisted Particle Swarm Optimizer for Large-Scale Optimization Problem

Abstract: Diversity maintenance is crucial for particle swarm optimizer’s (PSO) performance. However, the update mechanism for particles in the conventional PSO is poor in the performance of diversity maintenance, which usually results in a premature convergence or a stagnation of exploration in the searching space. To help particle swarm optimization enhance the ability in diversity maintenance, many works have proposed to adjust the distances among particles. However, such operators will result in a situation where th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…The algorithm is initiated with sub-swarms of small size neighborhoods, slowly expanding through every iteration, absorbing other particles, taking advantage of both the global and local neighborhood structures to increase the performance of the PSO algorithm. Competitive strategy was used in [30] to manage convergence, while entropy measurement was employed to maintain the diversity of the swarm. In [31], an adaptive multi-swarm competition PSO was proposed where the swarm is adaptively divided into sub-swarms and a competition mechanism is used to maintain diversity in the swarms.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…The algorithm is initiated with sub-swarms of small size neighborhoods, slowly expanding through every iteration, absorbing other particles, taking advantage of both the global and local neighborhood structures to increase the performance of the PSO algorithm. Competitive strategy was used in [30] to manage convergence, while entropy measurement was employed to maintain the diversity of the swarm. In [31], an adaptive multi-swarm competition PSO was proposed where the swarm is adaptively divided into sub-swarms and a competition mechanism is used to maintain diversity in the swarms.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Cross-entropy is a measure of a discrepancy between two probability distributions [ 4 ]. It is used widely beyond the theory of information, e.g., as an objective function for the optimisation of traffic flow [ 11 ] or in a particle swarm optimisation [ 12 , 13 ]. It is also used in machine learning as a loss function for the training set of neural networks [ 14 ] or to improve the clustering of data [ 15 ].…”
Section: Related Workmentioning
confidence: 99%
“…Particle swarm optimisation (PSO) [ 34 ] can use entropy for the simulated set of states (“particles”) (EA-PSO) [ 12 ], and then it may apply cross-entropy in the meta-optimisation of the search space. Various modifications and extensions exist, such as memetic based [ 13 ], niche strategy [ 35 ], or clustering [ 36 ].…”
Section: Related Workmentioning
confidence: 99%
“…Hence, solutions move and interact, rather than being evolved as in EAs, according to the dynamics outlined in Reference [25]. Several PSO variants have been designed to deal with a wide range of problems [26], including large scale ones [27,28], as well as challenging engineering applications [29], and hybrid versions were also designed thus generating effective PSO based multi-strategy approaches [30] and Estimation of Distribution Algorithms (EDAs) [31,32]. The EDA framework is quite interesting and has proven to be successful over different fields such as Robotics [33] and combinatorial domains [21].…”
Section: Background and Related Workmentioning
confidence: 99%