2021
DOI: 10.1155/2021/6628889
|View full text |Cite
|
Sign up to set email alerts
|

A New Initialization Approach in Particle Swarm Optimization for Global Optimization Problems

Abstract: Particle swarm optimization (PSO) algorithm is a population-based intelligent stochastic search technique used to search for food with the intrinsic manner of bee swarming. PSO is widely used to solve the diverse problems of optimization. Initialization of population is a critical factor in the PSO algorithm, which considerably influences the diversity and convergence during the process of PSO. Quasirandom sequences are useful for initializing the population to improve the diversity and convergence, rather tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 53 publications
(20 citation statements)
references
References 35 publications
0
20
0
Order By: Relevance
“…Therefore, the proposed DKNet model is an efficient recognition system. In future, performnce of DKNet can be improved by tuning its hyper-parameters using metaheuristic techniques such as bat algorithm [50], particle swarm optimization [49], [51], etc.…”
Section: Discussionmentioning
confidence: 99%
“…Therefore, the proposed DKNet model is an efficient recognition system. In future, performnce of DKNet can be improved by tuning its hyper-parameters using metaheuristic techniques such as bat algorithm [50], particle swarm optimization [49], [51], etc.…”
Section: Discussionmentioning
confidence: 99%
“…There are 22 layers in GoogleNet, and it can be used for multiple purposes like face recognition, object finding, image processing, etc. [58,59].…”
Section: Googlenetmentioning
confidence: 99%
“…However, these approaches cannot be applied in our formulation, since our model allows routing cycles that can cover multiple planning cycles. Other heuristic solution approaches include the iterative refinement algorithm [35], gradient search [36], probability search algorithm [37], modified controlled bat algorithm [38], particle swarm optimization [39,40], and bundle-based relaxation [41]. The performances of these algorithms are not suitable for solving large-scale instances because either the solution quality cannot meet the requirement, or they fail to obtain solutions.…”
Section: Literature Reviewmentioning
confidence: 99%