2022
DOI: 10.32604/iasc.2022.017304
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Research Directions of Population Initialization Techniques using PSO Algorithm

Abstract: Likewise, the paper finds the proficiency of numerous quasi-random sequences (QRS) based on initialization approaches by looking at their exhibition analyzed for sixteen notable benchmark test problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 25 publications
(12 citation statements)
references
References 44 publications
0
12
0
Order By: Relevance
“…For emergency material scheduling solution, it can be seen from most of the literature that the PSO algorithm has superiority in solving scheduling optimization problems. However, the PSO algorithm has a low fault tolerance, and the optimization results cannot meet the requirements of each distribution, which easily falls into local optimization [23]. Also, PSO algorithms usually construct initial values randomly, so there is an uneven distribution of initial particles, which may lead to uneven solutions [24].…”
Section: Literature Summarymentioning
confidence: 99%
“…For emergency material scheduling solution, it can be seen from most of the literature that the PSO algorithm has superiority in solving scheduling optimization problems. However, the PSO algorithm has a low fault tolerance, and the optimization results cannot meet the requirements of each distribution, which easily falls into local optimization [23]. Also, PSO algorithms usually construct initial values randomly, so there is an uneven distribution of initial particles, which may lead to uneven solutions [24].…”
Section: Literature Summarymentioning
confidence: 99%
“…e original SSA uses a random method to generate the initial position of the sparrow population, which is likely to cause uneven distribution of individuals, resulting in poor population diversity. Chaotic motion is characterized by pseudorandomness, ergodicity, and high sensitivity to initial conditions and parameters [35,36].…”
Section: Iterative Chaotic Map Strategymentioning
confidence: 99%
“…In Section 3, the running results of the BPSO algorithm on the simulation of a wall-following robot are analysed and compared with other optimization algorithms in terms of convergence speed, running time, and an optimal solution. Section 4 provides the concluding remarks and prospects (Li et al, 2022;Pervaiz et al, 2022;Wei et al, 2017).…”
Section: Introductionmentioning
confidence: 99%