Skip to main content

Improved Flower Pollination Algorithm for Linear Antenna Design Problems

  • Conference paper
  • First Online:
Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1048))

Abstract

Flower pollination algorithm (FPA) is an evolutionary nature-inspired optimization technique, which mimics the pollinating behavior of flowers. FPA has a simple structure and has been applied to numerous problems in different fields of research. However, it has been found that it has poor exploration and exploitation capabilities. In this paper, to mitigate the problems of original FPA, a modified algorithm namely adaptive FPA (AFPA) has been proposed. In the modified algorithm, a four-fold population division has been followed for both global and local search phases. Moreover, to balance the local and global search, switching probability has been decreased exponentially with respect to iterations. For experimental testing, this algorithm has been further applied to antenna design problems. The aim is to optimize linear antenna array (LAA) in order to achieve minimum SLL in the radiation pattern to avoid antenna radiation in the undesired directions. The results of the proposed algorithm for same problems are compared with the results of popular algorithms such as particle swarm optimization (PSO), tabu search (TS), self-adaptive differential evolution (SADE), Taghchi’s method (TM), cuckoo search (CS), and biogeography-based optimization (BBO). The simulation results clearly indicate the superior performance of AFPA in optimizing LAA.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Yang, X.S.: Flower pollination algorithm for global optimization. In: International Conference on Unconventional Computing and Natural Computation, pp. 240–249. Springer, Berlin, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Sakib, N., Kabir, M.W.U., Subbir, M., Alam, S.: A comparative study of flower pollination algorithm and bat algorithm on continuous optimization problems. Int. J. Soft Comput. Eng. 4(2014), 13–19K (2014)

    Google Scholar 

  3. Salgotra, R., Singh, U.: A novel bat flower pollination algorithm for synthesis of linear antenna arrays. Neural Comput. Appl., 1–14 (2016)

    Google Scholar 

  4. Sharawi, M., Emary, E., Saroit, I.A., El-Mahdy, H.: Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int. J. Soft Comput. Eng. 4(3), 54–59 (2014)

    Google Scholar 

  5. Singh, U., Salgotra, R.: Synthesis of linear antenna array using flower pollination algorithm. Neural Comput. Appl., 1–11 (2016)

    Google Scholar 

  6. Wang, R., Zhou, Y.: Flower pollination algorithm with dimension by dimension improvement. Math. Probl. Eng. (2014)

    Google Scholar 

  7. Zhou, Y., Wang, R., Luo, Q.: Elite opposition-based flower pollination algorithm. Neurocomputing 188, 294–310 (2016)

    Article  Google Scholar 

  8. Valenzuela, L., Valdez, F., Melin, P.: Flower pollination algorithm with fuzzy approach for solving optimization problems. In: Nature-Inspired Design of Hybrid Intelligent Systems, pp. 357–369. Springer International Publishing, Cham (2017)

    Google Scholar 

  9. Ram, J.P., Rajasekar, N.: A novel flower pollination based global maximum power point method for solar maximum power point tracking. IEEE Trans. Power Electron. (2016)

    Google Scholar 

  10. Salgotra, R., Singh, U.: Application of mutation operators to flower pollination algorithm. Expert. Syst. Appl. (2017)

    Google Scholar 

  11. Khodier, M., Al-Aqeel, M.: Linear and circular array optimization: a study using particle swarm intelligence. PIER B 15, 347–373 (2009)

    Article  Google Scholar 

  12. Merad, L., Bendimerad, F., Meriah, S.: Design of linear antenna arrays for sidelobe reduction using the tabu search method. Int. Arab. J. Inf. Technol. 5(3), 219–222 (2008)

    Google Scholar 

  13. Sharaqa, A., Dib, N.: Design of linear and elliptical antenna arrays using biogeography based optimization. Arab. J. Sci. Eng. 39(4), 2929–2939 (2013)

    Article  Google Scholar 

  14. Dib, N., Goudos, S., Muhsen, H.: Application of taguchi’s optimization method and self-adaptive differential evolution to the synthesis of linear antenna arrays. PIER 102, 159–180 (2010)

    Article  Google Scholar 

  15. Saxena, P., Kothari, A.: Ant lion optimization algorithm to control side lobe level and null depths in linear antenna arrays. AEU-Int. J. Electron. Commun. 70(9), 1339–1349 (2017)

    Article  Google Scholar 

  16. Khodier, M.: Optimisation of antenna arrays using the cuckoo search algorithm. IET Microw. Antennas Propag. 7(6), 458–464 (2013)

    Article  Google Scholar 

  17. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)

    Article  Google Scholar 

  18. Chen, G., Huang, X., Jia, J., Min, Z.: Natural exponential inertia weight strategy in particle swarm optimization. In: The Sixth World Congress on  Intelligent Control and Automation, 2006. WCICA 2006, vol. 1, pp. 3672–3675. IEEE (2006)

    Google Scholar 

  19. Singh, U., Salgotra, R.: Optimal synthesis of linear antenna arrays using modified spider monkey optimization. Arab. J. Sci. Eng. 41(8), 2957–2973 (2016)

    Article  Google Scholar 

Download references

Acknowledgements

This work is sponsored under INSPIRE Fellowship (IF160215) by Directorate of Science and Technology, Govt. of India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rohit Salgotra .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Salgotra, R., Singh, U., Saha, S., Nagar, A.K. (2020). Improved Flower Pollination Algorithm for Linear Antenna Design Problems. In: Das, K., Bansal, J., Deep, K., Nagar, A., Pathipooranam, P., Naidu, R. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 1048. Springer, Singapore. https://doi.org/10.1007/978-981-15-0035-0_7

Download citation

Publish with us

Policies and ethics