By Topic

Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites

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)
T. Takahama ; Department of Intelligent Systems, Hiroshima City University, Asaminami-ku, Hiroshima, 731-3194 Japan (email: ; S. Sakai

While research on constrained optimization using evolutionary algorithms has been actively pursued, it has had to face the problem that the ability to solve multi-modal problems, which have many local solutions within a feasible region, is insufficient, that the ability to solve problems with equality constraints is inadequate, and that the stability and efficiency of searches is low. We proposed the epsivDE, defined by applying the epsiv constrained method to a differential evolution (DE). DE is a simple, fast and stable population based search algorithm that is robust to multi-modal problems. The epsivDE is improved to solve problems with many equality constraints by introducing a gradient-based mutation that finds feasible point using the gradient of constraints at an infeasible point. Also the epsivDE is improved to find feasible solutions faster by introducing elitism where more feasible points are preserved as feasible elites. The improved epsivDE realizes stable and efficient searches that can solve multi-modal problems and those with equality constraints. The advantage of the epsivDE is shown by applying it to twenty four constrained problems of various types.

Published in:

2006 IEEE International Conference on Evolutionary Computation

Date of Conference:

16-21 July 2006