A novel chaotic flower pollination algorithm for global maximum power point tracking for photovoltaic system under partial shading conditions

116Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A partial shading condition is an environmental phenomenon that causes multiple peaks in Photovoltaic (PV) characteristics. Introducing robust and reliable Maximum Power Point Tracking technique is essential in PV systems to extract the Global Maximum Power Point (GMPP) irrespective of the environmental conditions. Therefore in this manuscript, a novel optimization algorithm is implemented for MPPT. The developed technique named Chaotic Flower Pollination Algorithm (C-FPA) merges the chaos maps (Logistic, sine, and tent maps) to tune the basic algorithm parameters adaptively. The effectiveness of the introduced variants is proved using several patterns of partial shading condition. Moreover, these variants are certified for tracking the GMPP in case of dynamic and sudden variation in the irradiance conditions. Several statistical analysis is carried out to evaluate the performance of the proposed variants in comparison with the standard version of the Flower Pollination Algorithm (FPA). The significant outcome clarifies that combining the chaos maps with FPA improves the dependability and stability of the FPA and offers higher tracking efficiency with a reduction of tracking time by 50% when compared to FPA. Moreover, the proposed C-FPA provides a better dynamic response, especially with the tent chaos map.

Cite

CITATION STYLE

APA

Yousri, D., Babu, T. S., Allam, D., Ramachandaramurthy, V. K., & Etiba, M. B. (2019). A novel chaotic flower pollination algorithm for global maximum power point tracking for photovoltaic system under partial shading conditions. IEEE Access, 7, 121432–121445. https://doi.org/10.1109/ACCESS.2019.2937600

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free