By Topic

Solving Constrained Optimization Problems by the ε Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control

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
$33 $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)
Tetsuyuki Takahama ; Department of Intelligent Systems, Hiroshima City University, Asaminami-ku, Hiroshima, 731-3194 Japan. ; Setsuko Sakai

The epsiv constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the epsiv level comparison that compares the search points based on the constraint violation of them. We proposed the epsiv constrained particle swarm optimizer epsivPSO, which is the combination of the epsiv constrained method and particle swarm optimization. In the epsivPSO, the agents who satisfy the constraints move to optimize the objective function and the agents who don't satisfy the constraints move to satisfy the constraints. But sometimes the velocity of agents becomes too big and they fly away from feasible region. In this study, to solve this problem, we propose to divide agents into some groups and control the maximum velocity of agents adaptively by comparing the movement of agents in each group. The effectiveness of the improved epsivPSO is shown by comparing it with various methods on well known nonlinear constrained problems

Published in:

2006 IEEE Conference on Cybernetics and Intelligent Systems

Date of Conference:

7-9 June 2006