Post
Clustering buses based on electrical distance
image credit: by my own
Your access to Member Features is limited.
Please sign in or apply for membership to continue reading this post.First, the shortest electric path between each pair of nodes is obtained in IEEE 118 bus system it requires solving 118*117/2 LP calculations.
Next, the network is clustered into K centres based on the electrical distances between buses. For each K, the centre of clusters + the nodes belonging to each cluster are found.
One application:
Which K buses are the closest buses to the rest of the network ?
What will happen if these busses are interrupted ?
The (LP formulated) shortest path problem was obtained in https://lnkd.in/eUh4Xe4
The clustering is MILP and is solved with #gurobi in #Pyomo environment.
Thank Soroudi for the Post!
Energy Central contributors share their experience and insights for the benefit of other Members (like you). Please show them your appreciation by leaving a comment, 'liking' this post, or following this Member.
Sign in to Participate