By Topic

DNPSO: A Dynamic Niching Particle Swarm Optimizer for multi-modal optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nickabadi, A. ; Amirkabir Univ. of Technol., Tehran ; Ebadzadeh, M.M. ; Safabakhsh, R.

In this paper, a new variant of the PSO algorithm called dynamic niching particle swarm optimizer (DNPSO) is proposed. Similar to basic PSO, DNPSO is a global optimization algorithm in which the main population of the particles is divided into some sub-swarms and a group of free particles. A new sub-swarm forming algorithm is proposed. This new form of sub-swarm creation, combined with free particles which implement a cognition-only model of PSO, brings about a great balance between exploration and exploitation characteristics of the standard PSO. DNPSO is tested with some well-known and widely used benchmark functions and the results are compared with several PSO-based multi-modal optimization methods. The results show that in all cases, DNPSO provides the best solutions.

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008