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

Abstract

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.

A Digital Framework for Locally and Geographically Distributed Simulation of Power Grids

“…The real-time simulations within EGSAL are complemented by offline simulation and analysis tools together with the application of high-performance computing for efficient grid studies. [32,33] Furthermore, the co-simulation of multi-modal energy systems is a major topic of research within EGSAL to extend the analysis to coupled power, gas, and heat grids. [34,35] The coupling of such grids will play a significant role in achieving a smooth energy transition and reliable operation of future grids.…”

Asynchronous multi‐rate method of real‐time simulation for active distribution networks

“…With limited calculation resources, it is difficult to determine an appropriate time-step for each decoupled subsystem to simultaneously achieve both high simulation accuracy and time-step coordination with other subsystems, especially for the SMR real-time simulation with large numbers of subsystems. This problem may be alleviated by further decomposing the subnetworks and allocating abundant hardware resources [18,19]; however, this would increase the computational cost and communication burden [21].…”

Distributed Power Flow and Distributed Optimization -- Formulation, Solution, and Open Source Implementation

“…The present paper assumes that the partitioning of the grid is given. For insights on how to partition large grids in computationally advantageous ways we refer to [23,24,25].…”