Stochastic Unit Commitment: Scalable Computation and Experimental Results.
Abstract not provided.
Watson, Jean-Paul↗
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.
Assessment of Wind Power Scenario Generation Methods for Stochastic Unit Commitment.
Abstract not provided.
Staid, Andrea↗
Stochastic Unit Commitment Performance Considering Monte Carlo Wind Power Scenarios.
Abstract not provided.
Watson, Jean-Paul↗
Modeling Flexible Generator Operating Regions via Chance-constrained Stochastic Unit Commitment.
Abstract not provided.
Singh, Bismark↗
Systematic Evaluation of Stochastic Methods in Power System Scheduling and Dispatch with Renewable Energy
As more wind power and other renewable resources are being integrated into the electric power grid, the forecast uncertainty brings operational challenges for the power system operators. In this report, different operational strategies for uncertainty management are presented and evaluated. A comprehensive and consistent simulation framework is developed to analyze the performance of different reserve policies and scheduling techniques under uncertainty in wind power. Numerical simulations are conducted on a modified version of the IEEE 118-bus system with a 20% wind penetration level, comparing deterministic, interval, and stochastic unit commitment strategies. The results show that stochastic unit commitment provides a reliable schedule without large increases in operational costs. Moreover, decomposition techniques, such as load shift factor and Benders decomposition, can help in overcoming the computational obstacles to stochastic unit commitment and enable the use of a larger scenario set to represent forecast uncertainty. In contrast, deterministic and interval unit commitment tend to give higher system costs as more reserves are being scheduled to address forecast uncertainty. However, these approaches require a much lower computational effort Choosing a proper lower bound for the forecast uncertainty is important for balancing reliability and system operational cost in deterministic and interval unit commitment. Finally, we find that the introduction of zonal reserve requirements improves reliability, but at the expense of higher operational costs.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.
97 MATHEMATICS AND COMPUTING↗
Flexible operation of batteries in power system scheduling with renewable energy
The fast growing expansion of renewable energy increases the complexities in balancing generation and demand in the power system. The energy-shifting and fast-ramping capability of energy storage has led to increasing interests in batteries to facilitate the integration of renewable resources. In this paper, we present a two-step framework to evaluate the potential value of energy storage in power systems with renewable generation. First, we formulate a stochastic unit commitment approach with wind power forecast uncertainty and energy storage. Second, the solution from the stochastic unit commitment is used to derive a flexible schedule for energy storage in economic dispatch where the look-ahead horizon is limited. Here, analysis is conducted on the IEEE 24-bus system to demonstrate the benefits of battery storage in systems with renewable resources and the effectiveness of the proposed battery operation strategy.
25 ENERGY STORAGE↗
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↗
Stochastic Multi-Timescale Power System Operations With Variable Wind Generation
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.
17 WIND ENERGY↗
Large-scale Stochastic Optimization for Unit Commitment and Economic Dispatch
Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production cost simulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Large-Scale Stochastic Optimization for Unit Commitment and Economic Dispatch
Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production costsimulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
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↗
Generating short-term probabilistic wind power scenarios via nonparametric forecast error density estimators: Generating short-term probabilistic wind power scenarios via nonparametric forecast error density estimators
Forecasts of available wind power are critical in key electric power systems operations planning problems, including economic dispatch and unit commitment. Such forecasts are necessarily uncertain, limiting the reliability and cost effectiveness of operations planning models based on a single deterministic or “point” forecast. A common approach to address this limitation involves the use of a number of probabilistic scenarios, each specifying a possible trajectory of wind power production, with associated probability. We present and analyze a novel method for generating probabilistic wind power scenarios, leveraging available historical information in the form of forecasted and corresponding observed wind power time series. We estimate non-parametric forecast error densities, specifically using epi-spline basis functions, allowing us to capture the skewed and non-parametric nature of error densities observed in real-world data. We then describe a method to generate probabilistic scenarios from these basis functions that allows users to control for the degree to which extreme errors are captured.We compare the performance of our approach to the current state-of-the-art considering publicly available data associated with the Bonneville Power Administration, analyzing aggregate production of a number of wind farms over a large geographic region. Finally, we discuss the advantages of our approach in the context of specific power systems operations planning problems: stochastic unit commitment and economic dispatch. Here, our methodology is embodied in the joint Sandia – University of California Davis Prescient software package for assessing and analyzing stochastic operations strategies.
17 WIND ENERGY↗
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↗
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↗