In this paper, we present a new meta-heuristic approach (memetic algorithm) to address multi-objective problems in planar phased arrays. Memetic algorithms are hybrid algorithms that combine the benefits of a global search evolutionary algorithm with a local search method. The Shuffled Frog-Leaping Algorithm (SFLA) consists of a virtual population of frogs partitioned into different memeplexes. It performs a memetic evolution within the memeplex (local search) and a shuffling mix process between memeplexes (global search) to deliver optimum solutions in optimization problems. Derived results show improved characteristics of the antenna array.
Phased Antenna Array Design using Shuffled Frog-Leaping Algorithm / Boursianis, Achilles; Patakakis, Kostas; Goudos, Sotirios K.; Salucci, Marco; Massa, Andrea. - STAMPA. - (2018), pp. 1845-1846. (Intervento presentato al convegno 2018 IEEE International Symposium on Antennas and Propagation & USNC/URSI National Radio Science Meeting tenutosi a Boston, MA nel 8th-13th July 2018) [10.1109/APUSNCURSINRSM.2018.8609068].
Phased Antenna Array Design using Shuffled Frog-Leaping Algorithm
Salucci, Marco;Massa, Andrea
2018-01-01
Abstract
In this paper, we present a new meta-heuristic approach (memetic algorithm) to address multi-objective problems in planar phased arrays. Memetic algorithms are hybrid algorithms that combine the benefits of a global search evolutionary algorithm with a local search method. The Shuffled Frog-Leaping Algorithm (SFLA) consists of a virtual population of frogs partitioned into different memeplexes. It performs a memetic evolution within the memeplex (local search) and a shuffling mix process between memeplexes (global search) to deliver optimum solutions in optimization problems. Derived results show improved characteristics of the antenna array.File | Dimensione | Formato | |
---|---|---|---|
APS-URSI.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
247.28 kB
Formato
Adobe PDF
|
247.28 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione