By Topic

An Effective Robust Optimization Based on Genetic 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
$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)
Takayuki Maruyama ; Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo ; Hajime Igarashi

Although probabilistic optimization methods based on genetic algorithm (GA) provides accurate results, its performance is sometimes considerably sensitive to parameter changes. Moreover, the constraints are violated due to such parameter changes. A robust GA which performs random perturbation during optimization processes has been applied to some mathematical problems to show that it works as fast as the usual GAs. An adequate elite reservation technique for the robust GA is presented and applied to the robust GA for electromagnetic problems. Moreover, this method is shown to find solutions which are kept feasible against parameter changes.

Published in:

IEEE Transactions on Magnetics  (Volume:44 ,  Issue: 6 )