2021
DOI: 10.1080/21642583.2021.1891153
|View full text |Cite
|
Sign up to set email alerts
|

An improved particle swarm optimization algorithm with adaptive weighted delay velocity

Abstract: An improved particle swarm optimization (PSO) with adaptive weighted delay velocity (PSO-AWDV) is proposed in this paper. A new scheme blending weighted delay velocity is firstly presented for a new PSO with weighted delay velocity (PSO-WDV) algorithm. Then, to adaptively update the velocity inertia weight, an adaptive PSO-AWDV algorithm is developed based on the evolutionary state of the particle swarm evaluated via a new estimation method. The newly proposed adaptive PSO-AWDV algorithm is tested based on som… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 62 publications
(28 citation statements)
references
References 36 publications
0
28
0
Order By: Relevance
“…The experiment results on two MI datasets illustrate that the proposed method can improve the classification performance compared with the original CSP method. The further studies could seek to find other algorithms and learning mechanisms to optimize the revised objective function of CSP in order to enhance the feature extraction in BCI [46,47,48].…”
Section: Discussionmentioning
confidence: 99%
“…The experiment results on two MI datasets illustrate that the proposed method can improve the classification performance compared with the original CSP method. The further studies could seek to find other algorithms and learning mechanisms to optimize the revised objective function of CSP in order to enhance the feature extraction in BCI [46,47,48].…”
Section: Discussionmentioning
confidence: 99%
“…To verify the superiority of the HGSPSO algorithm in solving complex problems, this paper compares it with the original PSO [24] and four other improved PSO algorithms, SAPSO [25], GLEPSO [27], UCPSO [28], and PSOAWDV [29], for experiments. The comparison parameters are set as shown in Table 1.…”
Section: A Comparison With Other Algorithmsmentioning
confidence: 99%
“…However, these intelligent algorithms suffer from imbalance in energy consumption and fail in handling the balance between local and global search during the process of CH selection. Moreover, the nonuniform distribution of CHs introduces maximized drain of energy at certain regions resulting in the problem of energy hole 15 . Further, heavily loaded CHs in the network perish faster than the under‐loaded CHs as the mean distance between CH and BS can be included into the fitness during the selection of all CHs closer to BS.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the nonuniform distribution of CHs introduces maximized drain of energy at certain regions resulting in the problem of energy hole. 15 Further, heavily loaded CHs in the network perish faster than the under-loaded CHs as the mean distance between CH and BS can be included into the fitness during the selection of all CHs closer to BS.…”
Section: Introductionmentioning
confidence: 99%