By Topic

Constrained optimization by the evolutionary algorithm with lower dimensional crossover and gradient-based mutation

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

7 Author(s)
Qing Zhang ; State Key Lab. of Geol. Processes & Miner. Resources, China Univ. of Geosci., Wuhan ; Sanyou Zeng ; Rui Wang ; Hui Shi
more authors

This paper proposes a new evolutionary algorithm with lower dimensional crossover and gradient-based mutation for real-valued optimization problems with constraints. The crossover operator of the new algorithm searches a lower dimensional neighbor of the parent points where the neighbor center is the barycenter of the parents, and therefore the new algorithm converges fast. The gradient-based mutation is used to converge fast for the problems with equality constraints and active inequality constraints. And the new algorithm is simple and easy to be implemented. We have used 24 constrained benchmark problems to test the new algorithm. The experimental results show it works better than or competitive to a known effective algorithm.

Published in:

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

Date of Conference:

1-6 June 2008