Research on Reactive Power Optimization Based on Hybrid Osprey Optimization Algorithm

Abstract

This paper presents an improved osprey optimization algorithm (IOOA) to solve the problems of slow convergence and local optimality. First, the osprey population is initialized based on the Sobol sequence to increase the initial population’s diversity. Second, the step factor, based on Weibull distribution, is introduced in the osprey position updating process to balance the explorative and developmental ability of the algorithm. Lastly, a disturbance based on the Firefly Algorithm is introduced to adjust the position of the osprey to enhance its ability to jump out of the local optimal. By mixing three improvement strategies, the performance of the original algorithm has been comprehensively improved. We compared multiple algorithms on a suite of CEC2017 test functions and performed Wilcoxon statistical tests to verify the validity of the proposed IOOA method. The experimental results show that the proposed IOOA has a faster convergence speed, a more robust ability to jump out of the local optimal, and higher robustness. In addition, we also applied IOOA to the reactive power optimization problem of IEEE33 and IEEE69 node, and the active power network loss was reduced by 48.7% and 42.1%, after IOOA optimization, respectively, which verifies the feasibility and effectiveness of IOOA in solving practical problems.