Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChance-Constrained Ancillary Service Specification for Heterogeneous Storage Devices
102
0
0.0
(
0
)
Added by
Michael Evans
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We present a method to find the maximum magnitude of any supply-shortfall service that an aggregator of energy storage devices is able to sell to a grid operator. This is first demonstrated in deterministic settings, then applied to scenarios in which device availabilities are stochastic. In this case we implement chance constraints on the inability to deliver as promised. We show a significant computational improvement in using our method in place of straightforward scenario simulation. As an extension, we present an approximation to this method which allows the determined fleet capability to be applied to any chosen service, rather than having to re-solve the chance-constrained optimisation each time.
rate research
Read More
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. This article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.
This paper considers the optimal dispatch of energy-constrained heterogeneous storage units to maximise security of supply. A policy, requiring no knowledge of the future, is presented and shown to minimise unserved energy during supply-shortfall events, regardless of the supply and demand profiles. It is accompanied by a graphical means to rapidly determine unavoidable energy shortfalls, which can then be used to compare different device fleets. The policy is well-suited for use within the framework of system adequacy assessment; for this purpose, a discrete time optimal policy is conceived, in both analytic and algorithmic forms, such that these results can be applied to discrete time systems and simulation studies. This is exemplified via a generation adequacy study of the British system.
The uncertainty of multiple power loads and re-newable energy generations in power systems increases the complexity of power flow analysis for decision-makers. The chance-constraint method can be applied to model the optimi-zation problems of power flow with uncertainty. This paper develops a novel solution approach for chance-constrained AC optimal power flow (CCACOPF) problem based on the da-ta-driven convexification of power flow and the fast algorithm for scenario technique (FAST). This method is computationally effective for mainly two reasons. First, the original nonconvex AC power flow constraints are approximated by a set of learn-ing-based quadratic convex ones. Second, FAST is a more ad-vanced distribution-free scenario-based solution method using far less scenarios than the conventional one, retaining a high confidence level. Eventually, the CCACOPF is converted into a computationally tractable convex optimization problem. The simulation results on IEEE test cases indicate that 1) the pro-posed solution method can excel the conventional one and ro-bust program in computational efficiency, 2) the data-driven convexification of power flow is effective in approximating original complex AC power flow.
Recently, chance-constrained stochastic electricity market designs have been proposed to address the shortcomings of scenario-based stochastic market designs. In particular, the use of chance-constrained market-clearing avoids trading off in-expectation and per-scenario characteristics and yields unique energy and reserves prices. However, current formulations rely on symmetric control policies based on the aggregated system imbalance, which restricts balancing reserve providers in their energy and reserve commitments. This paper extends existing chance-constrained market-clearing formulations by leveraging node-to-node and asymmetric balancing reserve policies and deriving the resulting energy and reserve prices. The proposed node-to-node policy allows for relating the remuneration of balancing reserve providers and payment of uncertain resources using a marginal cost-based approach. Further, we introduce asymmetric balancing reserve policies into the chance-constrained electricity market design and show how this additional degree of freedom affects market outcomes.
We propose a sigmoidal approximation for the value-at-risk (that we call SigVaR) and we use this approximation to tackle nonlinear programs (NLPs) with chance constraints. We prove that the approximation is conservative and that the level of conservatism can be made arbitrarily small for limiting parameter values. The SigVar approximation brings scalability benefits over exact mixed-integer reformulations because its sample average approximation can be cast as a standard NLP. We also establish explicit connections between SigVaR and other smooth sigmoidal approximations recently reported in the literature. We show that a key benefit of SigVaR over such approximations is that one can establish an explicit connection with the conditional value at risk (CVaR) approximation and exploit this connection to obtain initial guesses for the approximation parameters. We present small- and large-scale numerical studies to illustrate the developments.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
