Abstract
This paper presents a new heuristic method for maximum power point tracking (MPPT) in PV systems under normal and shadowing situations. The proposed method is a modification of the original queen honey bee migration (QHBM) to shorten the computation time for the maximum power point (MPP) in PV systems. QHBM initially uses random target locations to search for targets, in this case, MPP. So, we adjusted it to be able to do MPP point quests quickly. We accelerated the mQHBM learning process from the original randomly. We had fairly compared the mQHBM with several heuristics. Simulations were carried out with 2 scenarios to test the mQHBM. Based on the simulation results, it was found that mQHBM was able to exceed the capabilities of other methods such as original QHBM, particle swarm optimization (PSO) and perturb and observe (P&O), ANN, gray wolf (GWO), and cuckoo search (CS) in terms of MPPT speed and overshoot. However, the accuracy of mQHBM cannot exceed QHBM, ANN, and GWO. But still, mQHBM is better than PSO and P&O by about 15% and 18%, respectively. This experiment resulted in a gap of about 2% faster in speed, 0.34 seconds better in convergence time, and 0.2 fewer accuracies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Applied Computational Intelligence and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.