Transmission-Line Switching for Load Shed Prevention via an Accelerated Linear Programming Approximation of AC Power Flows

Brown, William Eric; Moreno-Centeno, Erick

doi:10.1109/tpwrs.2020.2969625

Cited by 31 publications

(34 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the computational difficulty, most of the literature related to the OTS problem has been focused on the DCOPF formulation, which is not in the scope of this survey. However, some OTS works are indeed based on the ACOPF (Khanabadi et al 2013;Barrows et al 2014;Bienstock and Muñoz 2015;Henneaux and Kirschen 2016;Hijazi et al 2017;Lan et al 2018;Lu et al 2018;Zhao et al 2019;Bélanger et al 2020;Brown and Moreno-Centeno 2020). In particular, Khanabadi and Ghasemi (2011) proposes an iterative scheme with the DC OTS problem and a subsequent verification of the ACOPF feasibility considering the new topology.…”

Section: Optimal Transmission Switchingmentioning

confidence: 99%

Mathematical programming formulations for the alternating current optimal power flow problem

et al. 2020

View full text Add to dashboard Cite

Power flow refers to the injection of power on the lines of an electrical grid, so that all the injections at the nodes form a consistent flow within the network. Optimality, in this setting, is usually intended as the minimization of the cost of generating power. Current can either be direct or alternating: while the former yields approximate linear programming formulations, the latter yields formulations of a much more interesting sort: namely, nonconvex nonlinear programs in complex numbers. In this technical survey, we derive formulation variants and relaxations of the alternating current optimal power flow problem.

show abstract

Section: Optimal Transmission Switchingmentioning

confidence: 99%

Mathematical programming formulations for the alternating current optimal power flow problem

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The problem with the existing LPAC algorithm is that its performance is slower than the CE/ESM method. Hence, the authors in [6] presented MIPAC which performs faster than LPAC. When seeking the best single switching action for the IEEE 118‐bus system, replacing CE/ESM by MIPAC results in an average speedup of approximately 2.3 times [6].…”

Section: Introductionmentioning

confidence: 99%

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Hussain

Alam

Hansen

et al. 2021

The Journal of Engineering

View full text Add to dashboard Cite

A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to (N‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned (N‐2) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSBmax). The LSBmax algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSBmax algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

show abstract

“…One method to find the potential TS candidate is by switching lines one at a time, known as complete enumeration (CE) [6], or exhaustive search method (ESM) [12]. An advantage of CE/ESM is the guarantee of finding a TS candidate for LSR should one exist, thus, making it the standard base case for comparing newer algorithms [6], [12]. CE/ESM performs well for small systems, but for larger systems with a multitude of lines CE/ESM becomes computationally prohibitive and is intractable.…”

Section: Introductionmentioning

confidence: 99%

“…For these reasons, [11] presented a computationally less expensive MIP heuristic algorithm (MIP-H) that allows only one TS per iteration to reduce the computational complexity of solving DCOLSR-TS. Reference [12] argues that DCOPF is a crude approximation of ACOPF-therefore DCOPF based TS models produce inaccurate results for the potential TS candidates-and presents an MIP model for AC power flows (MIPAC) by modifying 978-1-7281-8192-9/21/$31.00 ©2021 IEEE three computationally costly constraints of an existing mixedinteger linear optimization model called linear-programming approximation of AC power flows (LPAC) [14], [17]. When seeking the best single switching action for IEEE 118-bus system, replacing CE/ESM by MIPAC results in an average speedup of approximately 2.3 times.…”

Section: Introductionmentioning

confidence: 99%

A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction

Hussain¹,

Alam²,

Hansen³

et al. 2021

Preprint

View full text Add to dashboard Cite

We present a computationally improved heuristic algorithm for transmission switching (TS) to recover load shed. Research from the past showed that changing power system topology may control power flows and remove line congestion. Hence, TS may reduce the required load shed. One of the main challenges is to find a potential TS candidate in a suitable time. Here, we propose a novel heuristic method that is capable of finding the potential TS candidate faster than existing algorithms in literature. The proposed method is compatible with both the AC and DC optimal power flows (OPF). Three metrics are used to compare the proposed algorithm with the state-of-the-art from literature to show the speedup and accuracy achieved. The proposed method is implemented on the IEEE 30-bus system, PEGASE 89-bus system, IEEE 118-bus system, and Polish 2383-bus system. The results on the large-scale Polish 2383-bus system shows that the proposed algorithm is scalable to large real-world systems. Parallel computing is implemented to further improve the computational performance of the proposed algorithm.

show abstract

Transmission-Line Switching for Load Shed Prevention via an Accelerated Linear Programming Approximation of AC Power Flows

Cited by 31 publications

References 41 publications

Mathematical programming formulations for the alternating current optimal power flow problem

Mathematical programming formulations for the alternating current optimal power flow problem

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction

Contact Info

Product

Resources

About