2021
DOI: 10.3390/e23091200
|View full text |Cite
|
Sign up to set email alerts
|

A Particle Swarm Algorithm Based on a Multi-Stage Search Strategy

Abstract: Particle swarm optimization (PSO) has the disadvantages of easily getting trapped in local optima and a low search accuracy. Scores of approaches have been used to improve the diversity, search accuracy, and results of PSO, but the balance between exploration and exploitation remains sub-optimal. Many scholars have divided the population into multiple sub-populations with the aim of managing it in space. In this paper, a multi-stage search strategy that is dominated by mutual repulsion among particles and supp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 28 publications
(32 reference statements)
0
2
0
Order By: Relevance
“…The particle swarm algorithm originated from the study of bird feeding behavior, in which birds search for food randomly, not knowing where their current position is from the food, the simplest and most effective search strategy is to search the area around the bird that is currently closest to the food. The simplest and most effective search strategy is to search the area around the bird that is currently closest to the food and constantly adjust the state of the particles to find the food and reach the global optimum [49]. The basic principle of the ant colony algorithm is that ants release pheromone in the process of searching for food.…”
Section: Path Planning Unitmentioning
confidence: 99%
“…The particle swarm algorithm originated from the study of bird feeding behavior, in which birds search for food randomly, not knowing where their current position is from the food, the simplest and most effective search strategy is to search the area around the bird that is currently closest to the food. The simplest and most effective search strategy is to search the area around the bird that is currently closest to the food and constantly adjust the state of the particles to find the food and reach the global optimum [49]. The basic principle of the ant colony algorithm is that ants release pheromone in the process of searching for food.…”
Section: Path Planning Unitmentioning
confidence: 99%
“…Therefore, each particle position converges to a particular solution for a right path which are all evaluated and the best particle experience (P best ) within the best global one (G best ) [83]. Equations ( 3) and ( 4) are the mathematical representation for the velocity ∆X and position x i of each particle where k 1 and k 2 are the cognition coefficients to accelerate the particles to the suitable paths [84]. The parameter ω is called the inertia weight whereas r 1 and r 2 are arbitrary variables that belong in the range [0, 1] [85].…”
Section: Particle Swarm Optimisationmentioning
confidence: 99%
“…The dynamic Clan PSO topology was described by Bastos-Filho et al [ 38 ]. Shen et al [ 39 ] proposed a multi-stage search strategy supplemented by mutual repulsion and attraction among particles. The proposed algorithm increases the entropy of the particle population and leads to a more balanced search process.…”
Section: Introductionmentioning
confidence: 99%