Progressive Hedging for Computationally Tractable Security-Constrained Unit Commitment.
Abstract Not Provided
SEARCH · Engineering Papers
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.
Abstract Not Provided
In this paper a model was developed to mimic operator behavior using a combination of security-constrained unit commitment, security-constrained economic dispatch, and automatic generation control programs.
Flexible Energy Scheduling Tool for Integrating Variable generation (FESTIV) is a tool that simulates the realistic representation of steady-state power system operations and scheduling performed by an independent system operator, regional transmission organization, or a vertically integrated regulated utility. The tool integrates security-constrained unit commitment (SCUC), security-constrained economic dispatch (SCED), and automatic generation control (AGC) into one model. These are the three modes of power system scheduling that are used to meet the changing net demand. Each of these submodels have different time characteristics and are used to meet the changing demand at different time resolutions and horizons. This allows multiple timescales to be studied where FESTIV accounts for intertemporal coupling between each submodel and the submodels themselves. It does this while having different objectives between the submodels; commitment of resources, dispatch and reserve commitment, and finally control.
This paper is an overview of Power System Simulation Toolbox (psst). psst is an open-source Python application for the simulation and analysis of power system models. psst simulates the wholesale market operation by solving a DC Optimal Power Flow (DCOPF), Security Constrained Unit Commitment (SCUC) and a Security Constrained Economic Dispatch (SCED). psst also includes models for the various entities in a power system such as Generator Companies (GenCos), Load Serving Entities (LSEs) and an Independent System Operator (ISO). psst features an open modular object oriented architecture that will make it useful for researchers to customize, expand, experiment beyond solving traditional problems. psst also includes a web based Graphical User Interface (GUI) that allows for user friendly interaction and for implementation on remote High Performance Computing (HPCs) clusters for parallelized operations. This paper also provides an illustrative application of psst and benchmarks with standard IEEE test cases to show the advanced features and the performance of toolbox.
In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.
As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.
Smart buildings are equipped with a plethora of cyber-physical systems, such as Internet of Things (IoT) devices and building automation systems. These devices, especially in commercial buildings, use legacy communications and hardware that were not designed with cybersecurity in mind. With increasing cyber threats in recent years, smart buildings have become an increasing target for attacks, but not enough published data are available from these incidents to study or replicate the scenarios to defend buildings. As part of the U.S. Department of Energy-funded project focusing on developing the Building Intelligence with Layered Defense Using Security-Constrained Optimization and Security Risk Detection (BUILD-SOS) platform, we developed a cybersecurity test bed for smart buildings. This test bed includes a building simulation tool, virtual devices, emulated operational technology networks, and remote hardware-in-the-loop. Using this test bed, we performed different cyberattacks on the smart building model and collected both physical building data, to understand the impacts on the building, and network data, to aid in separating mechanical faults from cyberattacks during the detection. This test bed is a significant tool in protecting smart buildings from cyberattacks because it can aid in both cybersecurity analysis and the evaluation of other cyberattack detection tools by testing the tools in a secure environment without impacting the building operations.
Smart buildings are equipped with a plethora of cyber-physical systems, such as Internet of Things (IoT) devices and building automation systems. These devices, especially in commercial buildings, use legacy communications and hardware that were not designed with cybersecurity in mind. With increasing cyber threats in recent years, smart buildings have become an increasing target for attacks, but not enough published data are available from these incidents to study or replicate the scenarios to defend buildings. As part of the U.S. Department of Energy-funded project focusing on developing the Building Intelligence with Layered Defense Using Security-Constrained Optimization and Security Risk Detection (BUILD-SOS) platform, we developed a cybersecurity test bed for smart buildings. This test bed includes a building simulation tool, virtual devices, emulated operational technology networks, and remote hardware-in-the-loop. Using this test bed, we performed different cyberattacks on the smart building model and collected both physical building data, to understand the impacts on the building, and network data, to aid in separating mechanical faults from cyberattacks during the detection. This test bed is a significant tool in protecting smart buildings from cyberattacks because they can aid in both cybersecurity analysis and the evaluation of cyberattack detection tools by testing the tools in a secure environment without impacting the building operations.
This paper incorporates the stochastic day-ahead security-constrained unit commitment (DASCUC) within a multi-timescale, multi-scheduling application with commitment, dispatch, and automatic generation control. The stochastic DASCUC is solved using a progressive hedging algorithm with constrained ordinal optimization to accelerate the individual scenario solution. Sensitivity studies are performed in the RTS-96 system, and the results show how this new scheduling application would impact costs and reliability with a closer representation of timescales of system operations in practice.
This paper describes a novel set of stochastic unit commitment and economic dispatch models that consider stochastic loads and variable generation at multiple operational timescales. The stochastic model includes four distinct stages: stochastic day-ahead security-constrained unit commitment (SCUC), stochastic real-time SCUC, stochastic real-time security-constrained economic dispatch (SCED), and deterministic automatic generation control (AGC). These sub-models are integrated together such that they are continually updated with decisions passed from one to another. The progressive hedging algorithm (PHA) is applied to solve the stochastic models to maintain the computational tractability of the proposed models. Comparative case studies with deterministic approaches are conducted in low wind and high wind penetration scenarios to highlight the advantages of the proposed methodology, one with perfect forecasts and the other with current state-of-the-art but imperfect deterministic forecasts. The effectiveness of the proposed method is evaluated with sensitivity tests using both economic and reliability metrics to provide a broader view of its impact.
Pacific Northwest National Laboratory (PNNL), Arizona State University (ASU), Georgia Institute of Technology (Georgia Tech), Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), The University of Texas at Austin (UT), and the University of Wisconsin-Madison (UW-M) supported the ARPA-E Grid Optimization (GO) Competition by providing a common problem formulation, data format, datasets, evaluation mechanism, scoring, rules, and results that resulted in the awarding of $\$9.24$ million dollars to teams from academia, industry, and national labs for solving three sets of increasingly difficult non-linear, security- constrained AC Optimal Powerflow (AC-OPF) optimization problems in order to increase the efficiency of the US Electric Grid. It is estimated that a 1% increase in efficiency can save $\$1$ billion. Current industry practices typically use a linear DC model (DC-OPF) in order solve the OPF problem within the time constraints of the operation schedule. The GO Competition challenges the best power engineers, mathematicians, and computer scientists to make possible operational decisions based on accurate physical models. To accomplish this, the GO Competition created a series of Challenges and funded teams to produce the best solver. Challenge 1 was to solve the security constrained Alternating Current Optimal Power Flow (ACOPF) problem. Challenge 2 extended that to by adding adjustable transformer tap ratios, phase shifting transformers, switchable shunts, price-responsive demand, ramp rate constrained generators and loads, and fast-start unit commitment (UC). Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. While Challenge 3 was being developed, the entrants were invited to find better solutions to the Challenge 2 synthetic datasets with no restrictions on time, hardware, or algorithms. The Challenge 2 solutions turned out to be very good. Challenge 3 expanded the Challenge 2 problem further by using multiperiod dynamic markets, including advisory models for extreme weather events, day-ahead markets, and the real-time markets with an extended look-ahead. These problems included active bid-in demand and topology optimization. Together the Challenges used nearly 30 million CPU hours. Since each team was working on the same problem, using the same data, and running on the same hardware, fair comparisons could be drawn as to the best solver. The datasets were varied enough, however, that the best solver for one dataset was not necessarily the best at another, so cumulative scores were used. The process was managed by the PNNL maintained website https://GOCompetition.energy.gov, where Entrants could find information about the problem, the data, the rules, submit their solver for evaluation, and see the scores of all the competing teams on a Leaderboard. Interest was world-wide but only American teams were eligible for prizes. The Competition has produced 34 journal articles 115 papers and been cited over 500 times in the literature, including 12 dissertations (4 from foreign countries; Columbia (2), Germany, and Italy) and 3 from the DOE ExaScale project. Software developed by Pearl Street Technologies for Challenges 1 and 2 is now deployed by Southwest Power Pool (SPP) and Midcontinent Independent Service Operator (MISO). Other teams have received inquiries from venture capitalists. Google DeepMind has thanked the Competition for making the datasets developed for the Competition public. They are using it to train machine learning models. The larger datasets have billions of unknowns to be solved for, but only a small percent matter in the final solution. Knowing what unknowns are important can dramatically speedup the solution.
This paper proposes a new formulation and solution algorithm that uses transmission level solar inverters to address the security-constrained optimal power flow (SCOPF) problem. The goal is to stabilize voltage fluctuations in transmission networks in base case and contingency scenarios, by using bulk solar power plant with a minimal number of post-contingency corrections. To achieve this goal, a two-stage volt/var optimization method is proposed to first correct all voltage violations with the volt-var alternating current optimal power flow (ACOPF) algorithm for a base case. Then a linearized SCOPF volt-var control algorithm is proposed to identify the corrective actions for all potential voltage violations in all contingency scenarios. The proposed method was tested and validated on a modified IEEE 118-bus system with solar photovoltaic (PV) data.
Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.
Flexible ramping products are designed to compensate the variability and uncertainty of load and intermittent generation. Since their market implementation by the California Independent System Operator (CAISO) and Midcontinent System Operator (MISO), flexible ramping products have garnered much attention. However, it is still unclear how to best formulate wind power plants’ participation in the ramping requirement. This paper investigates different wind ramping product formulations and increasing wind power penetration in the context of a security-constrained unit commitment (SCUC) model. We demonstrate that the ramping model that captures both the intra- and inter-temporal output ramp capability of individual wind power plants reflects the true ramp contribution of the wind fleet. With increasing wind penetration, wind generation curtailments can support the grid’s ramping needs. In addition, we found that increased wind penetration has the potential of lowering ramping and production costs. Numerical case studies performed on the TAMU 2000-bus synthetic network support the findings.
Ensuring a secure dispatch against multiple simultaneous outages has long been desired to maintain grid security in the presence of severe events, such as extreme weather phenomena. Traditionally denoted as N-k security constrained optimal power flow (N-k SCOPF), this problem is intractable to solve due to its size being combinatorial in the number of simultaneous outages and due to the non-convex nature of the AC network constraints. This hinders the use of N-k SCOPF for operating realistic-scale systems. In this paper, we introduce a methodology to scalably solve an AC-feasible dispatch that improves security over k simultaneous outages. Our methodology poses N-k SCOPF as a bilevel optimization problem and solves it using an adversarial robustness approach. We develop new efficient methods to solve each level of the bilevel optimization by employing knowledge of the physics of the underlying system. This yields significant improvements in speed and convergence that enable us to address the N-k SCOPF problem at scale. We demonstrate the effectiveness of our method by conducting a comprehensive analysis of an N-3 SCOPF for a 500-bus network. Furthermore, we emphasize the ability of our physics-driven techniques to handle larger systems by successfully scaling up to 12,000 buses.
In the past decade, natural disasters such as hurricanes have challenged the operation and control of U.S. power grid more. It is crucial to develop proactive strategies to assist grid operators for better emergency response and minimized electricity service interruptions. In this paper, we propose a proactive posturing methodology of power system elements, and formulated a Security-Constrained Optimal Power Flow (SCOPF) that informed by cross-domain hurricane modeling and its potential impacts on the grid elements. Simulation results based on real-world power grid and historical hurricane event validated the applicability of the proposed optimization formulation, and show potential to enable grid operators and planners with interactive cross-domain data analytics in mitigating hurricane impacts.
With increasing penetration levels of variable renewable energy sources, such as wind and solar, electric power systems need flexible resources that can provide fast-response ramping capabilities to counter the variability and uncertainty of renewable generation. Although the California Independent System Operator and Midcontinent System Operator have lauched ramp products, determining how wind power can participate using their flexible ramping models is still largely unclear. This paper proposes a security-constrained unit commitment (SCUC) model considering a flexible ramping constraint representing the system's flexible ramping requirements that account for the net load probabilistic forecast uncertainty. Through this explicit modeling of the uncertainty, the true cost of the flexible ramp service can be determined after solving the SCUC problem. In addition, the potential of wind power to provide operating reserves is analyzed. Numerical case studies demonstrate that with wind power providing both flexible ramping products and operating reserve, the system operating costs and ramp shortages will be reduced significantly.