Multi-Objective Reactive Power Optimization Based on Improved Particle Swarm Optimization With ε-Greedy Strategy and Pareto Archive Algorithm

Abstract

This paper proposes combining an improved particle swarm optimization and Pareto archive algorithm to solve the multi-objective reactive power optimization problem. The idea of $\varepsilon $ -greedy strategy is adopted and designed to improve particle swarm optimization algorithm. It makes some particles have stronger global search capability, meanwhile, others have stronger local search capability during the whole iteration process. Henceforth, the strategy significantly explores the possibility of optimal solution in local space at the early stage of the iteration, in addition, it mitigates the tendency to fall into the local optimal solution at the later stage of the iteration. The Pareto optimal solution selection problem is solved by minimizing the sum of the difference between each objective function and its optimal solution. The proposed approach is tested on IEEE39-bus and IEEE118-bus system, and it is demonstrated that the proposed approach not only restores the nodes voltage to the normal range and achieves better value for each objective function, but also outperforms other algorithms including standard particle swarm optimization and non-dominated sorting genetic algorithm II(NSGA-II).