Boost particle swarm optimization with fitness estimation

It is well known that the classical particle swarm optimization (PSO) is time-consuming when used to solve complex fitness optimization problems. In this study, we perform in-depth research on fitness estimation based on the distance between particles and affinity propagation clustering. In addition...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Natural computing Ročník 18; číslo 2; s. 229 - 247
Hlavní autori: Li, Lu, Liang, Yanchun, Li, Tingting, Wu, Chunguo, Zhao, Guozhong, Han, Xiaosong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.06.2019
Springer Nature B.V
Predmet:
Affinity
Algorithms
Artificial Intelligence
Clustering
Complex Systems
Computer Science
Evolutionary Biology
Fitness
Optimization algorithms
Particle swarm optimization
Processor Architectures
Propagation
Support vector machines
Theory of Computation
Fitness estimation
Support vector regression
Particle swarm optimization
Affinity propagation clustering algorithm
ISSN:1567-7818, 1572-9796
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:It is well known that the classical particle swarm optimization (PSO) is time-consuming when used to solve complex fitness optimization problems. In this study, we perform in-depth research on fitness estimation based on the distance between particles and affinity propagation clustering. In addition, support vector regression is employed as a surrogate model for estimating fitness values instead of using the objective function. The particle swarm optimization algorithm based on affinity propagation clustering, the efficient particle swarm optimization algorithm, and the particle swarm optimization algorithm based on support vector regression machine are then proposed. The experimental results show that the new algorithms significantly reduce the computational counts of the objective function. Compared with the classical PSO, the optimization results exhibit no loss of accuracy or stability.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-018-9699-5