Matching Items (7)
Filtering by
- All Subjects: Operations Research
- Creators: Sankar, Lalitha
Description
The main objective of this research is to develop an integrated method to study emergent behavior and consequences of evolution and adaptation in engineered complex adaptive systems (ECASs). A multi-layer conceptual framework and modeling approach including behavioral and structural aspects is provided to describe the structure of a class of engineered complex systems and predict their future adaptive patterns. The approach allows the examination of complexity in the structure and the behavior of components as a result of their connections and in relation to their environment. This research describes and uses the major differences of natural complex adaptive systems (CASs) with artificial/engineered CASs to build a framework and platform for ECAS. While this framework focuses on the critical factors of an engineered system, it also enables one to synthetically employ engineering and mathematical models to analyze and measure complexity in such systems. In this way concepts of complex systems science are adapted to management science and system of systems engineering. In particular an integrated consumer-based optimization and agent-based modeling (ABM) platform is presented that enables managers to predict and partially control patterns of behaviors in ECASs. Demonstrated on the U.S. electricity markets, ABM is integrated with normative and subjective decision behavior recommended by the U.S. Department of Energy (DOE) and Federal Energy Regulatory Commission (FERC). The approach integrates social networks, social science, complexity theory, and diffusion theory. Furthermore, it has unique and significant contribution in exploring and representing concrete managerial insights for ECASs and offering new optimized actions and modeling paradigms in agent-based simulation.
ContributorsHaghnevis, Moeed (Author) / Askin, Ronald G. (Thesis advisor) / Armbruster, Dieter (Thesis advisor) / Mirchandani, Pitu (Committee member) / Wu, Tong (Committee member) / Hedman, Kory (Committee member) / Arizona State University (Publisher)
Created2013
Description
Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition determining whether a finite number of measurements suffice to recover the initial state. However to employ observability for sensor scheduling, the binary definition needs to be expanded so that one can measure how observable a system is with a particular measurement scheme, i.e. one needs a metric of observability. Most methods utilizing an observability metric are about sensor selection and not for sensor scheduling. In this dissertation we present a new approach to utilize the observability for sensor scheduling by employing the condition number of the observability matrix as the metric and using column subset selection to create an algorithm to choose which sensors to use at each time step. To this end we use a rank revealing QR factorization algorithm to select sensors. Several numerical experiments are used to demonstrate the performance of the proposed scheme.
ContributorsIlkturk, Utku (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Renaut, Rosemary (Committee member) / Armbruster, Dieter (Committee member) / Arizona State University (Publisher)
Created2015
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
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
Two thirds of the U.S. power systems are operated under market structures. A good market design should maximize social welfare and give market participants proper incentives to follow market solutions. Pricing schemes play very important roles in market design.
Locational marginal pricing scheme is the core pricing scheme in energy markets. Locational marginal prices are good pricing signals for dispatch marginal costs. However, the locational marginal prices alone are not incentive compatible since energy markets are non-convex markets. Locational marginal prices capture dispatch costs but fail to capture commitment costs such as startup cost, no-load cost, and shutdown cost. As a result, uplift payments are paid to generators in markets in order to provide incentives for generators to follow market solutions. The uplift payments distort pricing signals.
In this thesis, pricing schemes in electric energy markets are studied. In the first part, convex hull pricing scheme is studied and the pricing model is extended with network constraints. The subgradient algorithm is applied to solve the pricing model. In the second part, a stochastic dispatchable pricing model is proposed to better address the non-convexity and uncertainty issues in day-ahead energy markets. In the third part, an energy storage arbitrage model with the current locational marginal price scheme is studied. Numerical test cases are studied to show the arguments in this thesis.
The overall market and pricing scheme design is a very complex problem. This thesis gives a thorough overview of pricing schemes in day-ahead energy markets and addressed several key issues in the markets. New pricing schemes are proposed to improve market efficiency.
Locational marginal pricing scheme is the core pricing scheme in energy markets. Locational marginal prices are good pricing signals for dispatch marginal costs. However, the locational marginal prices alone are not incentive compatible since energy markets are non-convex markets. Locational marginal prices capture dispatch costs but fail to capture commitment costs such as startup cost, no-load cost, and shutdown cost. As a result, uplift payments are paid to generators in markets in order to provide incentives for generators to follow market solutions. The uplift payments distort pricing signals.
In this thesis, pricing schemes in electric energy markets are studied. In the first part, convex hull pricing scheme is studied and the pricing model is extended with network constraints. The subgradient algorithm is applied to solve the pricing model. In the second part, a stochastic dispatchable pricing model is proposed to better address the non-convexity and uncertainty issues in day-ahead energy markets. In the third part, an energy storage arbitrage model with the current locational marginal price scheme is studied. Numerical test cases are studied to show the arguments in this thesis.
The overall market and pricing scheme design is a very complex problem. This thesis gives a thorough overview of pricing schemes in day-ahead energy markets and addressed several key issues in the markets. New pricing schemes are proposed to improve market efficiency.
ContributorsLi, Chao (Author) / Hedman, Kory (Thesis advisor) / Sankar, Lalitha (Committee member) / Scaglione, Anna (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
Description
Breeding seeds to include desirable traits (increased yield, drought/temperature resistance, etc.) is a growing and important method of establishing food security. However, besides breeder intuition, few decision-making tools exist that can provide the breeders with credible evidence to make decisions on which seeds to progress to further stages of development. This thesis attempts to create a chance-constrained knapsack optimization model, which the breeder can use to make better decisions about seed progression and help reduce the levels of risk in their selections. The model’s objective is to select seed varieties out of a larger pool of varieties and maximize the average yield of the “knapsack” based on meeting some risk criteria. Two models are created for different cases. First is the risk reduction model which seeks to reduce the risk of getting a bad yield but still maximize the total yield. The second model considers the possibility of adverse environmental effects and seeks to mitigate the negative effects it could have on the total yield. In practice, breeders can use these models to better quantify uncertainty in selecting seed varieties
ContributorsOzcan, Ozkan Meric (Author) / Armbruster, Dieter (Thesis advisor) / Gel, Esma (Thesis advisor) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2019