By Topic

Hyper rectangle search based particle swarm algorithm for dynamic constrained multi-objective optimization problems

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)
Jingxuan Wei ; Sch. of Comput. Sci. & Technol., Xidian Univ., Xi''an, China ; Yuping Wang

In the real world, many optimization problems are dynamic constrained multi-objective optimization problems. This requires an optimization algorithm not only to find the global optimal solutions under a specific environment but also to track the trajectory of the varying optima over dynamic environments. To address this requirement, a hyper rectangle search based particle swarm algorithm is proposed for such problems. This algorithm employs a hyper rectangle search to predict the optimal solutions (in variable space) of the next time step. Then, a PSO based crossover operator is used to deal with all kinds of constraints appearing in the problems when the time step (environment) is fixed. This algorithm is tested and compared with two well known algorithms on a set of benchmarks. The results show that the proposed algorithm can effectively track the varying Pareto fronts over time.

Published in:

Evolutionary Computation (CEC), 2012 IEEE Congress on

Date of Conference:

10-15 June 2012