2018
DOI: 10.1016/j.asoc.2018.04.008
|View full text |Cite
|
Sign up to set email alerts
|

A novel particle swarm optimization based on prey–predator relationship

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
26
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 57 publications
(26 citation statements)
references
References 30 publications
0
26
0
Order By: Relevance
“…Each particle updates its location through following two optimal values: one is determined by each particle, which is denoted as personal best (abbreviated as ) and the other by the whole population (abbreviated as ). Each particle updates its value when individual fitness value conforms to the comparison expression [47] .…”
Section: Modeling Steps and Solution Methodsmentioning
confidence: 99%
“…Each particle updates its location through following two optimal values: one is determined by each particle, which is denoted as personal best (abbreviated as ) and the other by the whole population (abbreviated as ). Each particle updates its value when individual fitness value conforms to the comparison expression [47] .…”
Section: Modeling Steps and Solution Methodsmentioning
confidence: 99%
“…This part critically reviews PSO variants that are published recently. The authors in [77] proposed a new PSO variant named prey-predator PSO (PP-PSO) that implements catch, escape, and breeding strategies that can assist in enhancing the convergence speed and reduce the computational time. The proposed approach is tested on 10 classical benchmarking functions and the CEC2017 test suite for 10, 30, and 100 dimensions.…”
Section: B Recent Pso Variantsmentioning
confidence: 99%
“…Therefore, further work is needed to validate their effectiveness on high-dimensional problems. The PSO variants presented in[77] [81] [84] [85] [96] did not provide any statistical analysis which is essential to show the significance and the superiority of these variants. Finally, the PSO variants in [82] [84] [85] [87] [89] [96] compared their performance with PSO variants without considering other robust and well-known optimization algorithms.…”
mentioning
confidence: 99%
“…PSO is an evolutionary optimization algorithm proposed by Kennedy and Eberhart in the 1990s [84] that uses swarms of particles in its search for the global optimum for a given problem. It was inspired by the social behavior of animals in search of food or prey [28], having as characteristics robustness and efficiency in the search for the global optimum [85]. PSO has been used in many fields of knowledge, such as vehicle routing, multi-objective optimization and control systems [86].…”
Section: Particle Swarm Optimization (Pso)mentioning
confidence: 99%