Using network science to assess particle swarm optimizers

Particle swarm optimizers (PSO) have been extensively used in optimization problems, but the scientific community still lacks proper mechanisms to analyze the swarm behavior during the optimization (execution) process. In this paper, we propose to assess the swarm information flow based on particle interactions. We introduce the concept of the swarm influence graph to capture the information exchange between the particles in a given iteration during the execution of the algorithm. We propose that analysis of this graph to find its number of components and its overall structure may be used to define a fingerprint for the swarm search behavior. We simulated the PSO algorithm with three different communication topologies and we showed that each topology leads to different communication signatures. Also, we showed that, in the case of a dynamic topology, this signature is related to the stagnation of the swarm.

[1]  James Kennedy,et al.  The particle swarm: social adaptation of knowledge , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[2]  Kalyan Veeramachaneni,et al.  Fitness-distance-ratio based particle swarm optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[3]  Xiaodong Li,et al.  Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale , 2009 .

[4]  Marcos A. C. Oliveira,et al.  Using Network Science to Define a Dynamic Communication Topology for Particle Swarm Optimizers , 2012, CompleNet.

[5]  Andries P. Engelbrecht,et al.  Computational Intelligence: An Introduction , 2002 .

[6]  R. W. Dobbins,et al.  Computational intelligence PC tools , 1996 .

[7]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[8]  Fernando Buarque de Lima Neto,et al.  A novel search algorithm based on fish school behavior , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[9]  A. Barabasi,et al.  Spectra of "real-world" graphs: beyond the semicircle law. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  James Bamford.  Watch thy neighbor , 2016 .

[11]  José Neves,et al.  Watch thy neighbor or how the swarm can learn from its environment , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[12]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[13]  James Kennedy,et al.  Defining a Standard for Particle Swarm Optimization , 2007, 2007 IEEE Swarm Intelligence Symposium.

[14]  Yu-Xuan Wang,et al.  Particle Swarms with dynamic ring topology , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[15]  P. Suganthan.  Particle swarm optimiser with neighbourhood operator , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[16]  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.

[17]  S. N. Dorogovtsev,et al.  Spectra of complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Shi Ding-hua.  Spectra of Complex Networks and Its Applications , 2006 .

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

[20]  Jun Zhang,et al.  Evolutionary Computation Meets Machine Learning: A Survey , 2011, IEEE Computational Intelligence Magazine.

[21]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[22]  Yuhui Shi,et al.  Inertia Weight Adaption in Particle Swarm Optimization Algorithm , 2011, ICSI.

[23]  D. Cvetkovic,et al.  An Introduction to the Theory of Graph Spectra: Introduction , 2009 .

[24]  Alan Godoy,et al.  A Complex Neighborhood based Particle Swarm Optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[25]  Ying Tan,et al.  Particle Swarm Optimization Based on Self-organizing Topology Driven by Fitness , 2010, 2010 International Conference on Computational Aspects of Social Networks.

[26]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[27]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[28]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[29]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, ANTS Conference.

[30]  Martin Middendorf,et al.  A hierarchical particle swarm optimizer and its adaptive variant , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[32]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

[34]  Fernando Buarque de Lima Neto,et al.  Adaptive Clan Particle Swarm Optimization , 2011, 2011 IEEE Symposium on Swarm Intelligence.

[35]  D. Cvetkovic,et al.  An Introduction to the Theory of Graph Spectra: References , 2009 .