2022
DOI: 10.1109/access.2022.3179470
|View full text |Cite
|
Sign up to set email alerts
|

A Fast and Scalable Transmission Switching Algorithm for Boosting Resilience of Electric Grids Impacted by Extreme Weather Events

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…This explicit consideration of switching actions is the minimisation of the Euclidean distance w l (z * l − 𝛼 l ) 2 between the binary variables z l and the base topology that considers all lines as available 𝛼 |Ω| l ∈ {1} |Ω| , where w l is a weighting parameter. The physical constraints that ensure the capacity of power systems are met are in Equations ( 2)-( 5) and the big-M method in Equations ( 6) and (7) ensures that when a line is switched off (z l = 0), the line flow constraints on other lines that share same bus connections remain active.  in Equation (8) sets an upper bound for the number of transmission lines that can be switched at all times.…”
Section: Heuristic Approachesmentioning
confidence: 99%
See 3 more Smart Citations
“…This explicit consideration of switching actions is the minimisation of the Euclidean distance w l (z * l − 𝛼 l ) 2 between the binary variables z l and the base topology that considers all lines as available 𝛼 |Ω| l ∈ {1} |Ω| , where w l is a weighting parameter. The physical constraints that ensure the capacity of power systems are met are in Equations ( 2)-( 5) and the big-M method in Equations ( 6) and (7) ensures that when a line is switched off (z l = 0), the line flow constraints on other lines that share same bus connections remain active.  in Equation (8) sets an upper bound for the number of transmission lines that can be switched at all times.…”
Section: Heuristic Approachesmentioning
confidence: 99%
“…The KNN heuristic is based on Johnson [7] where a mapping exists between vectors of OCs X and the known DC optimal switching instances ffalse(Xfalse)$f(X)$ resulting in a set normalΩS$\Omega ^S$ of TS solved instances. The KNN heuristic trains on the training data normalΩS$\Omega ^S$, and in real‐time chooses k instances that are similar to a candidate OC X based on the Euclidean distance or l$l_{\infty }$‐norm.…”
Section: Heuristic Approachesmentioning
confidence: 99%
See 2 more Smart Citations
“…TS aware mixed-integer linear programming model is developed for multi-scenario transmission network expansion planning (TNEP) problem [23]. Moreover, TS is also used for LSR [24], [25], which is the main focus of this paper. Despite of all its advantages, TS is being used by industries on limited occasions [9], [26].…”
Section: Preliminaries a Transmission Switching (Ts)mentioning
confidence: 99%