2019 International Conference on Electromagnetics in Advanced Applications (ICEAA) 2019
DOI: 10.1109/iceaa.2019.8879031
|View full text |Cite
|
Sign up to set email alerts
|

Automated Design of Microstrip Patch Antenna Using Ant Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…Various optimization algorithms are commonly employed in the electromagnetic field to design antennas [ 6 ]. The most widely used algorithms are Genetic Algorithms (GA) [ 7 ], Particle Swarm Optimization (PSO) [ 8 ], Ant Colony Optimization (ACO) [ 9 ], Differential Evolution (DE) [ 10 ], and Grey Wolf Optimization (GWO) [ 11 ].…”
Section: Introductionmentioning
confidence: 99%
“…Various optimization algorithms are commonly employed in the electromagnetic field to design antennas [ 6 ]. The most widely used algorithms are Genetic Algorithms (GA) [ 7 ], Particle Swarm Optimization (PSO) [ 8 ], Ant Colony Optimization (ACO) [ 9 ], Differential Evolution (DE) [ 10 ], and Grey Wolf Optimization (GWO) [ 11 ].…”
Section: Introductionmentioning
confidence: 99%
“…Among these methods, conventional GA (combined with assignment simulation software) is stable and highly efficient. A version of the ant colony optimization (ACO) algorithm had been implemented to automatically design a microstrip patch antenna that operates at 3.5 GHz with a bandwidth of 50-170 MHz [22]. In [23], GA was used to develop a high-absorption, wideband metamaterial absorber.…”
Section: Introductionmentioning
confidence: 99%
“…Notwithstanding, the applicability of numerical algorithms to the generation of unconventional geometries is often demonstrated based on relatively simple, single-objective problems [28,29]. Furthermore, the optimization of generic models is normally undertaken using population-based routines (e.g., particle swarm optimization, genetic algorithms, or ant colony methods), which require thousands of evaluations to obtain the final solution [31,35,38,40]. To put that into perspective, in [41], the particle swarm algorithm required a total of 248 EM simulations to solve a set of 12 problems represented using only one input parameter.…”
Section: Introductionmentioning
confidence: 99%