A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization

  • Authors:

  • Md Nasir;Swagatam Das;Dipankar Maity;Soumyadip Sengupta;Udit Halder;P. N. Suganthan

  • Affiliations:

  • Dept. of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore ...;Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata 700 108, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 6 ...;Dept. of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore ...;Dept. of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore ...;Dept. of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700 032, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore ...;Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata 700 108, India and School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 6 ...

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

The concept of particle swarms originated from the simulation of the social behavior commonly observed in animal kingdom and evolved into a very simple but efficient technique for optimization in recent past. Since its advent in 1995, the Particle Swarm Optimization (PSO) algorithm has attracted the attention of a lot of researchers all over the world resulting into a huge number of variants of the basic algorithm as well as many parameter selection/control strategies. PSO relies on the learning strategy of the individuals to guide its search direction. Traditionally, each particle utilizes its historical best experience as well as the global best experience of the whole swarm through linear summation. The Comprehensive Learning PSO (CLPSO) was proposed as a powerful variant of PSO that enhances the diversity of the population by encouraging each particle to learn from different particles on different dimensions, in the metaphor that the best particle, despite having the highest fitness, does not always offer a better value in every dimension. This paper presents a variant of single-objective PSO called Dynamic Neighborhood Learning Particle Swarm Optimizer (DNLPSO), which uses learning strategy whereby all other particles' historical best information is used to update a particle's velocity as in CLPSO. But in contrast to CLPSO, in DNLPSO, the exemplar particle is selected from a neighborhood. This strategy enables the learner particle to learn from the historical information of its neighborhood or sometimes from that of its own. Moreover, the neighborhoods are made dynamic in nature i.e. they are reformed after certain intervals. This helps the diversity of the swarm to be preserved in order to discourage premature convergence. Experiments were conducted on 16 numerical benchmarks in 10, 30 and 50 dimensions, a set of five constrained benchmarks and also on a practical engineering optimization problem concerning the spread-spectrum radar poly-phase code design. The results demonstrate very competitive performance of DNLPSO while locating the global optimum on complicated and multimodal fitness landscapes when compared with five other recent variants of PSO.