Cart (Loading....) | Create Account
Close category search window
 

Dynamic Multi-Swarm Particle Swarm Optimizer with a Novel Constraint-Handling Mechanism

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

2 Author(s)
Liang, J.J. ; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, e-mail: liangjing@pmail.ntu.edu.sg ; Suganthan, P.N.

In this paper, a novel constraint-handling mechanism based on multi-swarm is proposed. Different from the existing constraints handling methods, the sub-swarms are adaptively assigned to explore different constraints according to their difficulties. The new mechanism is combined in dynamic multi-swarm optimizer (DMS-PSO) for handling constrained real-parameter optimization problems and sequential quadratic programming (SQP) method is combined to improve its local search ability. The performance of the modified DMS-PSO on the set of benchmark functions provided by CEC2006 [1] is reported.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

0-0 0

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.