ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Displaying 1 - 4 of 4
Filtering by
- Creators: Vittal, Vijay
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
For a (N+1)-bus power system, possibly 2N solutions exists. One of these solutions
is known as the high-voltage (HV) solution or operable solution. The rest of the solutions
are the low-voltage (LV), or large-angle, solutions.
In this report, a recently developed non-iterative algorithm for solving the power-
flow (PF) problem using the holomorphic embedding (HE) method is shown as
being capable of finding the HV solution, while avoiding converging to LV solutions
nearby which is a drawback to all other iterative solutions. The HE method provides a
novel non-iterative procedure to solve the PF problems by eliminating the
non-convergence and initial-estimate dependency issues appeared in the traditional
iterative methods. The detailed implementation of the HE method is discussed in the
report.
While published work focuses mainly on finding the HV PF solution, modified
holomorphically embedded formulations are proposed in this report to find the
LV/large-angle solutions of the PF problem. It is theoretically proven that the proposed
method is guaranteed to find a total number of 2N solutions to the PF problem
and if no solution exists, the algorithm is guaranteed to indicate such by the oscillations
in the maximal analytic continuation of the coefficients of the voltage power series
obtained.
After presenting the derivation of the LV/large-angle formulations for both PQ
and PV buses, numerical tests on the five-, seven- and 14-bus systems are conducted
to find all the solutions of the system of nonlinear PF equations for those systems using
the proposed HE method.
After completing the derivation to find all the PF solutions using the HE method, it
is shown that the proposed HE method can be used to find only the of interest PF solutions
(i.e. type-1 PF solutions with one positive real-part eigenvalue in the Jacobian
matrix), with a proper algorithm developed. The closet unstable equilibrium point
(UEP), one of the type-1 UEP’s, can be obtained by the proposed HE method with
limited dynamic models included.
The numerical performance as well as the robustness of the proposed HE method is
investigated and presented by implementing the algorithm on the problematic cases and
large-scale power system.
is known as the high-voltage (HV) solution or operable solution. The rest of the solutions
are the low-voltage (LV), or large-angle, solutions.
In this report, a recently developed non-iterative algorithm for solving the power-
flow (PF) problem using the holomorphic embedding (HE) method is shown as
being capable of finding the HV solution, while avoiding converging to LV solutions
nearby which is a drawback to all other iterative solutions. The HE method provides a
novel non-iterative procedure to solve the PF problems by eliminating the
non-convergence and initial-estimate dependency issues appeared in the traditional
iterative methods. The detailed implementation of the HE method is discussed in the
report.
While published work focuses mainly on finding the HV PF solution, modified
holomorphically embedded formulations are proposed in this report to find the
LV/large-angle solutions of the PF problem. It is theoretically proven that the proposed
method is guaranteed to find a total number of 2N solutions to the PF problem
and if no solution exists, the algorithm is guaranteed to indicate such by the oscillations
in the maximal analytic continuation of the coefficients of the voltage power series
obtained.
After presenting the derivation of the LV/large-angle formulations for both PQ
and PV buses, numerical tests on the five-, seven- and 14-bus systems are conducted
to find all the solutions of the system of nonlinear PF equations for those systems using
the proposed HE method.
After completing the derivation to find all the PF solutions using the HE method, it
is shown that the proposed HE method can be used to find only the of interest PF solutions
(i.e. type-1 PF solutions with one positive real-part eigenvalue in the Jacobian
matrix), with a proper algorithm developed. The closet unstable equilibrium point
(UEP), one of the type-1 UEP’s, can be obtained by the proposed HE method with
limited dynamic models included.
The numerical performance as well as the robustness of the proposed HE method is
investigated and presented by implementing the algorithm on the problematic cases and
large-scale power system.
ContributorsMine, Yō (Author) / Tylavsky, Daniel (Thesis advisor) / Armbruster, Dieter (Committee member) / Holbert, Keith E. (Committee member) / Sankar, Lalitha (Committee member) / Vittal, Vijay (Committee member) / Undrill, John (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
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.
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