Clustering buses based on electrical distance
- Apr 3, 2021 1:43 pm GMT
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.
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.
Get Published - Build a Following
The Energy Central Power Industry Network is based on one core idea - power industry professionals helping each other and advancing the industry by sharing and learning from each other.
If you have an experience or insight to share or have learned something from a conference or seminar, your peers and colleagues on Energy Central want to hear about it. It's also easy to share a link to an article you've liked or an industry resource that you think would be helpful.