By Topic

Analysis of the Computational Cost of Approximation-Based Hybrid Evolutionary Algorithms in Electromagnetic Design

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)
Guimaraes, F.G. ; Dept. de Eng. Eletr., Univ. Fed. de Minas Gerais, Belo Horizonte ; Lowther, D.A. ; Ramirez, J.A.

Approximation-based hybrid algorithms are a class of algorithms that employ local approximations in the local search phase of the optimization process. The local search is an important phase in the optimization process since it may represent a significant overhead in expensive-to-evaluate problems, as is the case in electromagnetic design. The hybrid algorithm should converge in less time than the conventional algorithm, in order to be useful in practice. In this work, we present a thorough analysis of the computational cost involved in approximation-based hybrid algorithms. We illustrate our analysis by comparing the performance of the conventional and hybrid algorithms in an analytical problem and in the design of the shape of the pole face of a magnetizer.

Published in:

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