Particle swarm optimisation based on self-organisation topology driven by different fitness rank

To explore the relations between the population structure and the performance of the particle swarm optimisation (PSO), the self-organisation population structure driven by fitness rank (SOTDFR) is developed. Meanwhile, to improve the performance of PSO, under invariable network size, the SOTDFR evolution involves two kinds of operations: adding and removing link. Moreover, due to the particles' fitness rank impacting heavily on the SOTDFR evolution, two kinds of fitness rank are designed and also SOTDFR according to different fitness rank designs is referred to as VSOTDFR and UVSOTDFR respectively. To make a deep insight, VSOTDFR-based PSO and UVSOTDFR-based PSO are used to solve two types of benchmarks: unimodal and multimodal functions. Simulation results demonstrate that UVSOTDFR-based PSO can generally obtain the better solution than VSOTDFR-based PSO within the allowed iterations. In addition, the performances of the UVSOTDFR-based PSO and some variants of PSO are compared. The simulation results show that UVSOTDFR-based PSO is competitive.

[1]  Tao Zhang,et al.  A novel hybrid particle swarm optimisation method applied to economic dispatch , 2010, Int. J. Bio Inspired Comput..

[2]  James M. Whitacre,et al.  Adaptation and self-organization in evolutionary algorithms , 2009, ArXiv.

[3]  Mohammed El-Abd,et al.  Information exchange in multiple cooperating swarms , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

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

[5]  B. Bollobás.  The evolution of random graphs , 1984 .

[6]  Girish Kumar Singh,et al.  A particle swarm optimisation based technique of harmonic elimination and voltage control in pulse-width modulated inverters , 2010, Int. J. Bio Inspired Comput..

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

[8]  Fan Chung Graham,et al.  Duplication Models for Biological Networks , 2002, J. Comput. Biol..

[9]  Lixia Xi,et al.  Quickly obtaining degree of polarisation ellipsoid by using particle swarm optimisation , 2010, Int. J. Bio Inspired Comput..

[10]  Edward Ott,et al.  Growing networks with geographical attachment preference: emergence of small worlds. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Veysel Gazi,et al.  Particle swarm optimization with dynamic neighborhood topology: Three neighborhood strategies and preliminary results , 2008, 2008 IEEE Swarm Intelligence Symposium.

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[14]  Christian Posthoff,et al.  Neighborhood Re-structuring in Particle Swarm Optimization , 2005, Australian Conference on Artificial Intelligence.

[15]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

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

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

[18]  Michael N. Vrahatis,et al.  Tackling magnetoencephalography with particle swarm optimization , 2009, Int. J. Bio Inspired Comput..

[19]  Zengzhen Shao,et al.  Particle Swarm Optimizer Based on Dynamic Neighborhood Topology , 2009, ICIC.

[20]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

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

[22]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.