Steady state particle swarm

Miniatura indisponível

Data

2019

Título da revista

ISSN da revista

Título do Volume

Editora

PeerJ Inc.

Resumo

This paper investigates the performance and scalability of a new update strategy for the particle swarm optimization (PSO) algorithm. The strategy is inspired by the Bak–Sneppen model of co-evolution between interacting species, which is basically a network of fitness values (representing species) that change over time according to a simple rule: the least fit species and its neighbors are iteratively replaced with random values. Following these guidelines, a steady state and dynamic update strategy for PSO algorithms is proposed: only the least fit particle and its neighbors are updated and evaluated in each time-step; the remaining particles maintain the same position and fitness, unless they meet the update criterion. The steady state PSO was tested on a set of unimodal, multimodal, noisy and rotated benchmark functions, significantly improving the quality of results and convergence speed of the standard PSOs and more sophisticated PSOs with dynamic parameters and neighborhood. A sensitivity analysis of the parameters confirms the performance enhancement with different parameter settings and scalability tests show that the algorithm behavior is consistent throughout a substantial range of solution vector dimensions.

Descrição

PeerJ Computer Science

Palavras-chave

MODELO BAK–SNEPPEN, OTIMIZAÇÃO POR ENXAME DE PARTÍCULAS, OTIMIZAÇÃO, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL, BAK–SNEPPEN MODEL, PARTICLE SWARM OPTIMIZATION, OPTIMIZATION, ALGORITHMS, ARTIFICIAL INTELLIGENCE

Citação

Fernandes , C M , Fachada , N , Merelo , J J & Rosa , A C 2019 , ' Steady state particle swarm ' , PeerJ Computer Science , vol. 2019 , no. 8 , e202 . https://doi.org/10.7717/peerj-cs.202

URI