SearcharxivSearch

arXiv · 1611.08006

Pricing Energy in the Presence of Renewables

Abstract

At present, electricity markets largely ignore the fact that renewable power producers impose significant externalities on non-renewable energy producers. This is because consumers are generally guaranteed electricity within certain load parameters. The intermittent nature of production by renewable energy producers implies that they rely on non-renewable producers so that the aggregate power delivered meets the promised quality of service. This implicit insurance provided by the non-renewable power sector to consumers is not currently priced and leads to an often ignored, hidden monetary transfer from non-renewable producers to renewable producers. As the fraction of energy supplied by renewable resources increases, these externalities also increase. In this paper, we quantify these externalities by developing the market clearing price of energy in the presence of renewable energy. We consider a day-ahead electricity market where renewable and non-renewable generators bid by proposing their asking price per unit of energy to an independent system operator (ISO). The ISO's problem is a multi-stage stochastic optimization problem to dispatch energy from each generator to minimize the cost of purchased energy on behalf of the consumers. We incorporate the notion of load variance using the Conditional Value-at-Risk (CVAR) measure in the day-ahead electricity market to ensure that the generators are able to meet the load within a desired confidence level. We analytically derive the market clearing price of energy as a function of CVAR. It is shown that a higher penetration level of the renewable energies may increase the market clearing price of energy.

Explore related subjects

Keep this discovery

BibTeXRIS

Ashkan Zeinalzadeh, Indraneel Chakraborty, Vijay Gupta. 2016-11-23. Pricing Energy in the Presence of Renewables. https://arxiv.org/abs/1611.08006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC