Frequency Distribution of Candidate Solutions in Angle Modulated Particle Swarms

This paper investigates the frequency distribution of candidate solutions in the search space when angle modulation is applied to particle swarm optimisation (PSO). It is shown that angle modulated particle swarm optimisers (AMPSO) have non-uniform solution frequency distributions. A new technique is introduced to ensure that the frequency distribution of candidate solutions is uniform. The new technique is compared with AMPSO and three AMPSO variants, as well as binary PSO (BPSO) on a number of problem cases. It is shown that AMPSO algorithms obtain lower average fitness values on binary minimisation problems whose optimal solutions contain repetition. However, when optimal solutions do not contain repetition, AMPSO and its variants are at a clear disadvantage.

[1]  Wenxin Liu,et al.  Angle Modulated Particle Swarm Optimization Based Defensive Islanding of Large Scale Power Systems , 2007, 2007 IEEE Power Engineering Society Conference and Exposition in Africa - PowerAfrica.

[2]  Andries Petrus Engelbrecht,et al.  Critical considerations on angle modulated particle swarm optimisers , 2015, Swarm Intelligence.

[3]  Riccardo Poli,et al.  Mean and Variance of the Sampling Distribution of Particle Swarm Optimizers During Stagnation , 2009, IEEE Transactions on Evolutionary Computation.

[4]  Andries Petrus Engelbrecht,et al.  Angle Modulated Particle Swarm Variants , 2014, ANTS Conference.

[5]  M. A. Khanesar,et al.  A novel binary particle swarm optimization , 2007, 2007 Mediterranean Conference on Control & Automation.

[6]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[7]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

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

[9]  Cornelis J. Franken,et al.  PSO-based coevolutionary Game Learning , 2004 .

[10]  Andries Petrus Engelbrecht,et al.  A study of particle swarm optimization particle trajectories , 2006, Inf. Sci..

[11]  Andries Petrus Engelbrecht,et al.  A generalized theoretical deterministic particle swarm model , 2014, Swarm Intelligence.

[12]  Wenxin Liu,et al.  Slow Coherency and Angle Modulated Particle Swarm Optimization Based Islanding of Large Scale Power Systems , 2007, 2007 International Joint Conference on Neural Networks.

[13]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[14]  G. Pamparà,et al.  Angle modulated population based algorithms to solve binary problems , 2012 .

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

[16]  N. Franken,et al.  Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).