A generic power flow formulation for flexible modeling and fast solving for large-scale unbalanced networks

Bennani, Hakim; Chebak, Ahmed; Ouafi, Abderrazak El

doi:10.1016/j.ijepes.2023.108956

Cited by 4 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, the dynamic parameters approach presented in [23] is extended to avoid the symbolic factorizations related to the change in network topology. Herein, the constraint equation enforcing the outage of the equipment ( f c ) and its associated parameter (λ c ) are incorporated in the original formulation as follows:…”

Section: Outage Modelingmentioning

confidence: 99%

“…The synchronous generator (SG) is modeled as variable susceptance and conductance (G and B) [23]. The latter two (G and B) are defined in the model as internal state variables which are solved to satisfy the power flow constraints of the machine.…”

Section: Generator Outagementioning

confidence: 99%

“…The proposed approach is completely generic and can easily accommodate the simultaneous outages of k-branches in the network (i.e., N-k contingency analysis) with the possibility to include any remedial actions that consist of putting in new service elements. This paper uses the power flow solver based on GFMA formulation to solve the power flow problem [23]. The algorithm of GFMA is based on the rigorous full Newton-Raphson approach and relies on the automatic adjustment technique, which provides an accurate and fast power flow solution.…”

mentioning

confidence: 99%

“…The inputs and outputs represent the interface between the model and the system. The readers can refer to [23] for more details.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Unique Symbolic Factorization for Fast Contingency Analysis Using Full Newton–Raphson Method

2023

Self Cite

View full text Add to dashboard Cite

Contingency analysis plays an important role in assessing the static security of a network. Its purpose is to check whether a system can operate safely when some elements are out of service. In a real-time application, the computational time required to perform the calculation is paramount for operators to take immediate actions to prevent cascading outages. Therefore, the numerical performance of the contingency analysis is the main focus of this current research. In power flow calculation, when solving the network equations with a sparse matrix solver, most of the time is spent factorizing the Jacobian matrix. In terms of computation time, the symbolic factorization is the costliest operation in the LU (Lower-upper) factorization process. This paper proposes a novel method to perform the calculation with only one symbolic factorization using a full Newton–Raphson-based generic formulation and modular approach (GFMA). The symbolic factorization retained can be used during the iterations of any power flow contingency scenario. A computer study demonstrates that reusing the same symbolic factorization greatly reduces computation time and improves numerical performance. Power system security assessment under N-1 and N-2 contingency conditions is performed for the IEEE standard 54-bus and 108-bus to evaluate the numerical performance of the proposed method. A comparison with the conventional power flow method shows that the time required for the analysis is shortened considerably, with a minimum gain of 228%. The comparative analysis demonstrates that the proposed solution has better numerical performance for large-scale networks.

show abstract

Section: Outage Modelingmentioning

confidence: 99%

Section: Generator Outagementioning

confidence: 99%

mentioning

confidence: 99%

“…The inputs and outputs represent the interface between the model and the system. The readers can refer to [23] for more details.…”

mentioning

confidence: 99%

See 2 more Smart Citations