Neighborhood topologies in fully informed and best-of-neighborhood particle swarms

In this study, we vary the way an individual in the particle swarm interacts with its neighbors. The performance of an individual depends on population topology as well as algorithm version. It appears that a fully informed particle swarm is more susceptible to alterations in the topology, but with a good topology, it can outperform the canonical version

[1]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[2]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[3]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[4]  Brian Mullen,et al.  Operationalizing the effect of the group on the individual: A self-attention perspective , 1983 .

[5]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[6]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[7]  B. Latané.  The psychology of social impact. , 1981 .