By Topic

Comparison of several types of methods for solving constrained function 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
$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)
Kangxiu Hu ; School of Mathematics and Informational Sciences, East China Institute of Technology, Fuzhou, China, 344000 ; Bingxian Wang

Several types of methods for solving constrained function optimization problems are discussed in this paper including elite-subspace evolutionary algorithm (ESEA), multi-parent crossover evolutionary algorithm (MPCEA), smooth scheme and line search based particle swarm optimization (SLPSO) and Constrained Differential evolutionary algorithm (CDEA). Numerical simulation experiments show that CDEA is the best method. The approach can maintain population diversity and simple parameter setting and enable us to find the optimal solution within a fairly short period of time.

Published in:

Robotics and Applications (ISRA), 2012 IEEE Symposium on

Date of Conference:

3-5 June 2012