Implementation of Flower Pollination Algorithm to the Design Optimization of Planar Antennas
[ X ]
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Link
Erişim Hakkı
info:eu-repo/semantics/restrictedAccess
Özet
Flower pollination algorithm (FPA) is an outstanding metaheuristic optimization approach among the recently emerged nature-inspired algorithms. It is built on pollination nature of the flowers, classifying into two categories: biotic and abiotic pollinations. It is observed that the performance of FPA has been well demonstrated through diverse engineering design problems, whereas its efficacy in the design optimization of planar antennas, which are the most important concealed elements in the wireless communication systems, is remained curious in the engineering research topics. In this chapter, FPA is hence applied to the design of planar antennas in order to optimize their shapes and dimensions for the objective function based on resonant bandwidth. The design optimization is carried out through a cooperating platform constituted in this work, communicating MATLAB® with a full-wave simulator named Hyperlynx® 3D EM. Four different planar antennas are hereby designed and optimized for modern wireless communication across a step-by-step procedure. The finally optimized antenna geometries are provided with elaborate dimensions and their performance parameters such as operating frequency band, radiation gain pattern, and peak gain are examined. Therefore, it is shown off that FPA is also effective and successful in the design optimization of planar antennas.
Açıklama
Anahtar Kelimeler
Kaynak
Applications of Flower Pollination Algorithm and its Variants
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Toktas, A., Üstün, D., ve Carbas, S. (2021). Implementation of Flower Pollination Algorithm to the Design Optimization of Planar Antennas. Applications of Flower Pollination Algorithm and its Variants. Springer Tracts in Nature-Inspired Computing. Springer, Singapore. https://doi.org/10.1007/978-981-33-6104-1_4
