Impact of grid partitioning algorithms on combined distributed AC optimal power flow and parallel dynamic power grid simulation

The complexity of most power grid simulation algorithms scales with the network size, which corresponds to the number of buses and branches in the grid. Parallel and distributed computing is one approach that can be used to achieve improved scalability. However, the efficiency of these algorithms re...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET generation, transmission & distribution Ročník 14; číslo 25; s. 6133 - 6141
Hlavní autoři:	Kyesswa, Michael, Murray, Alexander, Schmurr, Philipp, Çakmak, Hüseyin, Kühnapfel, Uwe, Hagenmeyer, Veit
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	The Institution of Engineering and Technology 22.12.2020 Wiley
Témata:	AC OPF problem augmented Lagrangian based alternating direction inexact Newton method combined distributed AC optimal power flow computational complexity computational performance distributed algorithms distributed computing graph theory grid partitioning algorithms IEEE standard benchmark test networks IEEE standards KaFFPa Karlsruhe fast flow partitioner load flow METIS Newton method optimal grid partitioning strategy optimisation parallel algorithm parallel algorithms parallel computing parallel dynamic power grid simulation partitioned dynamic simulation problem partitioned OPF‐problem partitioned systems pattern clustering power grid partitionings power grid simulation algorithms power grids power system problems power system simulation Research Article spectral clustering augmented Lagrangian based alternating direction inexact Newton method power grid partitionings partitioned OPF-problem parallel dynamic power grid simulation graph theory power grid simulation algorithms power system simulation parallel algorithm distributed computing optimisation grid partitioning algorithms partitioned dynamic simulation problem optimal grid partitioning strategy combined distributed AC optimal power flow IEEE standard benchmark test networks IEEE standards power grids Newton method parallel computing spectral clustering computational performance Karlsruhe fast flow partitioner parallel algorithms partitioned systems pattern clustering KaFFPa distributed algorithms power system problems AC OPF problem METIS load flow computational complexity
ISSN:	1751-8687, 1751-8695
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	The complexity of most power grid simulation algorithms scales with the network size, which corresponds to the number of buses and branches in the grid. Parallel and distributed computing is one approach that can be used to achieve improved scalability. However, the efficiency of these algorithms requires an optimal grid partitioning strategy. To obtain the requisite power grid partitionings, the authors first apply several graph theory based partitioning algorithms, such as the Karlsruhe fast flow partitioner (KaFFPa), spectral clustering, and METIS. The goal of this study is an examination and evaluation of the impact of grid partitioning on power system problems. To this end, the computational performance of AC optimal power flow (OPF) and dynamic power grid simulation are tested. The partitioned OPF-problem is solved using the augmented Lagrangian based alternating direction inexact Newton method, whose solution is the basis for the initialisation step in the partitioned dynamic simulation problem. The computational performance of the partitioned systems in the implemented parallel and distributed algorithms is tested using various IEEE standard benchmark test networks. KaFFPa not only outperforms other partitioning algorithms for the AC OPF problem, but also for dynamic power grid simulation with respect to computational speed and scalability.
ISSN:	1751-8687 1751-8695
DOI:	10.1049/iet-gtd.2020.1393