Polymorphic Particle Swarm Optimization

In recent years a swarm-based optimization methodology called Particle Swarm Optimization (PSO) has developed. If one wants to apply PSO one has to specify several parameters as well as to select a neighborhood topology. Several topologies being widely used can be found in literature. This raises the question, which one fits best to your application at hand. To get rid of this topology selection problem, a new concept called Polymorphic Particle Swarm Optimization (PolyPSO) is proposed. PolyPSO generalizes the standard update rule by a polymorphic update rule. The mathematical expression of this polymorphic update rule can be changed on symbolic level. This polymorphic update rule is an adaptive update rule changing symbols based on accumulative histograms and roulette-wheel sampling. PolyPSO is applied to four typical benchmark functions known from literature. In most cases it outperforms the other PSO variants under consideration. Since PolyPSO performs either as best or second best it can be used as alternative to solve this way the topology selection problem. Additionally, PolyPSO significantly outperforms the standard PSO methods in higher dimensional problems.

[1]  Michael N. Vrahatis,et al.  Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining Solution , 2005, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[3]  Yutian Liu,et al.  An adaptive PSO algorithm for reactive power optimization , 2003 .

[4]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[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]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

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

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

[10]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[11]  Alan F. Murray,et al.  IEEE International Conference on Neural Networks , 1997 .

[12]  Michael N. Vrahatis,et al.  Parameter selection and adaptation in Unified Particle Swarm Optimization , 2007, Math. Comput. Model..