Dynamic Topologies for Particle Swarms

The Particle Swarm Optimization PSO algorithm is a population-based metaheuristics in which the individuals communicate through decentralized networks. The network can be of many forms but traditionally its structure is predetermined and remains fixed during the search. This paper investigates an alternative approach. The particles are positioned on a 2-dimensional grid of nodes. During the run, they move through the network according to simple rules, while interacting with each other using signs that they leave on the nodes. The links between the particles --- and consequently the information flow --- are then defined at each time step by the position of the particle on the grid. As a result, each particle's set of neighbors and connectivity degree varies during the search progress. The particles can move randomly or instead track signs left by other particles on the grid. In this paper, after a formal description of the general model, two different strategies random and sign-based are tested and compared to standard topologies on unimodal and multimodal functions, including a rotated and a shifted function with noise from the CEC benchmark. The experiments demonstrate that the dynamics provided by the proposed structure results in a more consistent and stable performance throughout the test set. The working mechanisms of the model are simple and easy to implement.

[1]  P.-P. Grasse.  La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

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

[3]  Michael N. Vrahatis,et al.  Unified Particle Swarm Optimization in Dynamic Environments , 2005, EvoWorkshops.

[4]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[5]  Konstantinos E. Parsopoulos,et al.  UPSO: A Unified Particle Swarm Optimization Scheme , 2019, International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004).

[6]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[7]  Roberto Schirru,et al.  PSO with Dynamic Topology and Random Keys method applied to Nuclear Reactor Reload , 2015 .

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

[9]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[10]  Shang-Jeng Tsai,et al.  Efficient Population Utilization Strategy for Particle Swarm Optimizer , 2009, IEEE Trans. Syst. Man Cybern. Part B.

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

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

[13]  Cen Cao,et al.  A new dynamic probabilistic Particle Swarm Optimization with dynamic random population topology , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[14]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.