2016 8th International Conference on Electronics, Computers and Artificial Intelligence (ECAI) 2016
DOI: 10.1109/ecai.2016.7861100
|View full text |Cite
|
Sign up to set email alerts
|

Sparse array antenna optimization using genetic alghoritms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…It is a kind of evolutionary search algorithm to give solutions to optimization problems based on natural selection [5]. It starts with initializing the population of possible solutions by natural random selection, solutions are nothing but chromosomes [16]. The array of genes is called chromosomes, genes are the basic building blocks of the genetic algorithm [23].…”
Section: ░ 2 Genetic Algorithmmentioning
confidence: 99%
“…It is a kind of evolutionary search algorithm to give solutions to optimization problems based on natural selection [5]. It starts with initializing the population of possible solutions by natural random selection, solutions are nothing but chromosomes [16]. The array of genes is called chromosomes, genes are the basic building blocks of the genetic algorithm [23].…”
Section: ░ 2 Genetic Algorithmmentioning
confidence: 99%
“…Several evolutionary algorithms have been successfully used to optimize antenna array but yet there is a need for better performance; thus, past algorithms are being improved on and new ones are also developed. Here are some of the intelligent optimization algorithms that have been used for antenna array synthesis: genetic algorithms (GA) [12] [13] [14], particle swarm optimization (PSO) algorithms [15] [16], quantum particle swarm optimization (QPSO) [17], ant colony optimization (ACO) [18], selfadaptive differential evolution (SADE) [19], backtracking search optimization algorithm (BSA) [20], symbiotic organisms search (SOS) [21], compressed sensing (CS) [22], biogeography-based optimization (BBO) [23], firefly algorithm (FA) [24] [25], grey wolf optimization (GWO) [9], moth flame optimization (MFO) [26], modified wolf pack Algorithm (MWPA) [10], hybrid particle swarm optimization (PSO) and convex (CVX) optimization (PSO-CVX) [27], convex optimization [28] and several others. These algorithms have been applied on different type of antennas array which includes linear [7] [25] [21] [19] [22] [9] [26] [22], circular [29] [26], cylindrical [30], conformal [31] [32] [33], hexagonal arrays [34], time-modulated array [27] [28], and lot more.…”
Section: Introductionmentioning
confidence: 99%
“…This latter issue has attracted the interests of the research community since the 1960s [23][24][25][26][27], regaining attention in the more recent years thanks to its applicability to the emerging communication scenarios. Accordingly, several methods have been proposed in the literature for the synthesis of sparse antenna arrays by considering both stochastic and deterministic approaches [28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43]. Stochastic methods can rely on different strategies, including genetic algorithms [28,29], particle swarm optimization [30], differential evolution [31], and nature inspired techniques, such as the ant [32], whale [33], and grey wolf [34] optimization algorithms.…”
Section: Introductionmentioning
confidence: 99%