Synthesis of Linear Antenna Arrays Using Enhanced Firefly Algorithm

Nature inspired algorithms are finding extensive applications in real-world applications. Firefly algorithm (FA) is one such swarm intelligent algorithm introduced in the recent past. This algorithm has proved its competitiveness over standard benchmark and real-world applications, but suffers from...

Full description

Saved in:
Bibliographic Details
Published inArabian journal for science and engineering (2011) Vol. 44; no. 3; pp. 1961 - 1976
Main Authors Singh, Urvinder, Salgotra, Rohit
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 11.03.2019
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2193-567X
1319-8025
2191-4281
DOI10.1007/s13369-018-3214-2

Cover

More Information
Summary:Nature inspired algorithms are finding extensive applications in real-world applications. Firefly algorithm (FA) is one such swarm intelligent algorithm introduced in the recent past. This algorithm has proved its competitiveness over standard benchmark and real-world applications, but suffers from the problem of slow convergence speed. So, in order to overcome this problem, a modified FA approach called enhanced firefly algorithm (EFA) is proposed. The performance of the proposed EFA with respect to FA and other algorithms has been evaluated for eleven benchmark functions. The numerical results show that the novel method consistently provides better solution at a faster rate. Moreover, as a real-world application, EFA has been used for synthesis of linear antenna array for both equally and unequally spaced arrays. The results demonstrate that EFA provides reduced sidelobe level and faster convergence in comparison with algorithms like FA, biogeography-based optimization, cuckoo search, differential evolution, genetic algorithm, particle swarm optimization, tabu search and Taguchi method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2193-567X
1319-8025
2191-4281
DOI:10.1007/s13369-018-3214-2