IDEAS home Printed from https://ideas.repec.org/a/gvu/iroeea/v3y2021i4id281.html

An Overall Improved Ant Colony Optimization algorithm trained BPNN for PV MPPT

Author

Listed:
  • Jia-bao Chang
  • Fang-lin Niu
  • Tao Chen

Abstract

A novel PV MPPT algorithm based on the overall improved ant colony optimization algorithm-trained BP neural network (OIACO-BPNN) has been proposed in this paper to overcome the poor prediction accuracy and slow convergence rate of the BP Neural Network (BPNN). Firstly, the pheromone updating model of the Ant Colony Optimization (ACO) algorithm is improved, and the weight coefficient is added to improve the convergence rate of the ACO algorithm. Secondly, the optimal weight threshold of BPNN is updated by Overall Improved Ant Colony Optimization (OIACO) algorithm. Thirdly, the optimized BPNN is employed to predict the Maximum Power Point (MPP) voltage of the photovoltaic (PV) array. Finally, the deviation value between the voltage of the PV array and the predicted voltage is employed as the input of PID controller. In addition, the duty cycle of the Boost circuit is adjusted by PID controller to achieve MPPT. Matlab/Simulink is employed to verify the feasibility and effectiveness of the proposed MPPT algorithm. Simulation results illustrate that the OIACO-BPNN algorithm is superior to the ACO and the BPNN in prediction accuracy and tracking performance, moreover has a good robustness and response speed.

Suggested Citation

Handle: RePEc:gvu:iroeea:v:3:y:2021:i:4:id:281
DOI: 10.36548/jeea.2021.4.006
as

Download full text from publisher

File URL: https://irojournals.com/iroeea/article/view/281
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/iroeea/article/download/281/248
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jeea.2021.4.006?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:iroeea:v:3:y:2021:i:4:id:281. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/iroeea .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.