Particle Swarm Optimization with social exclusion and its application in electromagnetics

The behavior of Particle Swarm Optimization (PSO), a population based optimization algorithm, depends on the movements of the particles and the attractions among them. This behavior was extracted from the observations of the swarms in nature. Every swarm desires to remain powerful in order to survive in nature and to protect its descendants. Therefore, the weakest members in the swarm are isolated, and generally abandoned to live on their own resources. This act is known as social exclusion. In this research, this phenomenon is incorporated to PSO. At the early phase of time-line, the swarm is divided into two groups based on their cost/fitness values. Each group proceeds their own journey without the knowledge of other group. This new algorithm is named as Social Exclusion-PSO (SEPSO). First, the performance of this new algorithm was evaluated/compared with an inertia weight PSO via unimodal, multimodal, expended benchmark functions, and then, it is applied to the circular antenna array design problem. For each implementation, the performance of two sub-populations and the undivided population are presented to demonstrate and compare the behaviour of the socially excluded swarm. The results show that excluding the members with the worst cost values from the population increases the performance of the algorithm in terms of global best solution with approximately 20% smaller number of function evaluations.

[1]  Eric Michielssen,et al.  Genetic algorithm optimization applied to electromagnetics: a review , 1997 .

[2]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  M. Dessouky,et al.  EFFICIENT SIDELOBE REDUCTION TECHNIQUE FOR SMALL-SIZED CONCENTRIC CIRCULAR ARRAYS , 2006 .

[4]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  G. K. Mahanti,et al.  Comparative Performance of Gravitational Search Algorithm and Modified Particle Swarm Optimization Algorithm for Synthesis of Thinned Scanned Concentric Ring Array Antenna , 2010 .

[6]  Ozgur Ergul,et al.  Design and Simulation of Circular Arrays of Trapezoidal-Tooth Log-Periodic Antennas via Genetic Optimization , 2008 .

[7]  P. N. Suganthan,et al.  Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems , 2011 .

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

[9]  Chun Lu,et al.  An improved GA and a novel PSO-GA-based hybrid algorithm , 2005, Inf. Process. Lett..

[10]  Carlos A. Brizuela,et al.  A Comparison of Genetic Algorithms, Particle Swarm Optimization and the Differential Evolution Method for the Design of Scannable Circular Antenna Arrays , 2009 .

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

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