Abstract

ABSTRACT Reactive power optimisation can effectively reduce active power loss and improve voltage quality, which is a great significance for power system planning. When the reactive power optimisation problem is solved by Harris Hawk optimisation (HHO) algorithm, there are slow convergence and falling into local optima. This is caused by the multiple random parameters in HHO’s exploration phase. To solve this problem, the Improved Logistic Chaotic mapping, Sine and Cosine Algorithm (SCA), the dynamic adaptive inertia weights and greedy strategy are introduced; the aim is to speed up convergence, reduce blind spots and improve the search capability. The improved algorithm was tested on the classical 23 benchmark functions; Wilcoxon’s signed-rank test and Friedman test were tested, the results show that the improved algorithm can obtain better performance. The improved algorithm is applied to the reactive power optimisation problem in distribution networks with distributed generators (DG). When the reactive power optimisation problem is solved by the improved algorithms HHO, WOA, CSO, CS and PSO, respectively, the improved algorithm can obtain the lowest active power loss. Compared with no optimisation, active power loss is reduced by 33.19%. Finally, the node voltage quality ensures the safe operation of the system.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call