Matching Items (5)
Filtering by
- All Subjects: Power system reliability
- Genre: Academic theses
- Creators: Vittal, Vijay
Description
Photovoltaic (PV) power generation has the potential to cause a significant impact on power system reliability since its total installed capacity is projected to increase at a significant rate. PV generation can be described as an intermittent and variable resource because its production is influenced by ever-changing environmental conditions. The study in this dissertation focuses on the influence of PV generation on trans-mission system reliability. This is a concern because PV generation output is integrated into present power systems at various voltage levels and may significantly affect the power flow patterns. This dissertation applies a probabilistic power flow (PPF) algorithm to evaluate the influence of PV generation uncertainty on transmission system perfor-mance. A cumulant-based PPF algorithm suitable for large systems is used. Correlation among adjacent PV resources is considered. Three types of approximation expansions based on cumulants namely Gram-Charlier expansion, Edgeworth expansion and Cor-nish-Fisher expansion are compared, and their properties, advantages and deficiencies are discussed. Additionally, a novel probabilistic model of PV generation is developed to obtain the probability density function (PDF) of the PV generation production based on environmental conditions. Besides, this dissertation proposes a novel PPF algorithm considering the conven-tional generation dispatching operation to balance PV generation uncertainties. It is pru-dent to include generation dispatch in the PPF algorithm since the dispatching strategy compensates for PV generation injections and influences the uncertainty results. Fur-thermore, this dissertation also proposes a probabilistic optimal power dispatching strat-egy which considers uncertainty problems in the economic dispatch and optimizes the expected value of the total cost with the overload probability as a constraint. The proposed PPF algorithm with the three expansions is compared with Monte Carlo simulations (MCS) with results for a 2497-bus representation of the Arizona area of the Western Electricity Coordinating Council (WECC) system. The PDFs of the bus voltages, line flows and slack bus production are computed, and are used to identify the confidence interval, the over limit probability and the expected over limit time of the ob-jective variables. The proposed algorithm is of significant relevance to the operating and planning studies of the transmission systems with PV generation installed.
ContributorsFan, Miao (Author) / Vittal, Vijay (Thesis advisor) / Heydt, Gerald Thomas (Committee member) / Ayyanar, Raja (Committee member) / Si, Jennie (Committee member) / Arizona State University (Publisher)
Created2012
Description
The uncertainty and variability associated with stochastic resources, such as wind and solar, coupled with the stringent reliability requirements and constantly changing system operating conditions (e.g., generator and transmission outages) introduce new challenges to power systems. Contemporary approaches to model reserve requirements within the conventional security-constrained unit commitment (SCUC) models may not be satisfactory with increasing penetration levels of stochastic resources; such conventional models pro-cure reserves in accordance with deterministic criteria whose deliverability, in the event of an uncertain realization, is not guaranteed. Smart, well-designed reserve policies are needed to assist system operators in maintaining reliability at least cost.
Contemporary market models do not satisfy the minimum stipulated N-1 mandate for generator contingencies adequately. This research enhances the traditional market practices to handle generator contingencies more appropriately. In addition, this research employs stochastic optimization that leverages statistical information of an ensemble of uncertain scenarios and data analytics-based algorithms to design and develop cohesive reserve policies. The proposed approaches modify the classical SCUC problem to include reserve policies that aim to preemptively anticipate post-contingency congestion patterns and account for resource uncertainty, simultaneously. The hypothesis is to integrate data-mining, reserve requirement determination, and stochastic optimization in a holistic manner without compromising on efficiency, performance, and scalability. The enhanced reserve procurement policies use contingency-based response sets and post-contingency transmission constraints to appropriately predict the influence of recourse actions, i.e., nodal reserve deployment, on critical transmission elements.
This research improves the conventional deterministic models, including reserve scheduling decisions, and facilitates the transition to stochastic models by addressing the reserve allocation issue. The performance of the enhanced SCUC model is compared against con-temporary deterministic models and a stochastic unit commitment model. Numerical results are based on the IEEE 118-bus and the 2383-bus Polish test systems. Test results illustrate that the proposed reserve models consistently outperform the benchmark reserve policies by improving the market efficiency and enhancing the reliability of the market solution at reduced costs while maintaining scalability and market transparency. The proposed approaches require fewer ISO discretionary adjustments and can be employed by present-day solvers with minimal disruption to existing market procedures.
Contemporary market models do not satisfy the minimum stipulated N-1 mandate for generator contingencies adequately. This research enhances the traditional market practices to handle generator contingencies more appropriately. In addition, this research employs stochastic optimization that leverages statistical information of an ensemble of uncertain scenarios and data analytics-based algorithms to design and develop cohesive reserve policies. The proposed approaches modify the classical SCUC problem to include reserve policies that aim to preemptively anticipate post-contingency congestion patterns and account for resource uncertainty, simultaneously. The hypothesis is to integrate data-mining, reserve requirement determination, and stochastic optimization in a holistic manner without compromising on efficiency, performance, and scalability. The enhanced reserve procurement policies use contingency-based response sets and post-contingency transmission constraints to appropriately predict the influence of recourse actions, i.e., nodal reserve deployment, on critical transmission elements.
This research improves the conventional deterministic models, including reserve scheduling decisions, and facilitates the transition to stochastic models by addressing the reserve allocation issue. The performance of the enhanced SCUC model is compared against con-temporary deterministic models and a stochastic unit commitment model. Numerical results are based on the IEEE 118-bus and the 2383-bus Polish test systems. Test results illustrate that the proposed reserve models consistently outperform the benchmark reserve policies by improving the market efficiency and enhancing the reliability of the market solution at reduced costs while maintaining scalability and market transparency. The proposed approaches require fewer ISO discretionary adjustments and can be employed by present-day solvers with minimal disruption to existing market procedures.
ContributorsSinghal, Nikita Ghanshyam (Author) / Hedman, Kory W (Thesis advisor) / Vittal, Vijay (Committee member) / Sankar, Lalitha (Committee member) / Pal, Anamitra (Committee member) / Arizona State University (Publisher)
Created2018
Description
Corrective transmission topology control schemes are an essential part of grid operations and are used to improve the reliability of the grid as well as the operational efficiency. However, topology control schemes are frequently established based on the operator's past knowledge of the system as well as other ad-hoc methods. This research presents robust corrective topology control, which is a transmission switching methodology used for system reliability as well as to facilitate renewable integration.
This research presents three topology control (corrective transmission switching) methodologies along with the detailed formulation of robust corrective switching. The robust model can be solved off-line to suggest switching actions that can be used in a dynamic security assessment tool in real-time. The proposed robust topology control algorithm can also generate multiple corrective switching actions for a particular contingency. The solution obtained from the robust topology control algorithm is guaranteed to be feasible for the entire uncertainty set, i.e., a range of system operating states.
Furthermore, this research extends the benefits of robust corrective topology control to renewable resource integration. In recent years, the penetration of renewable resources in electrical power systems has increased. These renewable resources add more complexities to power system operations, due to their intermittent nature. This research presents robust corrective topology control as a congestion management tool to manage power flows and the associated renewable uncertainty. The proposed day-ahead method determines the maximum uncertainty in renewable resources in terms of do-not-exceed limits combined with corrective topology control. The results obtained from the topology control algorithm are tested for system stability and AC feasibility.
The scalability of do-not-exceed limits problem, from a smaller test case to a realistic test case, is also addressed in this research. The do-not-exceed limit problem is simplified by proposing a zonal do-not-exceed limit formulation over a detailed nodal do-not-exceed limit formulation. The simulation results show that the zonal approach is capable of addressing scalability of the do-not-exceed limit problem for a realistic test case.
This research presents three topology control (corrective transmission switching) methodologies along with the detailed formulation of robust corrective switching. The robust model can be solved off-line to suggest switching actions that can be used in a dynamic security assessment tool in real-time. The proposed robust topology control algorithm can also generate multiple corrective switching actions for a particular contingency. The solution obtained from the robust topology control algorithm is guaranteed to be feasible for the entire uncertainty set, i.e., a range of system operating states.
Furthermore, this research extends the benefits of robust corrective topology control to renewable resource integration. In recent years, the penetration of renewable resources in electrical power systems has increased. These renewable resources add more complexities to power system operations, due to their intermittent nature. This research presents robust corrective topology control as a congestion management tool to manage power flows and the associated renewable uncertainty. The proposed day-ahead method determines the maximum uncertainty in renewable resources in terms of do-not-exceed limits combined with corrective topology control. The results obtained from the topology control algorithm are tested for system stability and AC feasibility.
The scalability of do-not-exceed limits problem, from a smaller test case to a realistic test case, is also addressed in this research. The do-not-exceed limit problem is simplified by proposing a zonal do-not-exceed limit formulation over a detailed nodal do-not-exceed limit formulation. The simulation results show that the zonal approach is capable of addressing scalability of the do-not-exceed limit problem for a realistic test case.
ContributorsKorad, Akshay Shashikumar (Author) / Hedman, Kory W (Thesis advisor) / Ayyanar, Raja (Committee member) / Vittal, Vijay (Committee member) / Zhang, Muhong (Committee member) / Arizona State University (Publisher)
Created2015
Description
The standard optimal power flow (OPF) problem is an economic dispatch (ED) problem combined with transmission constraints, which are based on a static topology. However, topology control (TC) has been proposed in the past as a corrective mechanism to relieve overloads and voltage violations. Even though the benefits of TC are presented by several research works in the past, the computational complexity associated with TC has been a major deterrent to its implementation. The proposed work develops heuristics for TC and investigates its potential to improve the computational time for TC for various applications. The objective is to develop computationally light methods to harness the flexibility of the grid to derive maximum benefits to the system in terms of reliability. One of the goals of this research is to develop a tool that will be capable of providing TC actions in a minimal time-frame, which can be readily adopted by the industry for real-time corrective applications.
A DC based heuristic, i.e., a greedy algorithm, is developed and applied to improve the computational time for the TC problem while still maintaining the ability to find quality solutions. In the greedy algorithm, an expression is derived, which indicates the impact on the objective for a marginal change in the state of a transmission line. This expression is used to generate a priority list with potential candidate lines for switching, which may provide huge improvements to the system. The advantage of this method is that it is a fast heuristic as compared to using mixed integer programming (MIP) approach.
Alternatively, AC based heuristics are developed for TC problem and tested on actual data from PJM, ERCOT and TVA. AC based N-1 contingency analysis is performed to identify the contingencies that cause network violations. Simple proximity based heuristics are developed and the fast decoupled power flow is solved iteratively to identify the top five TC actions, which provide reduction in violations. Time domain simulations are performed to ensure that the TC actions do not cause system instability. Simulation results show significant reductions in violations in the system by the application of the TC heuristics.
A DC based heuristic, i.e., a greedy algorithm, is developed and applied to improve the computational time for the TC problem while still maintaining the ability to find quality solutions. In the greedy algorithm, an expression is derived, which indicates the impact on the objective for a marginal change in the state of a transmission line. This expression is used to generate a priority list with potential candidate lines for switching, which may provide huge improvements to the system. The advantage of this method is that it is a fast heuristic as compared to using mixed integer programming (MIP) approach.
Alternatively, AC based heuristics are developed for TC problem and tested on actual data from PJM, ERCOT and TVA. AC based N-1 contingency analysis is performed to identify the contingencies that cause network violations. Simple proximity based heuristics are developed and the fast decoupled power flow is solved iteratively to identify the top five TC actions, which provide reduction in violations. Time domain simulations are performed to ensure that the TC actions do not cause system instability. Simulation results show significant reductions in violations in the system by the application of the TC heuristics.
ContributorsBalasubramanian, Pranavamoorthy (Author) / Hedman, Kory W (Thesis advisor) / Vittal, Vijay (Committee member) / Ayyanar, Raja (Committee member) / Sankar, Lalitha (Committee member) / Arizona State University (Publisher)
Created2016
Description
Ensuring reliable operation of large power systems subjected to multiple outages is a challenging task because of the combinatorial nature of the problem. Traditional methods of steady-state security assessment in power systems involve contingency analysis based on AC or DC power flows. However, power flow based contingency analysis is not fast enough to evaluate all contingencies for real-time operations. Therefore, real-time contingency analysis (RTCA) only evaluates a subset of the contingencies (called the contingency list), and hence might miss critical contingencies that lead to cascading failures.This dissertation proposes a new graph-theoretic approach, called the feasibility test (FT) algorithm, for analyzing whether a contingency will create a saturated or over-loaded cut-set in a meshed power network; a cut-set denotes a set of lines which if tripped separates the network into two disjoint islands. A novel feature of the proposed approach is that it lowers the solution time significantly making the approach viable for an exhaustive real-time evaluation of the system. Detecting saturated cut-sets in the power system is important because they represent the vulnerable bottlenecks in the network. The robustness of the FT algorithm is demonstrated on a 17,000+ bus model of the Western Interconnection (WI).
Following the detection of post-contingency cut-set saturation, a two-component methodology is proposed to enhance the reliability of large power systems during a series of outages. The first component combines the proposed FT algorithm with RTCA to create an integrated corrective action (iCA), whose goal is to secure the power system against post-contingency cut-set saturation as well as critical branch overloads. The second component only employs the results of the FT to create a relaxed corrective action (rCA) that quickly secures the system against saturated cut-sets.
The first component is more comprehensive than the second, but the latter is computationally more efficient. The effectiveness of the two components is evaluated based upon the number of cascade triggering contingencies alleviated, and the computation time. Analysis of different case-studies on the IEEE 118-bus and 2000-bus synthetic Texas systems indicate that the proposed two-component methodology enhances the scope and speed of power system security assessment during multiple outages.
ContributorsSen Biswas, Reetam (Author) / Pal, Anamitra (Thesis advisor) / Vittal, Vijay (Committee member) / Undrill, John (Committee member) / Wu, Meng (Committee member) / Zhang, Yingchen (Committee member) / Arizona State University (Publisher)
Created2021