Optimal Reduced Network Based on PSO-OPF-Kron Algorithm for Load Rejection Electromagnetic Transient Studies

Read full text
Authors: Kamile Fuchs, Rôman Kuiava, Thelma Solange Piazza Fernandes, Wagner F. S. Souza, Mateus Duarte Teixeira, Alexandre Rasi Aoki, Miguel A. Mikilita, Rafael Martins
Cited by: 0
References: 33

Abstract

Modern power systems have become increasingly complex, making the detailed modeling and analysis of large-scale networks computationally demanding and often impractical. Therefore, network reduction techniques are essential for representing a smaller area of interest while preserving the electrical behavior of the complete system. For electromagnetic transient (EMT) studies, such as load rejection analysis, reduced networks are commonly derived using classical methods like Kron reduction under maximum power transfer conditions. However, this approach can lead to discrepancies in load flow and short-circuit levels between the reduced and complete systems. In addition, Kron reduction may introduce negative resistances in the reduced-order model, compromising system stability by producing non-passive equivalents and potentially causing unrealistic or numerically unstable EMT simulations. To address these limitations, this paper proposes an optimization-based approach, termed PSO-OPF-Kron, which integrates Optimal Power Flow (OPF) with the Particle Swarm Optimization (PSO) algorithm to refine the equivalent network parameters. The method optimally determines power injections, bus voltages, transformer tap settings, and impedances to align the reduced model with the full system’s operating point and short-circuit levels. Validation on the IEEE 39-bus system demonstrates that the proposed method significantly improves accuracy and numerical stability, ensuring reliable EMT simulations for load rejection studies.

Fields of Study & Subjects

Power System Optimization and Stability Optimal Power Flow Distribution Model Reduction and Neural Networks

Publication details

Journal / source
Energies
Volume
19
Issue
2
Pages
321–321
Publication date
8 January 2026
Language
EN