By Topic

Multiobjective GA optimization using reduced models

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

4 Author(s)
Chafekar, D. ; Comput. Sci. Dept., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA ; Liang Shi ; Rasheed, K. ; Jiang Xuan

In this paper, we propose a novel method for solving multiobjective optimization problems using reduced models. Our method, called objective exchange genetic algorithm for design optimization (OEGADO), is intended for solving real-world application problems. For such problems, the number of objective evaluations performed is a critical factor as a single objective evaluation can be quite expensive. The aim of our research is to reduce the number of objective evaluations needed to find a well-distributed sampling of the Pareto-optimal region by applying reduced models to steady-state multiobjective GAs. OEGADO runs several GAs concurrently with each GA optimizing one objective and forming a reduced model of its objective. At regular intervals, each GA exchanges its reduced model with the others. The GAs use these reduced models to bias their search toward compromise solutions. Empirical results in several engineering and benchmark domains comparing OEGADO with two state-of-the-art multiobjective evolutionary algorithms show that OEGADO outperformed them for difficult problems.

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:35 ,  Issue: 2 )