Synthesis of linear symmetric antenna arrays using improved bat algorithm

In this article, in order to solve the problem of linear array synthesis with upper and lower bounds and aperture constraints, the improved bat algorithm (IBA) is proposed. The IBA embeds an adaptive local search strategy to enhance population diversity. Compared with other algorithms in antenna sid...

Full description

Saved in:
Bibliographic Details
Published inMicrowave and optical technology letters Vol. 62; no. 6; pp. 2383 - 2389
Main Authors Pan, Yusheng, Zhang, Jiao
Format Journal Article
LanguageEnglish
Published Hoboken, USA John Wiley & Sons, Inc 01.06.2020
Wiley Subscription Services, Inc
Subjects
Algorithms
Antenna arrays
Antennas
Apertures
Computer simulation
constrained optimization problem
improved bat algorithm
linear antenna arrays
Linear arrays
Lower bounds
sidelobe level
Sidelobe reduction
Sidelobes
sparse arrays
Synthesis
Online AccessGet full text
ISSN0895-2477
1098-2760
DOI10.1002/mop.32303

Cover

More Information
Summary:In this article, in order to solve the problem of linear array synthesis with upper and lower bounds and aperture constraints, the improved bat algorithm (IBA) is proposed. The IBA embeds an adaptive local search strategy to enhance population diversity. Compared with other algorithms in antenna sidelobe suppression simulation, the bat algorithm has higher accuracy and effectiveness, and does not need to adjust too many parameters.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0895-2477
1098-2760
DOI:10.1002/mop.32303