By Topic

Constrained optimization based on a multiobjective 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

3 Author(s)
Angantyr, A. ; Dept. of Appl. Phys. & Mech. Eng., Lulea Univ. of Technol., Sweden ; Andersson, J. ; Aidanpaa, J.-O.

A criticism of evolutionary algorithms (EAs) might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search problems is to use penalty methods. EAs have received increased interest during the last decade due to the ease of handling multiple objectives. A constrained optimization problem or an unconstrained multiobjective problem may in principle be two different ways to pose the same underlying problem. In this paper, an alternative approach for the constrained optimization problem is presented. The method is a variant of a multiobjective real coded genetic algorithm (GA) inspired by the penalty approach. It is evaluated on six different constrained single objective problems found in the literature. The results show that the proposed method performs well in terms of efficiency, and that it is robust for a majority of the test problems.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:3 )

Date of Conference:

8-12 Dec. 2003