bjoern/pypsa-eur
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

Fix simplify_network.py to handle more complex topologies (#1211)

Browse Source 
* Fixed simplify_network.py to handle more complex topologies, i.e. if two links are connected to nearby AC buses separated by an AC line.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Bobby Xiong 2024-08-14 10:24:38 +02:00 committed by GitHub
parent f263862455
commit 3ef6d519d7
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
scripts/simplify_network.py
View File

@ -298,13 +298,24 @@ def simplify_links(
_, labels = connected_components(adjacency_matrix, directed=False) _, labels = connected_components(adjacency_matrix, directed=False)
labels = pd.Series(labels, n.buses.index) labels = pd.Series(labels, n.buses.index)
G = n.graph() # Only span graph over the DC link components
G = n.graph(branch_components=["Link"])
def split_links(nodes): def split_links(nodes):
nodes = frozenset(nodes) nodes = frozenset(nodes)
seen = set() seen = set()
supernodes = {m for m in nodes if len(G.adj[m]) > 2 or (set(G.adj[m]) - nodes)}
# Supernodes are endpoints of links, identified by having lass then two neighbours or being an AC Bus
# An example for the latter is if two different links are connected to the same AC bus.
supernodes = {
m
for m in nodes
if (
(len(G.adj[m]) < 2 or (set(G.adj[m]) - nodes))
or (n.buses.loc[m, "carrier"] == "AC")
)
}
for u in supernodes: for u in supernodes:
for m, ls in G.adj[u].items(): for m, ls in G.adj[u].items():