Extended experimental study on PSO with partial population restart based on complex network analysis

This extended study presents a hybridization of particle swarm optimization (PSO) with complex network construction and analysis. A partial population restart is performed in certain moments of the run of the algorithm based on the information obtained from a complex network analysis. The complex network structure represents the communication in the population. We present experimental results of the method alongside with statistical evaluation and discuss future possibilities of this approach. The main goal of the work is not to propose a new highly competitive PSO variant but to present the possibility of using the unconventional tool as an alternative to conventional diversity measures. The main benefit of the network analysis is that it has same-time requirements regardless of the dimension of the problem.

[1]  Ivan Zelinka.  Investigation on Relationship between Complex Networks and Evolutionary Algorithms Dynamics , 2011 .

[2]  Michal Pluhacek,et al.  Particle swarm optimization algorithm driven by multichaotic number generator , 2014, Soft Computing.

[3]  Ponnuthurai N. Suganthan,et al.  Recent advances in differential evolution - An updated survey , 2016, Swarm Evol. Comput..

[4]  Michal Pluhacek,et al.  Complex Network Analysis of Discrete Self-organising Migrating Algorithm , 2014 .

[5]  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).

[6]  Roman Senkerik,et al.  Do Evolutionary Algorithm Dynamics Create Complex Network Structures? , 2011, Complex Syst..

[7]  Mohammad Mehdi Ebadzadeh,et al.  A novel particle swarm optimization algorithm with adaptive inertia weight , 2011, Appl. Soft Comput..

[8]  Wei Wang,et al.  A fast restarting particle swarm optimizer , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[9]  Thomas Stützle,et al.  Ant Colony Optimization and Swarm Intelligence, 5th International Workshop, ANTS 2006, Brussels, Belgium, September 4-7, 2006, Proceedings , 2006, ANTS Workshop.

[10]  Konstantinos G. Margaritis,et al.  On benchmarking functions for genetic algorithms , 2001, Int. J. Comput. Math..

[11]  Dirk Sudholt,et al.  Computational complexity of evolutionary algorithms, hybridizations, and swarm intelligence , 2008 .

[12]  Roman Senkerik,et al.  Evolutionary Dynamics as The Structure of Complex Networks , 2013, Handbook of Optimization.

[13]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

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

[15]  Bilal Alatas,et al.  Chaotic bee colony algorithms for global numerical optimization , 2010, Expert Syst. Appl..

[16]  Roman Senkerik,et al.  Chaos driven evolutionary algorithms for the task of PID control , 2010, Comput. Math. Appl..

[17]  Michal Pluhacek,et al.  Complex network analysis of differential evolution algorithm applied to flowshop with no-wait problem , 2014, 2014 IEEE Symposium on Differential Evolution (SDE).

[18]  M. Newman.  Mathematics of networks , 2018, Oxford Scholarship Online.

[19]  Jacques Riget,et al.  A Diversity-Guided Particle Swarm Optimizer - the ARPSO , 2002 .

[20]  Luigi Fortuna,et al.  Chaotic sequences to improve the performance of evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[21]  Stefan Burr,et al.  The Mathematics of networks , 1982 .