By Topic

Comparison of NSGA and ELM for finding the Pareto front of multiple-criteria antenna optimization problem

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)
Olcan, D.I. ; Fac. of Electr. Eng., Belgrade Univ., Serbia ; Kolundzija, B.M.

We compared two optimization algorithms for finding the Pareto front of the one-antenna optimization problem. The first applied algorithm is nondominated sorting genetic algorithm (NSGA) that has proved itself over other variants of GA for finding the Pareto front by the mean of effectiveness. The second applied algorithm is the multiminima optimization algorithm based on the estimation of local minima (ELM), which has been restarted for different weighting factors used for forming the single cost-function. The comparison between these two algorithms is done in the sense of the total number of iterations (EM solver runs) needed for finding a good estimation of the Pareto front. The goal was to find the Pareto front in the optimization of a Yagi antenna for the highest possible forward gain and lowest reflection coefficient in the frequency range 295-305 MHz.

Published in:

Antennas and Propagation Society International Symposium, 2005 IEEE  (Volume:2A )

Date of Conference:

3-8 July 2005