Search NASA⌕ Search

SEARCH · Search NASA

Results for “Transmission switching (TS)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

5 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

An Improved Transmission Switching Algorithm for Managing Post-(N-1) Contingencies in Electricity Networks

In this presentation, we detail the shortcomings of existing transmission switching (TS) methodologies for preventing post-contingency loss of load in wide area electric power networks. Following that, we present a bi-level algorithm as an improvement to the state of the art. We show proof-of-concept level results that indicate computational viability, fast solutions, and the ability to pick the same best candidate as non computationally viable methods. Further, our method also minimizes load shedding after the contingency, thus enhancing the reliability and security of electricity supply. We also include a futuristic scenario of increased renewables and decreased natural gas sourced generators to show promising results. We grant permission for our presentation to be recorded and uploaded by the conference organizers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

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

Abstract 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‐ ) 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 (LSB). The LSB 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 LSB 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.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Load Shed Recovery With Transmission Switching and Intentional Islanding Methods After (N-2) Line Contingencies

Changing power system configuration may result in load shed recovery (LSR) because topology change can provide power flow control in meshed network. Some topologies may favor generation redispatch as compared to others and can eliminate line congestion which leads to LSR. One of the known methods for topology change is called transmission switching (TS) and research conducted in the past showed that TS is an effective means of mitigating load shedding. Another method of topology control is intentional islanding (IIS). In this manuscript, we explore IIS as a potential solution for LSR. IIS based on generator coherency has been presented in literature for mitigating cascading failures. However, IIS has not been explored solely as a LSR mechanism. In this paper, we compare the LSR based on IIS with well known LSR algorithm based on TS. The comparison is performed for IEEE 39-bus system and IEEE 118- bus system. The results show that IIS has a potential to perform better than TS in terms of computational efficiency and LSR.

42 ENGINEERING↗
DOE OSTI2021

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

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.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching

Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.

99 GENERAL AND MISCELLANEOUS↗