By Topic

Constrained multimodal function optimization using a simple evolutionary algorithm

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)
Kimura, S. ; Grad. Sch. of Eng., Tottori Univ., Tottori, Japan ; Matsumura, K.

Practical function optimization problems often con tain several constraints. Although evolutionary algorithms (EAs) have been successfully applied to unconstrained real-parameter optimization problems, it is sometimes difficult for these methods even to And feasible solutions in constrained ones. In this study, we thus propose a technique that makes EAs possible to solve function optimization problems with several inequality and a single equality constraints. The proposed technique simply forces individuals newly generated to satisfy the equality constraint. In order to generate these individuals, this study utilizes a Markov chain Monte Carlo (MCMC) method and crossover kernels. While the proposed technique can be applied to any EA, this study applies it to a relatively simple one, UNDX/MGG. Experimental results show that UNDX/MGG with the proposed technique has an ability to solve unimodal and multimodal function optimization problems with constraints. Finally, we show that, although our approach cannot solve function optimization problems with multiple equality constraints, we can convert some of them into those with a single equality constraint.

Published in:

Evolutionary Computation (CEC), 2011 IEEE Congress on

Date of Conference:

5-8 June 2011