2020
DOI: 10.1051/smdo/2019022
|View full text |Cite
|
Sign up to set email alerts
|

A comparative study of three new parallel models based on the PSO algorithm

Abstract: Meta-heuristic PSO has limits, such as premature convergence and high running time, especially for complex optimization problems. In this paper, a description of three parallel models based on the PSO algorithm is developed, on the basis of combining two concepts: parallelism and neighborhood, which are designed according to three different approaches in order to avoid the two disadvantages of the PSO algorithm. The third model, SPM (Spherical-neighborhood Parallel Model), is designed to improve the obtained r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 8 publications
(11 reference statements)
0
4
0
Order By: Relevance
“…Each particle represents a solution in the search space and moves based on its own experience and the experience of the swarm in general. The goal is to find the best possible solution to an optimization problem [21,22].…”
Section: Particle Swarm Optimization and Gray Wolf Optimizermentioning
confidence: 99%
“…Each particle represents a solution in the search space and moves based on its own experience and the experience of the swarm in general. The goal is to find the best possible solution to an optimization problem [21,22].…”
Section: Particle Swarm Optimization and Gray Wolf Optimizermentioning
confidence: 99%
“…Also, PSO prioritization helps in improving the test cases execution time by considering selected set of test cases and eliminating the irrelevant set of test cases in turn helping by improving the code coverage information as well [18,20,29,30]. One more interesting feature of PSO algorithm is that it helps in generating improvised APFD results when compared with random ordering [31][32][33]. PSO algorithm has a capability of improving fault detection but does not focus much on the PSO performance when compared with the SI algorithms in TSR [7,14,20,26].…”
Section: Related Workmentioning
confidence: 99%
“…Although the PSO-based node localization approach [31] is computationally effective, there is not much improvement in the localization error. Bat algorithm-based localization [32] replicates bats' behavior using echolocation for the prey hunting during the darkness.…”
Section: Related Workmentioning
confidence: 99%