2019
DOI: 10.3390/e21090827
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Shannon Performance in a Multiobjective Particle Swarm Optimization

Abstract: Particle swarm optimization (PSO) is a search algorithm inspired by the collective behavior of flocking birds and fishes. This algorithm is widely adopted for solving optimization problems involving one objective. The evaluation of the PSO progress is usually measured by the fitness of the best particle and the average fitness of the particles. When several objectives are considered, the PSO may incorporate distinct strategies to preserve nondominated solutions along the iterations. The performance of the mult… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…This evolution has enabled them to merge theoretical principles from other science fields. For instance, Shannon entropy [ 21 , 22 , 23 ] has been used in a population distribution strategy based on historical information [ 41 ]. The study reveals a close relationship between the solutions’ diversity and the algorithm’s convergence.…”
Section: Related Workmentioning
confidence: 99%
“…This evolution has enabled them to merge theoretical principles from other science fields. For instance, Shannon entropy [ 21 , 22 , 23 ] has been used in a population distribution strategy based on historical information [ 41 ]. The study reveals a close relationship between the solutions’ diversity and the algorithm’s convergence.…”
Section: Related Workmentioning
confidence: 99%
“…In this area of computer science, evolutionary computation provides a framework for optimization schemes inspired by biological evolution [22][23][24][25][26]. In general, evolutionary computation leads to a family of population-based optimization algorithms [27,28], with a numerical trial and error meta-heuristic and probabilistic behavior [29][30][31][32][33]. An initial set of elements in a population (often called candidate solutions) are generated and successively updated by means of some logical rules including some random variations.…”
Section: Introductionmentioning
confidence: 99%