The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2020
DOI: 10.1007/s00607-019-00782-9
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic multi-swarm global particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 43 publications
0
6
0
Order By: Relevance
“…PSO first initializes a group of random particles then updates the particle state through the optimal particles found in each iteration and the optimal particles found in the entire population, and finally obtains the global optimal solution after the iteration. As a common optimization algorithm, PSO has high efficiency, fast convergence speed, and improved ability for dealing with nonlinear and multi-peak problems [19,20]. In this research, PSO is used to invert the parameters of the inversion optimization model.…”
Section: Research On the Inversion Methods Of Mapping Function Techniquementioning
confidence: 99%
“…PSO first initializes a group of random particles then updates the particle state through the optimal particles found in each iteration and the optimal particles found in the entire population, and finally obtains the global optimal solution after the iteration. As a common optimization algorithm, PSO has high efficiency, fast convergence speed, and improved ability for dealing with nonlinear and multi-peak problems [19,20]. In this research, PSO is used to invert the parameters of the inversion optimization model.…”
Section: Research On the Inversion Methods Of Mapping Function Techniquementioning
confidence: 99%
“…On the other hand, the second sub-population is guided homogeneously by using the classical PSO update mechanism. e) DMS-GPSO [25]: The dynamic multi-swarm global particle swarm optimization (DMS-GPSO) segments the evolutionary process into an initial stage and a final stage. In the initial stage, the population is divided into a global sub-swarm and multiple dynamic sub-swarms.…”
Section: B Multi-swarm Pso Approachesmentioning
confidence: 99%
“…f) DMS-PSO-GD [19]: The Dynamic Multi-Swarm Particle Swarm Optimization with Global Detection Mechanism (DMS-PSO-GD) has some similarities to the DMS-GPSO [25] in the sense that it also divides population into two kinds of sub-swarms: several same-sized dynamic sub-swarms and a global sub-swarm. This algorithm, however, uses the variances and average fitness values of dynamic sub-swarms to measure the distribution of the particles, in order to detect the dominant and the optimal particle.…”
Section: B Multi-swarm Pso Approachesmentioning
confidence: 99%
“…Hybrid PSO algorithms are combined with some traditional and evolutionary optimization methods in order to utilized the advantages of both methods and improve the global search ability of PSO, such as simulated annealing (SA) [51], tabu search (TS) [52], BBO [53], artificial bee colony (ABC) [54], genetic algorithm (GA) [55] and differential evolution (DE) [56]. Speciality, multi-swarm PSO is an important field of improved PSO in recent years [57][58][59][60]. PSO has been widely used to solve practical engineering problems due to easy implementation and robust performance [61], including clustering problems [62], signalized traffic problems [63], image segmentation [64], feature selection [65], antenna synthesis [66] and fuzzy controlled systems [67].…”
Section: Related Workmentioning
confidence: 99%