By Topic

A greedy genetic algorithm for continuous variables electromagnetic optimization problems

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)
Fanni, A. ; Dipartimento di Ingegneria Elettrica ed Elettronica, Cagliari, Italy ; Marchesi, M. ; Serri, A. ; Usai, M.

A greedy genetic algorithm for continuous variables electromagnetic optimization problems is presented. The presented algorithm is characterized by the use of a nonlinear simplex method as a principal optimizer, and of a greedy genetic algorithm to explore the search space, realizing a balance between diversity and a bias toward fitter individuals. The resulting algorithm merges the efficiency typical of calculus-based search with the robustness typical of random methods. A detailed comparison of the performance obtained implementing several strategies is presented, using an electromagnetic design test problem

Published in:

Magnetics, IEEE Transactions on  (Volume:33 ,  Issue: 2 )