Matching Items (3)
Filtering by

Clear all filters

157058-Thumbnail Image.png
Description
Synthetic power system test cases offer a wealth of new data for research and development purposes, as well as an avenue through which new kinds of analyses and questions can be examined. This work provides both a methodology for creating and validating synthetic test cases, as well as a few

Synthetic power system test cases offer a wealth of new data for research and development purposes, as well as an avenue through which new kinds of analyses and questions can be examined. This work provides both a methodology for creating and validating synthetic test cases, as well as a few use-cases for how access to synthetic data enables otherwise impossible analysis.

First, the question of how synthetic cases may be generated in an automatic manner, and how synthetic samples should be validated to assess whether they are sufficiently ``real'' is considered. Transmission and distribution levels are treated separately, due to the different nature of the two systems. Distribution systems are constructed by sampling distributions observed in a dataset from the Netherlands. For transmission systems, only first-order statistics, such as generator limits or line ratings are sampled statistically. The task of constructing an optimal power flow case from the sample sets is left to an optimization problem built on top of the optimal power flow formulation.

Secondly, attention is turned to some examples where synthetic models are used to inform analysis and modeling tasks. Co-simulation of transmission and multiple distribution systems is considered, where distribution feeders are allowed to couple transmission substations. Next, a distribution power flow method is parametrized to better account for losses. Numerical values for the parametrization can be statistically supported thanks to the ability to generate thousands of feeders on command.
ContributorsSchweitzer, Eran (Author) / Scaglione, Anna (Thesis advisor) / Hedman, Kory W (Committee member) / Overbye, Thomas J (Committee member) / Monti, Antonello (Committee member) / Sankar, Lalitha (Committee member) / Arizona State University (Publisher)
Created2019
154530-Thumbnail Image.png
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

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.
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
154323-Thumbnail Image.png
Description
This work presents research on practices in the day-ahead electric energy market, including replication practices and reliability coordinators used by some market operators to demonstrate the impact these practices have on market outcomes. The practice of constraint relaxations similar to those an Independent System Operator (ISO) might perform in day-ahead

This work presents research on practices in the day-ahead electric energy market, including replication practices and reliability coordinators used by some market operators to demonstrate the impact these practices have on market outcomes. The practice of constraint relaxations similar to those an Independent System Operator (ISO) might perform in day-ahead market models is implemented. The benefits of these practices are well understood by the industry; however, the implications these practices have on market outcomes and system security have not been thoroughly investigated. By solving a day-ahead market model with and without select constraint relaxations and comparing the resulting market outcomes and possible effects on system security, the effect of these constraint relaxation practices is demonstrated.

Proposed market solutions are often infeasible because constraint relaxation practices and approximations that are incorporated into market models. Therefore, the dispatch solution must be corrected to ensure its feasibility. The practice of correcting the proposed dispatch solution after the market is solved is known as out-of-market corrections (OMCs), defined as any action an operator takes that modifies a proposed day-ahead dispatch solution to ensure operating and reliability requirements. The way in which OMCs affect market outcomes is illustrated through the use of different corrective procedures. The objective of the work presented is to demonstrate the implications of these industry practices and assess the impact these practices have on market outcomes.
ContributorsAl-Abdullah, Yousef Mohammad (Author) / Hedman, Kory W (Thesis advisor) / Vittal, Vijay (Thesis advisor) / Heydt, Gerald T (Committee member) / Sankar, Lalitha (Committee member) / Arizona State University (Publisher)
Created2016