PARETO OPTIMAL YAGI-UDA ANTENNA DESIGN USING MULTI-OBJECTIVE DIFFERENTIAL EVOLUTION
Author(s) -
Sotirios K. Goudos,
Katherine Siakavara,
E. Vafiadis,
John N. Sahalos
Publication year - 2010
Publication title -
electromagnetic waves
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 89
eISSN - 1559-8985
pISSN - 1070-4698
DOI - 10.2528/pier10052302
Subject(s) - mathematical optimization , differential evolution , genetic algorithm , sorting , evolutionary algorithm , multi objective optimization , antenna (radio) , solver , pareto principle , computer science , maximization , reduction (mathematics) , algorithm , mathematics , telecommunications , geometry
Antenna design problems often require the optimization of several con∞icting objectives such as gain maximization, sidelobe level (SLL) reduction and input impedance matching. Multi- objective Evolutionary Algorithms (MOEAs) are suitable optimization techniques for solving such problems. An e-cient algorithm is Generalized Difierential Evolution (GDE3), which is a multi-objective extension of Difierential Evolution (DE). The GDE3 algorithm can be applied to global optimization of any engineering problem with an arbitrary number of objective and constraint functions. Another popular MOEA is Nondominated Sorting Genetic Algorithm- II (NSGA-II). Both GDE3 and NSGA-II are applied to Yagi-Uda antenna design under specifled constraints. The numerical solver used for antenna parameters calculations is SuperNEC, an object-oriented version of the numerical electromagnetic code (NEC-2). Three difierent Yagi-Uda antenna designs are considered and optimized. Pareto fronts are produced for both algorithms. The results indicate the advantages of this approach and the applicability of this design method.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom