Sequential network‐flow based power‐flow method for hybrid power systems
Abstract This paper presents a sequential network‐flow graph‐based method for a steady‐state power flow solution in hybrid multi‐terminal power systems. The proposed method is a unique and novel one, which differs from other established methods that involve the use of modified versions of classical...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-08-01
|
| Series: | IET Generation, Transmission & Distribution |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/gtd2.12185 |
| Summary: | Abstract This paper presents a sequential network‐flow graph‐based method for a steady‐state power flow solution in hybrid multi‐terminal power systems. The proposed method is a unique and novel one, which differs from other established methods that involve the use of modified versions of classical power flow methods. The proposed method formulates a power flow problem as a maximum network‐flow problem and solves it using a push‐relabel max‐flow algorithm. The solution procedure solves AC and DC parts sequentially, while accounting for voltage source converter losses using a generalised converter model. The proposed flow‐Augmenting method solves the power flow problem using matrix vector multiplication in its most abstract form, and it is independent of system parameters and network configuration. The proposed formulation is computationally efficient, as it is based on matrix vector multiplication, and is scalable, because the formulation works as a graph‐based method, which, inherently, allows for parallel computation for added computational speed. Further, unlike previously reported methods, the proposed method does not rely on Jacobian matrix formulation or any matrix inversion. This proves to be a strong advantage for the proposed method, as a significant reduction in computational time is observed, as a result. The proposed method is validated on 5‐bus hybrid system and CIGRE B4 DC system. |
|---|---|
| ISSN: | 1751-8687 1751-8695 |