Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic 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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A hybrid data-driven and model-based approach for computationally efficient stochastic unit commitment and economic dispatch under wind and solar uncertainty

Stochastic unit commitment (UC) and economic dispatch (ED) are imperative in dealing with uncertainty in renewable forecast for power system operation and planning such that the overall expected production cost is minimized over the planning horizon. However, accurate calculation of the expected production cost requires assessment of a very large number of different scenarios of uncertain renewable resources, such as solar and wind, which is practically infeasible to simulate in real time. This article proposes a hybrid datadriven and physics-based model-predictive paradigm to efficiently solve for stochastic unit commitment and economic dispatch considering uncertainty in wind and solar power forecasts. Here, the novelty of the approach lies in decoupling the production cost estimation from the unit commitment and economic dispatch optimization problems under uncertainty without compromising on the fidelity of the solutions. A data-driven machine learning model is first developed to predict the mean optimal production cost. A physics-based inverse problem is then solved to get the stochastic UC and ED profiles from the expected cost. The presented approach considers, for the first time, solar uncertainty in UC/ED determination and enables efficient and accurate propagation of wind and solar uncertainty to estimate the statistics of the production cost. The effectiveness of the developed approach is demonstrated systematically on a stylized RTS-GMLC single-node system. The overall framework predicts the expected cost 62.5% more accurately than the existing state-of-the-art, on unforeseen days during the entire year, and yields, for the first time, the associated physically consistent UC and ED profiles. The solutions are also shown to be flexible in providing adequate daily reserves to address any statistical deviations from probabilistic power forecasts. The computational time associated with the presented method is only about 10 s compared to over 24 h needed for a conventional stochastic UC/ED determination under uncertainty on an Intel Core i9 processor with 32 GB of RAM.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Modeling Flexible Generator Operating Regions via Chance- constrained Stochastic Unit Commitment

Here, we introduce a novel chance-constrained stochastic unit commitment model to address uncertainty in renewables' production uncertainty in power systems operation. For most thermal generators,underlying technical constraints that are universally treated as "hard" by deterministic unit commitment models are in fact based on engineering judgments, such that system operators can periodically request operation outside these limits in non-nominal situations, e.g., to ensure reliability. We incorporate this practical consideration into a chance-constrained stochastic unit commitment model, specifically by in-frequently allowing minor deviations from the minimum and maximum thermal generator power output levels. We demonstrate that an extensive form of our model is computationally tractable for medium-sized power systems given modest numbers of scenarios for renewables' production. We show that the model is able to potentially save significant annual production costs by allowing infrequent and controlled violation of the traditionally hard bounds imposed on thermal generator production limits. Finally, we conduct a sensitivity analysis of optimal solutions to our model under two restricted regimes and observe similar qualitative results.

42 ENGINEERING↗
DOE OSTI2023

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗
DOE OSTI2021

State-of-the-Art Techniques for Large-Scale Stochastic Unit Commitment

Recent advances in deterministic unit commitment, both formulaic and algorithmic, along with modern algorithmic approaches for stochastic programming, have enabled the solution of stochastic unit commitment problems with hundreds of scenarios on large-scale transmission networks. In this presentation, we will give an overview of these methods, including lazy transmission constraint generation, lower-bounding techniques, and heuristics, all of which can be executed in concert with customized decomposition approaches for optimization under uncertainty. We demonstrate the effectiveness of these techniques on the TAMU Texas7K synthetic transmission network, leveraging realistic high-resolution forecasts based on NREL renewable resource availability data. The software leveraged for these demonstrations is available via the open-source software packages EGRET (for electrical grid optimization) and mpi-sppy (for optimization under uncertainty).

27 ARPA - Advanced Research Projects Agency-Energy↗
DOE OSTI2022

Investigation of Stochastic Unit Commitment to Enable Advanced Flexibility Measures for High Shares of Solar PV

As the share of solar photovoltaics (PV) in the power system increases, there is a growing need for flexibility from multiple, possibly interdependent sources to adjust to PV's variability, uncertainty, and diurnal dependence. This paper investigates how stochastic unit commitment leveraging probabilistic solar forecasts can support other flexibility measures under high solar shares. We consider two flexibility measures relevant to day-ahead scheduling: battery energy time-shifting and solar ancillary service provision. Unit commitment and economic dispatch simulations are conducted on a realistic test system based on Texas using day-ahead solar trajectories. The benefits of the two flexibility measures are pronounced when the instantaneous solar share is high, offering cost savings of 10%-20% in the spring. For a Texas-sized system, this translates to hundreds of millions of dollars in cost savings once the installed PV capacity enables instantaneous solar shares regularly exceeding 40%. Using probabilistic forecasts also greatly increases the reliability of upward reserve provision from solar PV, reducing unserved reserves by 50%-100%. Both day-ahead forecast resolution and errors can impact system reliability at high solar shares, but the stochastic formulation has significant value, mitigating reliability impacts on over-forecast days.

ancillary services↗
DOE OSTI2023

A Predictive Prescription Framework for Stochastic Unit Commitment Using Boosting Ensemble Learning Algorithms

To take unit commitment (UC) decisions under uncertain load, most existing stochastic optimization (SO) frameworks adopt a generic representation of uncertainty. While load levels that materialize on a particular day are influenced by various covariates (such as the day of the week or temperature), SO frameworks typically disregard such side observations, wasting actionable information that could significantly enhance decision quality. Here, this article proposes a contextual SO (CSO) framework for UC under uncertain load, which can effectively exploit covariate observations in conjunction with a class of machine learning (ML) algorithms to improve the out-of-sample performance of UC decisions. It shows how three ML algorithms, adaptive boosting, gradient boosted trees, and extreme gradient boosting, can be used to this end, constituting the first application of these algorithms in any CSO framework. Using real-world data harvested from the New York ISO grid, we measure the out-of-sample performance of the framework in terms of total operation cost, shed load values, locational marginal prices, and total payments by the loads, against several benchmark methods proposed in the literature. The article has an online companion (Yurdakul et al.), wherein we present additional results and lay out further mathematical formulations used in this work.

42 ENGINEERING↗
DOE OSTI2023

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.

MATHEMATICS AND COMPUTING↗
DOE OSTI2022

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.

25 ENERGY STORAGE↗
DOE OSTI2020

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.

25 ENERGY STORAGE↗
DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stochastic economic dispatch of wind power under uncertainty using clustering-based extreme scenarios

Operation of power systems with high penetrations of renewable energy sources requires tools for robust decision making under uncertainty. Stochastic economic dispatch and stochastic unit commitment are effective techniques for planning and operation under uncertainty, whose effectiveness depends on the cardinality and quality of the scenario set. Here, this article proposes a machine learning method using -means clustering for capturing relevant physical information from a large population of analog scenarios. Extreme scenario samples drawn from the clusters are used in a two-stage stochastic economic dispatch computation. The effectiveness of the proposed approach is assessed on a synthetic 200-bus system with a geographic footprint over Illinois, USA for four months from each season of WIND Toolkit data. The combination of -means clustering with importance sampling is shown to reduce the total operational cost by over 43% compared to sampling from populations based on heuristic clustering-based methods. Additionally, the variability in the mean cost is about 56% lower than the variability using Monte Carlo sampling. Moreover, the operational cost with the presented approach is shown to be close to the cost calculated based on a hindsight exact wind profile, signifying a highly accurate quantification of wind uncertainty by the presented -means clustering based sampling method.

17 WIND ENERGY↗
DOE OSTI2024

GRACE Final Technical Report

The GRACE project (Grid that is Risk-Aware for Clean Electricity) was a five-year research initiative funded by the U.S. Department of Energy's Advanced Research Projects Agency- Energy (ARPA-E) under the PERFORM program. Led by Duke University's Nicholas School of the Environment, with contributions from The Ohio State University, North Carolina State University, Dartmouth College, and Pacific Northwest National Laboratory, the project addressed a fundamental challenge in grid management: conventional software plans for a single most-likely outcome and relies on reserves as a buffer, leaving utilities poorly equipped for the growing variability introduced by renewable energy. GRACE demonstrated a better approach: explicitly representing thousands of plausible future scenarios and choosing operating schedules that perform well across all of them.

14 SOLAR ENERGY↗
DOE OSTI2026

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"

Maack, Jonathan [National Laboratory of the Rockie↗
DOE OSTI2021

STOCHASTIC OPTIMAL POWER FLOW FOR REAL-TIME MANAGEMENT OF DISTRIBUTED RENEWABLE GENERATION AND DEMAND RESPONSE (Final Report)

To meet the grand challenge of a sustainable energy future, there has been a surge of interest in renewable energy. Today, the uncertainty associated with renewable resources is handled by using operating reserves. The high penetration of renewable resources, however, introduces difficult-to-control dynamics and challenges for power system operation. Decision support tools are necessary at the bulk system operational level to recognize and efficiently utilize renewable resources and distributed demand response products in concert with traditional grid resources. It is envisaged that responsive load can potentially have very significant cost advantages over either spinning or non-spinning ramping reserve. Critical decisions are made during hour(s)-ahead and real-time power system operation regarding the commitment and dispatch of generators to ensure power delivery is both reliable and economic. These decisions are typically made by a security constrained optimal flow, which determines future generator commitments, dispatches, and ensures adequate reserves are available in the event of a contingency (unexpected outage) or if future system conditions deviate from forecasts. However, security has been always based on a pre-specified subset of contingency constraints whose enforcement does not guarantee security under all possible future possibilities while also giving little or no weight to the likelihood of each contingent event or the severity of its consequences. Existing tools, which are based exclusively on deterministic optimization models, do not yield optimal operational decisions to address these new challenges, in terms of both reliability and cost-effectiveness. This project has focused on developing a stochastic optimal power flow (SOPF) framework, which integrates renewable resource uncertainty, load uncertainty, distributed storage (DS), demand response (DR) products, in a holistic manner to address the uncertainty associated with ever-increasing renewable resources, along with the inclusion of distributed demand response products in future power systems. A proof-of-concept problem was created using the Pennsylvania-Jersey-Maryland (PJM) power system network. Synthetic wind generation was added to the system to simulate 50% wind penetration. A 1-hour test of SOPF operation indicated more than 6% operational cost savings. The project continued by adding the Midwestern Independent System Operator (MISO) as a partner, with focus shifting from SOPF to Stochastic Look-Ahead Unit Commitment (SLAC). Unlike PJM, MISO is faced with significant renewable energy resources within its footprint and is challenged with substantial uncertainty in its operations. The SLAC distinguishes itself from existing tools that operators use. At best, today’s tools solve two to three cases independently, where one or two system parameters, such as forecasted load level (e.g., a low, base, and high forecast), are varied and the resulting scenarios are analyzed independently. The stochastic-based optimization of SLAC leverages statistical information from an ensemble of potential operational scenarios and their respective likelihood. The SLAC output can be translated into valuable information to the operator such as suggested commitments, optimal scheduling and dispatch of resources, reserve requirements at both locational and zonal resolutions, ramping availability and requirements, availability of demand response including operational guidance concerning the near-term and real-time coordination between distributed energy resources, and utilization of distributed storage resources. The developed SOPF/SLAC tool, a stand-alone tool compatible with existing EMSs, will provide system operators with unprecedented visibility, flexibility and predictability to these resources and operational guidance concerning the real-time coordination between DERs and DR/DS products. The game changing and practical impact of this disruptive technology will be dramatic and will usher in a new era in the electric power industry, wherein green energy concepts are fully embraced, and electric power costs are lowered throughout the nation.

42 ENGINEERING↗
DOE OSTI2021

Stochastic Look Ahead Commitment: A Computational Perspective

This presentation gives an overview of a stochastic look ahead commitment (SLAC) problem for managing transmission grid uncertainty in the near- to medium-term (15 minutes to a few hours). We discuss formulation and solution methods, as well as application to transmission system operations.

27 ARPA - Advanced Research Projects Agency-Energy↗
DOE OSTI2023

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗