Generalised representation of multi‐terminal VSC‐HVDC systems for AC–DC power flow studies

This study presents a generalised representation of voltage source converter (VSC) based high voltage direct current (HVDC) systems appropriate for power flow studies using the Newton–Raphson method. To reach this aim, the active loads and ideal synchronous machines are employed in order to incorpor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Energy systems integration 2020-03, Vol.2 (1), p.50-58
Hauptverfasser: Karami, Ehsan, Gharehpetian, Gevork B., Mohammadpour, Hadi, Khalilinia, Ahmad, Bali, Afshar
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study presents a generalised representation of voltage source converter (VSC) based high voltage direct current (HVDC) systems appropriate for power flow studies using the Newton–Raphson method. To reach this aim, the active loads and ideal synchronous machines are employed in order to incorporate both converter losses and power balance, respectively. Also, considering different aspects of computer implementation, the proposed solution method uses the conventional Newton–Raphson method. The proposed representation considers practical restrictions, switching and conduction losses of semiconductors, and different control strategies for VSC‐HVDC stations. Moreover, the proposed generalised representation of VSC‐HVDC systems can be easily extended to incorporate the multi‐terminal VSC‐HVDC grids in an efficient manner. To investigate the application of the proposed representation for VSC‐HVDC systems and load flow solution, three test systems including the standard IEEE 30 bus and IEEE two area RTS‐96 networks are used and discussion on results is provided. Results show that the proposed algorithm is able to solve AC–DC power flow problems very efficiently with considerably less time in comparison to other existing algorithms.
ISSN:2516-8401
2516-8401
DOI:10.1049/iet-esi.2019.0051