On how percolation threshold affects PSO performance

Authors:
Blanca Cases;Alicia D'Anjou;Abdelmalik Moujahid
Affiliations:
Computational Intelligence Group, University of the Basque Country, San Sebastián, Spain;Computational Intelligence Group, University of the Basque Country, San Sebastián, Spain;Computational Intelligence Group, University of the Basque Country, San Sebastián, Spain
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Year:
2012

Citing 6
Cited 0

The particle swarm optimization algorithm: convergence analysis and parameter selection

Information Processing Letters
Logic-oriented neural networks for fuzzy neurocomputing

Neurocomputing
Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power

Information Sciences: an International Journal
Editorial: Hybrid intelligent algorithms and applications

Information Sciences: an International Journal
Editorial: Editorial: New trends and applications on hybrid artificial intelligence systems

Neurocomputing
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Statistical evidence of the influence of neighborhood topology on the performance of particle swarm optimization (PSO) algorithms has been shown in many works. However, little has been done about the implications could have the percolation threshold in determining the topology of this neighborhood. This work addresses this problem for individuals that, like robots, are able to sense in a limited neighborhood around them. Based on the concept of percolation threshold, and more precisely, the disk percolation model in 2D, we show that better results are obtained for low values of radius, when individuals occasionally ask others their best visited positions, with the consequent decrease of computational complexity. On the other hand, since percolation threshold is a universal measure, it could have a great interest to compare the performance of different hybrid PSO algorithms.