Set-Based Group Search Optimizer for Stochastic Many-Objective Optimal Power Flow

Abstract

The conventional optimal power flow (OPF) is confronted with challenges in tackling more than three objectives and the stochastic characteristics due to the uncertainty and intermittence of the RESs. However, there are few methods available that simultaneously address high-dimensional objective optimization and uncertainty handling. This paper proposes a set-based group search optimizer (SetGSO) to tackle the stochastic many-objective optimal power flow (MaOPF) of power systems penetrated with renewable energy sources. The proposed SetGSO depicts the original stochastic variables by set-based individuals under the evolutionary strategy of the basic GSO, without using repeated sampling or probabilistic information. Consequently, two metrics, hyper-volume and average imprecision, are introduced to transform the stochastic MaOPF into a deterministic bi-objective OPF, guaranteeing a much superior Pareto-optimal front. Finally, our method was evaluated on three modified bus systems containing renewable energy sources, and compared with the basic GSO using Monte Carlo sampling (GSO-MC) and a set-based genetic algorithm (SetGA) in solving the stochastic MaOPF. The numerical results demonstrate a saving of 90% of the computation time in the proposed SetGSO method compared to sampling-based approaches and it achieves improvements in both the hyper-volume and average imprecision indicators, with a maximum enhancement of approximately 30% and 7% compared to SetGA.