Raw data and scripts from "A Topological Sorting Approach to Identify Congested Flowgates within Power Grids"

This paper proposes a new technique to identify sets of branches that form heavily loaded and potentially vulnerable flowgates within power grids. To this end, a directed acyclic graph is used to model the instantaneous state of power grids. One of the advantages of directed acyclic graphs is they allow the identification of where power flows are coherent e.g where power flows in a uniform direction along a set of branches that partition the network into two islands. This paper uses topological sorts to identify many sets of branches having this property. Definitions are provided for two new concepts, termed coherent cut-sets and coherent crack-sets, which are particular sets of branches extracted from a specific topological sort. Notably, there are numerous possible topological sorts for a directed acyclic graph and calculating distinctive topological sorts is challenging. In this paper a novel optimization algorithm is proposed to find multiple, diverse topological sorts each of which implies many cut-sets. The effectiveness of the proposed methods for enhancing grid observability and situational awareness is demonstrated using two standard test networks.本文提出一种新方法，用于识别电网中构成重载且潜在脆弱的潮流关口（flowgates）的支路集合。为此，本文采用有向无环图（Directed Acyclic Graph）对电网的瞬时运行状态进行建模。有向无环图的优势之一在于，其可用于识别潮流呈现连贯性的区域——例如，沿一组将电网划分为两个孤岛的支路、且潮流方向统一的区域。本文采用拓扑排序（Topological Sort）识别出大量具备该特性的支路集合。本文针对两个新概念给出定义，分别为连贯割集（coherent cut-sets）与连贯裂纹割集（coherent crack-sets），二者均为从特定拓扑排序中提取的特殊支路集合。值得注意的是，有向无环图存在多种可行的拓扑排序方案，而求解具有区分度的拓扑排序颇具挑战性。为此，本文提出一种新颖的优化算法，用于获取多个多样化的拓扑排序，每一种拓扑排序均可推导出大量割集。本文通过两个标准测试电网，验证了所提方法在提升电网可观性与态势感知能力方面的有效性。