A Modified Invasive Weed Optimization Algorithm for Time-Modulated Linear Antenna Array Synthesis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86076849" target="_blank" >RIV/61989100:27240/10:86076849 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A Modified Invasive Weed Optimization Algorithm for Time-Modulated Linear Antenna Array Synthesis

Popis výsledku v původním jazyce

Time modulated antenna arrays attracted the attention of researchers for the synthesis of low/ultra-low side lobes in recent past. In this article we propose an improved variant of a recently developed ecologically inspired metaheuristic, well-known as Invasive Weed Optimization (IWO), to solve the real parameter optimization problem related to the design of time-modulated linear antenna arrays with ultra low Side Lobe Level (SLL), Side Band Level (SBL) and Main Lobe Beam Width (BWFN). We improvise theclassical IWO by introducing two parallel populations and a more explorative routine of changing the mutation step-size with iterations. Experimental results indicate that the proposed algorithm achieves better performance over the design problem as compared to the conventional Taylor Series based method and the only known metaheuristic approach based on the Differential Evolution (DE) algorithm.

Název v anglickém jazyce

A Modified Invasive Weed Optimization Algorithm for Time-Modulated Linear Antenna Array Synthesis

Popis výsledku anglicky

Time modulated antenna arrays attracted the attention of researchers for the synthesis of low/ultra-low side lobes in recent past. In this article we propose an improved variant of a recently developed ecologically inspired metaheuristic, well-known as Invasive Weed Optimization (IWO), to solve the real parameter optimization problem related to the design of time-modulated linear antenna arrays with ultra low Side Lobe Level (SLL), Side Band Level (SBL) and Main Lobe Beam Width (BWFN). We improvise theclassical IWO by introducing two parallel populations and a more explorative routine of changing the mutation step-size with iterations. Experimental results indicate that the proposed algorithm achieves better performance over the design problem as compared to the conventional Taylor Series based method and the only known metaheuristic approach based on the Differential Evolution (DE) algorithm.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)

ISBN

978-1-4244-8126-2

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

—

Název nakladatele

IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA

Místo vydání

NEW YORK

Místo konání akce

Spain

Datum konání akce

18. 7. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000287375802118