SEARCH · Engineering Papers
Results for “Unit Commitment”
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.
Quantum-Enabled Distributed Unit Commitment
Explore the source record for details and available documents.
United States commitment to heavy lift launch vehicles
Progress made to date on a United States commitment to the development of heavy launch vehicles is reviewed. The involvement of the Executive Branch operating through the National Space Council, the Legislative Branch, the DOD, and NASA are addressed. The evolution of launch system requirements and the form, content, and rationale for the various decisions that have been made to date are discussed.
Effect of accuracy of wind power prediction on power system operator
This research project proposed a modified unit commitment that schedules connection and disconnection of generating units in response to load. A modified generation control is also proposed that controls steam units under automatic generation control, fast responding diesels, gas turbines and hydro units under a feedforward control, and wind turbine array output under a closed loop array control. This modified generation control and unit commitment require prediction of trend wind power variation one hour ahead and the prediction of error in this trend wind power prediction one half hour ahead. An improved meter for predicting trend wind speed variation is developed. Methods for accurately simulating the wind array power from a limited number of wind speed prediction records was developed. Finally, two methods for predicting the error in the trend wind power prediction were developed. This research provides a foundation for testing and evaluating the modified unit commitment and generation control that was developed to maintain operating reliability at a greatly reduced overall production cost for utilities with wind generation capacity.
Stochastic Look-Ahead Commitment: A Case Study in MISO
This paper introduces the Stochastic Look Ahead Commitment (SLAC) software prototyped and tested for the Midcontinent Independent System Operator (MISO) look ahead commitment process. SLAC can incorporate hundreds of wind, load, and net scheduled interchange (NSI) uncertainty scenarios. It uses a progressive hedging method to solve a novel two-stage stochastic unit commitment. The first stage commitment decisions, made only for those generators whose decision to commit or not in each time period cannot be deferred, can cover the uncertainties within the next three hours. The second stage includes both the dispatch for each of the scenarios and the commitment decisions that can be deferred. Study results on 15 MISO production days show that SLAC may bring economic and reliability benefits under uncertainty.
Solving the Grid Optimization Competition Challenge 3 Problem
The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.
Quantum Stochastic Programming [SWR-26-040]
The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"
Managing Solar Photovoltaic Integration in the Western United States: Power System Flexibility Requirements and Supply
As penetrations of variable renewable energy generation technologies such as wind and solar photovoltaics (PV) continue to increase across the United States, greater uncertainty and variability in the net load often lead to a concern about how power systems may adapt. Managing the system net load (i.e., load minus contribution from variable generation technologies) may become more challenging with increasing variable generation, as the magnitude and frequency of net ramps increase. However, there is inherent flexibility in power systems through the conventional generator fleet (under least-cost unit commitment and economic dispatch), less-conventional generation sources (e.g., storage, demand response, concentrating solar power with thermal energy storage), and imports and exports with neighbors. In this analysis, we create an open-source tool to analyze the flexibility of the results of a specific commercial unit commitment and economic dispatch tool (PLEXOS), but the code can be applied generically as well. The tool assesses the flexibility requirements (or demand) of a system through a net load analysis. The constraints and limitations of each generator are then considered to determine the availability (or supply) of flexibility. Then, the supply and demand of flexibility are compared to gain a more complete picture of potential flexibility concerns. We apply this open-source tool to high-penetration PV scenarios constructed for three focus regions in the western United States defined using the Resource Planning Model (RPM) capacity expansion modeling tool: RPM-OR, RPM-CO, and RPM-AZ. Generally, we find few flexibility concerns, as the western United States represents a large and interconnected power system with significant inherent flexibility. In addition, the PV scenarios we analyzed are overbuilt on capacity, leaving plenty of ramping ability on the system. We do find that for each focus region, the impact of imports on meeting ramping needs is essential. This means the PV integration in each focus region impacts the entire rest of the system. Each system has different dominant sources of flexibility. The conventional generator fleet (especially coal and gas combined-cycle technologies) as well as less-conventional sources such as storage are all shown to be important sources of flexibility. The scenarios evaluated here were designed to study the planning and operations impact of high solar penetration in each of three focus regions. However, none of the three focus regions likely will deploy PV in isolation, meaning the ability of imports and exports to provide flexibility may be considerably different in scenarios with strong PV deployment in every region. Overall, we intend that the framework we present here will be useful in future analysis of other system evolutions to identify whether and how flexibility may constrain the successful deployment of variable generation technologies.
Tightest Mixed-Integer Programming Formulations for Quadratic SCUC Optimization
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.
Short-term nodal load forecasting based on machine learning techniques
This paper introduces an advanced Short-term Nodal Load Forecasting (STNLF) method that forecasts nodal load profiles for the next day in power systems, based on the combined use of three machine learning techniques. Least Absolute Shrinkage and Selection Operator (LASSO) is employed to reduce the number of features for a single nodal load forecasting. Principal Component Analysis (PCA) is used to capture the features of historical loads in low-dimensional space compared to the original high-dimensional load space where features are barely possible to depict. Additionally, Bayesian Ridge Regression (BRR) is utilized to decide the parameters of the prediction model from a statistics perspective. Tests based on modified PJM load data demonstrate the effectiveness of the proposed STNLF method compared to the state-of-the-art General Regression Neural Network (GRNN) method. Moreover, the reliability of the day-ahead Unit Commitment (UC) solution is shown to have been improved, based on the forecasted load data using the proposed STNLF method.
Transmission Constraint Screening for Production Cost Modeling at Scale
Transmission constraint calculation and screening, for both unit commitment and economic dispatch, is a critical feature of a performant solution method, but one that is often overlooked in the literature. In this talk, we will discuss the transmission constraint calculation and screening algorithm implemented in the open-source Egret package for electrical grid optimization and compare it against the more straightforward approach Egret originally implemented. Finally, we discuss the implications for transmission constraint sharing within a production cost modeling simulation.
Uncertainty Quantification for Capacity Expansion Planning
This report quantifies the uncertainty in output decisions from a Capacity Expansion Planning (CEP) model. The need to understand how uncertainties within CEP models and modeling assumptions affect Quantities of Interest (QoIs) such as expansion and operating costs, as well as expansion decisions remains an ongoing challenge in scientific research and industrial operations. This area of research is particularly important for models which seek to capture how large networks will evolve and operate under increased sources of variable generation, i.e., higher penetration of renewable technologies such as solar and wind generators. Uncertainty quantification (UQ) of CEP models which estimate expansion costs and decisions, and production cost models which estimate operating costs and dispatch decisions, is a key focus of research at NREL. The Regional Energy Deployment System (ReEDS) represents a state-of-the-art CEP model and considers a range of possible grid evolutions in an attempt to identify key drivers, ramifications, and decisions which contribute to better informed investment and policy decisions. However, research to quantify how uncertainties and model assumptions, such as unit commitment (UC), within ReEDS may be affecting its outputs remains challenging due to to size and complexity of the model
The Impacts of Distinct Flexibility Enhancements on the Value and Dynamics of Natural Gas Power Plant Operations
The rapid increase of renewable generation and its anticipated continued growth requires greater operational flexibility in modern power systems. Previous studies explored the addition of more flexible resources to improve system flexibility, but this may also be achieved at lower cost by enhancing existing power plants via flexibility retrofits. Potential flexibility upgrades to existing thermal plants include modifications that enable faster ramp rates, increase maximum load levels, decrease minimum load levels, and provide faster and lower cost startup operations. In this paper, we focus on improvements to existing natural gas combined cycle generators, and apply a unit commitment model to analyze the impact that each specific upgrade has on their operational dynamics and profitability from both the system perspective and from the asset owner perspective. We show that the value of each type of flexibility improvement varies depending on the capacity factor and usage pattern of the generator before the upgrade, and that the relative benefit of each type of flexibility varies. We demonstrate diminishing returns to increased flexibility when upgrading multiple generators simultaneously. Sensitivity tests for several shares of renewable generation, different generation mixes and different net load realizations confirm the generality of the results shown.
Reserve Model of Energy Storage in Day-ahead Joint Energy and Reserve Markets: A Stochastic UC Solution
With many favorable advantages including fast response ability in particular, utility-level energy storage systems (ESS) are being integrated into energy and reserve markets to help mitigate uncertain renewable resources and fluctuant demands. This paper discusses a stochastic unit commitment (UC) model to explore capabilities of ESSs in providing valuable grid services by simultaneously joining energy and reserve markets. The proposed reserve model of ESSs presents the following features: (i) two constraints are proposed to formulate ESS’s reserve provision ability in each hour via six operation modes, namely increasing/reducing the level of charge, switching to discharge, increasing/reducing the level of discharge, switching to charge; (ii) as an energy-limited asset, constraints on ESS’s reserve deliverability across multiple hours is introduced to hold enough state of charge (SOC) headroom and floor room, guaranteeing that reserves cleared in individual hours are continuously deliverable over multiple successive hours without violating operation limits. Furthermore, a scenario-based UC model, which addresses uncertainties of renewables and demands, is adopted to evaluate reserves provided by ESSs and generators. To effectively solve the stochastic UC problem, the progressive hedging algorithm with heuristic approaches is discussed. A 6-bus system and a modified IEEE 118-bus system are used to illustrate effectiveness of the proposed approaches.
ARPA-E Grid Optimization (GO) Competition Challenge 2
The ARPA-E Grid Optimization (GO) Competition Challenge 2, from 2020 to 2021, expanded upon the problem posed in Challenge 1 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. Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. Specifically, the economic surplus, defined as the benefit of serving load minus the cost of generation, is being maximized. It was expected that the objective value of a given solution should be positive, representing economic gain, but negative objectives from poor solutions were possible. The two code submission feature of Challenge 1 was maintained. Additionally, Divisions 3 and 4 within the competition permitted on/off switching of transmission lines (Divisions 1 and 2 did not). After the initial release of the Problem Formulation on 7/20/2020, ARPA-E Director Lane Genatowski announced Challenge 2 on 9/12/2020. The final May 31, 2021, version of the Problem Formulation was 97 pages long with 299 equations. The Challenge proceeded with 2 non-prize Events and 2 prize Events. Teams receiving Challenge 1 FOA awards and prize money were required to use the prize money to fund their Challenge 2 efforts (Georgia Institute of Technology, Global Optimal Technology, Inc., Lawrence Livermore National Laboratory, Lehigh University, Northwestern University, Artelys, Columbia, Pearl Street Technologies, Pennsylvania State University, and University of Colorado Boulder). For more information on the competition and challenge 2 see the "GO Competition Challenge 2 Information" resource below. Challenge 1 and Challenge 3 information can be found in the resources linked below.
Supporting ARPA-E Power Grid Optimization (Final Report)
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.
Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach
We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.
Methods for Representing Flexible, Energy-Constrained Technologies in Utility Planning Tools
Capacity expansion models are widely used by power system researchers, planners, and policy analysts to evaluate alternative power system investment scenarios. With the increasing deployment of wind and solar in the US, there has been much focus on improving the representations of variable generation (VG) technologies within capacity expansion models. Models that capture the variable net-load profiles and larger reserve requirements associated with high penetration VG systems represent an improvement to classic capacity expansion models, but fall short of capturing the complexities associated with storage technologies, such as battery energy storage (BES) and concentrating solar power with thermal energy storage (CSP with TES). While difficult to model in a capacity expansion setting, these technologies are potentially competitive sources of flexibility with the intriguing characteristics of being able to absorb VG that would otherwise be curtailed and directly contribute to renewable energy goals, respectively. In this paper we present methods for accurately representing these technologies in a large-scale capacity expansion model with high electrical and geospatial resolution. VG modeling techniques, including novel methods for capturing curtailment due to unit commitment and other hourly dispatch phenomena, are also reviewed. Modeling for a region in the southwestern United States demonstrates the economic relevance of being able to explicitly trade off the costs and capabilities of energy-constrained technologies, especially BES, against other resources in the near-term, in time to make plans for the coming decade