By Topic

Multiobjective genetic algorithms applied to solve 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

2 Author(s)
Dias, A.H.F. ; Acesita Co., Timoteo, Brazil ; de Vasconcelos, J.A.

In this paper, we discuss multiobjective optimization problems solved by evolutionary algorithms. We present the nondominated sorting genetic algorithm (NSGA) to solve this class of problems and its performance is analyzed by comparing its results with those obtained with four other algorithms. Finally, the NSGA is applied to solve the TEAM benchmark problem 22 without considering the quench physical condition to map the Pareto-optimum front. The results in both analytical and electromagnetic problems show its effectiveness

Published in:

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