Energy Systems under Uncertainty: Modeling and Computations

Similar documents
Dynamic Risk Management in Electricity Portfolio Optimization via Polyhedral Risk Functionals

Scenario reduction and scenario tree construction for power management problems

Approximations of Stochastic Programs. Scenario Tree Reduction and Construction

Scenario tree generation for stochastic programming models using GAMS/SCENRED

Approximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications

Multistage risk-averse asset allocation with transaction costs

Worst-case-expectation approach to optimization under uncertainty

Dynamic Replication of Non-Maturing Assets and Liabilities

Stochastic Programming in Gas Storage and Gas Portfolio Management. ÖGOR-Workshop, September 23rd, 2010 Dr. Georg Ostermaier

A Multi-Stage Stochastic Programming Model for Managing Risk-Optimal Electricity Portfolios. Stochastic Programming and Electricity Risk Management

Implications of Spot Price Models on the Valuation of Gas Storages

EC316a: Advanced Scientific Computation, Fall Discrete time, continuous state dynamic models: solution methods

Log-Robust Portfolio Management

Fast Convergence of Regress-later Series Estimators

Statistical Models and Methods for Financial Markets

Notes. Cases on Static Optimization. Chapter 6 Algorithms Comparison: The Swing Case

Market Risk Analysis Volume I

Idiosyncratic risk, insurance, and aggregate consumption dynamics: a likelihood perspective

Investigation of the and minimum storage energy target levels approach. Final Report

Multistage Stochastic Programs

MULTI-STAGE STOCHASTIC ELECTRICITY PORTFOLIO OPTIMIZATION IN LIBERALIZED ENERGY MARKETS

Monte Carlo Methods for Uncertainty Quantification

ANALYSIS OF THE BINOMIAL METHOD

Computational Finance Binomial Trees Analysis

Contents Critique 26. portfolio optimization 32

Multi-Period Trading via Convex Optimization

Scenario Construction and Reduction Applied to Stochastic Power Generation Expansion Planning

EE266 Homework 5 Solutions

To apply SP models we need to generate scenarios which represent the uncertainty IN A SENSIBLE WAY, taking into account

The Optimization Process: An example of portfolio optimization

Optimal Security Liquidation Algorithms

Optimal sale bid for a wind producer in Spanish electricity market.

EE/AA 578 Univ. of Washington, Fall Homework 8

Integer Programming Models

Chapter 6 Forecasting Volatility using Stochastic Volatility Model

Multistage Stochastic Mixed-Integer Programs for Optimizing Gas Contract and Scheduling Maintenance

IEOR E4703: Monte-Carlo Simulation

1. You are given the following information about a stationary AR(2) model:

Universitat Politècnica de Catalunya (UPC) - BarcelonaTech

Extended Libor Models and Their Calibration

Scenario Generation for Stochastic Programming Introduction and selected methods

Analytical Option Pricing under an Asymmetrically Displaced Double Gamma Jump-Diffusion Model

Report for technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional do Sistema Elétrico Risk Averse Approach

Discussion Paper No. DP 07/05

IMPLEMENTING THE SPECTRAL CALIBRATION OF EXPONENTIAL LÉVY MODELS

Modelling the Sharpe ratio for investment strategies

arxiv: v1 [math.oc] 28 Jan 2019

Optimal construction of a fund of funds

Window Width Selection for L 2 Adjusted Quantile Regression

Modeling dynamic diurnal patterns in high frequency financial data

Monte-Carlo Methods in Financial Engineering

Financial Giffen Goods: Examples and Counterexamples

Heterogeneous Firm, Financial Market Integration and International Risk Sharing

Multistage Stochastic Demand-side Management for Price-Making Major Consumers of Electricity in a Co-optimized Energy and Reserve Market

Robust Dual Dynamic Programming

Portfolio Management and Optimal Execution via Convex Optimization

MS-E2114 Investment Science Lecture 5: Mean-variance portfolio theory

Monte Carlo Methods in Finance

A No-Arbitrage Theorem for Uncertain Stock Model

TWO-STAGE PORTFOLIO OPTIMIZATION WITH HIGHER-ORDER CONDITIONAL MEASURES OF RISK

2.1 Mathematical Basis: Risk-Neutral Pricing

Course information FN3142 Quantitative finance

Identifying Long-Run Risks: A Bayesian Mixed-Frequency Approach

Arbitrage Conditions for Electricity Markets with Production and Storage

Journal of Computational and Applied Mathematics. The mean-absolute deviation portfolio selection problem with interval-valued returns

Practical example of an Economic Scenario Generator

Matlab Based Stochastic Processes in Stochastic Asset Portfolio Optimization

Chapter 5 Univariate time-series analysis. () Chapter 5 Univariate time-series analysis 1 / 29

On Complexity of Multistage Stochastic Programs

Optimally Thresholded Realized Power Variations for Lévy Jump Diffusion Models

6.231 DYNAMIC PROGRAMMING LECTURE 8 LECTURE OUTLINE

Chapter 2 Uncertainty Analysis and Sampling Techniques

Comparison of Static and Dynamic Asset Allocation Models

Resource Planning with Uncertainty for NorthWestern Energy

The Correlation Smile Recovery

Quantitative Risk Management

Economics 2010c: Lecture 4 Precautionary Savings and Liquidity Constraints

IEOR E4602: Quantitative Risk Management

Simultaneous optimization for wind derivatives based on prediction errors

Noureddine Kouaissah, Sergio Ortobelli, Tomas Tichy University of Bergamo, Italy and VŠB-Technical University of Ostrava, Czech Republic

Introducing LIST. Riccardo Bernini Head of Financial Engineering Enrico Melchioni Head of International Sales. March 2018

Risk Management and Time Series

PORTFOLIO THEORY. Master in Finance INVESTMENTS. Szabolcs Sebestyén

Valuation of performance-dependent options in a Black- Scholes framework

Scenario Reduction and Scenario Tree Construction for Power Management Problems

Sample Path Large Deviations and Optimal Importance Sampling for Stochastic Volatility Models

Properties of the estimated five-factor model

Risk aversion in multi-stage stochastic programming: a modeling and algorithmic perspective

Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem

ROBUST OPTIMIZATION OF MULTI-PERIOD PRODUCTION PLANNING UNDER DEMAND UNCERTAINTY. A. Ben-Tal, B. Golany and M. Rozenblit

Competition in Electricity Markets with Renewable Sources

The University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay. Solutions to Final Exam

Parameter estimation in SDE:s

Market risk measurement in practice

A Numerical Approach to the Estimation of Search Effort in a Search for a Moving Object

EE365: Risk Averse Control

Simplified stage-based modeling of multi-stage stochastic programming problems

Monte Carlo Simulation of a Two-Factor Stochastic Volatility Model

4 Reinforcement Learning Basic Algorithms

PORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA

Transcription:

Energy Systems under Uncertainty: Modeling and Computations W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Systems Analysis 2015, November 11 13, IIASA (Laxenburg, Austria)

Introduction Energy systems often contain uncertain parameters, for example, demands, prices, inflows, wind speeds. Hence, an important modeling issue is data driven uncertainty quantification. In most cases, huge data sets are available. We discuss how starting from suitable statistical models sets of scenarios are generated that are representative for the uncertain parameters. The scenarios are then inserted into mathematical models describing the systems. In this talk we consider the following two examples of energy systems: Electricity portfolio management under load-price uncertainty Evaluation of gas network capacities under demand uncertainty, validation of nominations and verification of booked capacities (supporting decisions of gas transmission system operators (TSOs) to sell capacity rights to customers) nomination = vector defining the amounts of gas entering and leaving at each entry and exit, respectively gas network capacity = determined by the set of all reasonable nominations validation of nominations = answering the question whether particular nominations can be transported verification of booked capacities = how likely is that all reasonable nominations can be transported?

Mean-Risk Electricity Portfolio Management (A. Eichhorn, I. Wegner-Specht)

We consider the electricity portfolio management of a German municipal electric power company. Its portfolio consists of the following positions: Power production (based on company-owned thermal units), (yearly) bilateral contracts, (physical) (day-ahead) spot market trading (e.g., European Energy Exchange (EEX)) and (financial) trading of (monthly) electricity futures. The time horizon is discretized into hourly intervals. The underlying stochasticity consists in a multivariate stochastic load and price process that will be represented approximately by a finite number of scenarios. The objective is to maximize the total expected revenue and to minimize the risk. The portfolio management model is a large scale (mixed-integer) multistage stochastic optimization problem.

350 300 LOAD [MWh] 250 200 150 0 1000 2000 3000 4000 5000 6000 7000 8000 TIME [h] Figure 1: Time plot of load profile for one year 150 SPOT PRICE [EUR] 100 50 0 0 1000 2000 3000 4000 5000 6000 7000 8000 TIME [h] Figure 2: Time plot of spot price profile for one year

Statistical models and scenario trees For the stochastic input data of the optimization model (here yearly electricity and heat demand, and electricity spot prices), a statistical model is employed. - cluster classification for the intra-day (demand and price) profiles, - Three-dimensional linear time series model for the daily average values (deterministic trend functions, a trivariate ARMA model for the (stationary) residual time series), - Generation of scenarios by computing (Quasi-)Monte Carlo samples from the multivariate normal distribution that corresponds to the ARMA process, and adding on trend functions as well as matched intra-day profiles from the clusters afterwards, - generation of scenario trees based on monthly recursive scenario reduction applied to a given set of scenarios (Heitsch-Römisch 09).

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 Yearly scenario tree for the trivariate load-price process with monthly branching

Numerical results Test runs were performed on real-life data of a German municipal power company leading to a linear optimization problem containing T = 365 24 = 8760 time steps, a scenario tree with 40 demand-price scenarios with about 150.000 nodes. The objective function is of the form Minimize γρ(z) (1 γ)e(z T ) with some (multiperiod) risk measure ρ with risk aversion parameter γ [0, 1] (γ = 0 corresponds to the risk-neutral case). Risk measure (of aggregation type): ( ) ρ(z) = AVaR α min z t j j=1,...,j = inf r R { r + 1 E[max{0, r min α z t j }] j=1,...,j where {z t : t = 1,..., T } is the stochastic revenue process and t j, j = 1,..., J, J = 52, are the risk measuring time steps. The latter correspond to 11 pm at the last trading day of each week. },

It turns out that the numerical results for the expected maximal revenue and minimal risk E(z γ T ) and ρ(z γ t 1,..., z γ t J ) with the optimal revenue process z γ are (almost) identical for γ [0.15, 0.95] and the risk measure ρ. The efficient frontier γ ( ρ(z γ t 1,..., z γ t J ), E(z γ T )) is concave for γ [0, 1]. -2.88e+06 Expectation -2.885e+06-2.89e+06-2.895e+06 3e+06 3.5e+06 4e+06 4.5e+06 Lambda Efficient frontier The LP is solved by CPLEX 9.1 in about 1 h running time on a 2 GHz Linux PC with 1 GB RAM. Risk aversion costs less than 1% of the expected overall revenue.

0-2e+06-4e+06-6e+06 label -8e+06-1e+07 0 1000 2000 3000 4000 5000 6000 7000 8000 9000 Overall revenue scenarios for γ = 0 600000 400000 200000 0-200000 -400000-600000 label 0 50 100 150 200 250 Future trading for γ = 0

0 label -2e+06-4e+06-6e+06-8e+06-1e+07 0 1000 2000 3000 4000 5000 6000 7000 8000 9000 Overall revenue scenarios for γ = 0.9 600000 400000 200000 0-200000 -400000-600000 label 0 50 100 150 200 250 Future trading for γ = 0.9

Gas network capacities and validation of nominations (H. Heitsch, H. Leövey, R. Mirkov, I. Wegner-Specht) We consider the gas transport network of the company Open Grid Europe GmbH (OGE). It is Germany s largest gas transport company. Such networks consist of intermeshed pipelines which are actuated and safeguarded by active elements (like valves and compressor machines). Here, we consider the stationary state of the network and the isothermal case. Two different gas qualities are considered: H-gas and L-gas (high and low calorific gas). Both are transported by different networks. The gas dynamics in a pipe is modeled by the Euler equations, a nonlinear system of hyperbolic partial differential equations. In the stationary and isothermal situation they boil down to nonlinear relations between pressure and flow. Together with models for the active elements, this leads to large systems of nonlinear mixed-integer equations and inequalities. Aim: Evaluating the capacity of a gas network, validating nominations and verifying booked capacities.

Statistical data and data analysis Hourly gas flow data is available at all exit nodes of a given network for a period of eight years. Due to stationary modeling we consider the daily mean gas flow at all exit nodes. Since it depends on the daily mean temperature, we consider a daily reference temperature based on a weighted average temperature taken at different network nodes. Due to stationary and isothermal modeling we introduce the temperature classes (-15,-4], (-4,-2], (-2,0],..., (18,20], (20,30) and perform a corresponding filtering of all daily mean gas flows at all exit nodes according to the daily reference temperatures. We also check that a reasonable amount of daily mean gas flow data is available for all temperature classes except for (-15,-4]. Another filtering is carried out for day classes (working day, weekend, holiday).

Examples of daily main gas flow at exit nodes as function of the temperature Daily mean gas flow data at exit nodes with municipal power stations, with zero flow (right). Daily mean gas flow data at exit nodes with company (left), market transition (middle), storage (right).

Univariate distribution fitting Classes of univariate probability distributions: (shifted) uniform distributions (shifted) (log)normal distributions Zero gas flow appears with empirical probability p at several exit nodes. Hence, we consider the shifted probability distribution function F (x) = p F 0 (x) + (1 p) F + (x) Probability distribution function of a shifted normal distribution at exit 1603

Fitting multivariate normal distributions Multivariate normal distributions are fitted for exit gas flows that satisfy normality tests and have significant correlations with other exit nodes, i.e., in addition to means and variances, correlations are estimated by standard estimators if sufficient data is available. Examples of correlation matrices: Correlation plots for the temperature classes (10, 12] and (18, 20] in certain areas of the H-gas network.

Forecasting gas flow demand for low temperatures Low temperatures require a specific treatment due to lack of data. Idea: Penalized spline (P-spline) regression with shape constraints. Ansatz: Least squares regression for all standardized daily maximal gas flows y i for the temperature t i at some exit node. { n m m min (y i S(t i )) 2 + λ (δ 2 a j ) 2 + κ b j (δ 1 a j ) }, 2 a R m i=1 where λ and κ are positive smoothing and shape parameters and m S(t) = a j B j (t) is a cubic spline in B-spline basis representation. Here, it holds δ 1 a j = a j a j 1 und δ 2 a j = a j 2a j 1 + a j 2. j=3 j=1 j=2

Using the regression model to fit the mean of a univariate normal distribution at t = 14 C and using the variance taken from the temperature class ( 4 C, 2 C]. Example parameters: λ = 2.51, κ = 100 und b j = 1. P-spline regression with flattening asymptotes and comparison with sigmoid regression (red)

Scenario generation Using randomized Quasi-Monte Carlo methods we determine N samples with probability 1 N for the d-dimensional random vector ξ that corresponds to the random gas flows at the d exits of a given network. We proceed as follows: We determine N samples η j of the uniform distribution on [0, 1) d using Sobol points and perform a componentwise random scrambling of their binary digits using the Mersenne Twister. The scenarios η j, j = 1,..., N, combine favorable properties of both Monte Carlo and Quasi-Monte Carlo methods. Determine samples in R d by ζ j i = Φ 1 i (η j i ) (i = 1,..., d; j = 1,..., N) using the univariate distribution function Φ i of the ith component. If a part of the components of ξ has a d-dimensional multivariate normal distribution with mean m R s and s s covariance matrix Σ, we perform a decomposition Σ = A A, where the matrix A preferably corresponds to principal component analysis. Then the s-dimensional vectors ξ j = A ζ j + m (j = 1, 2,..., N) are suitable scenarios for this part of the random vector ξ.

1 1 0.9 0.9 0.8 0.8 0.7 0.7 0.6 0.6 0.5 0.5 0.4 0.4 0.3 0.3 0.2 0.2 0.1 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Comparison of n = 2 7 Monte Carlo Mersenne Twister points and randomly binary shifted Sobol points in dimension d = 500, projection (8,9)

Optimal scenario reduction Given is a large number N of d-dimensional scenarios ξ i, i = 1,..., N, with probabilities 1 N and a norm on Rd. The aim is to select n N scenarios and to determine their new probabilities such that the discrete probability distribution based on the original scenario set is approximated best possible in terms of the so-called Kantorovich distance of probability distributions (optimal scenario reduction). First, this requires the solution of the combinatorial optimization problem { } min min i J ξi ξ j : J {1,..., N}, #J = N n j J (called n-median problem) to determine the index set J of deleted scenarios. This problem is N P-hard and may be reformulated as a mixed-integer linear optimization problem. Simple greedy heuristics work well in many cases. Secondly, the new probabilities p i, i J, of the selected scenarios are p i = 1+#J i N, where J i = {j J : i = i(j)} and i(j) arg min i J ξi ξ j, i.e., the probability of any deleted scenario is added to the probability of one of the closest selected scenarios (optimal redistribution).

Illustration: 10 3 samples based on randomized Quasi-Monte Carlo methods are generated and later reduced by scenario reduction to 50 scenarios. The result is shown below where the diameters of the red balls are proportional to the new probabilities. 160000 140000 Hourly mean daily power in kwh/h 120000 100000 80000 60000 40000 20000 0-15 -10-5 0 5 10 15 20 25 30 Mean daily temperature in C

Conclusions Filtering exit gas flow data into temperature classes and fitting univariate (shifted) uniform or (log)normal distributions, respectively, and of multivariate (log)normal distributions for groups of exits. A univariate normal distribution is assumed for low temperatures. Its mean is fitted by a P-spline regression and its standard deviation is taken from the neighboring temperature class. Randomized Quasi-Monte Carlo methods are used to generate a large number of gas flow scenarios at all network exits. Using optimal scenario reduction the large scenario set is represented best possible by a reasonable number of scenarios for computational feasibility studies. Literature: T. Koch, B. Hiller, M. E. Pfetsch and L. Schewe (Eds.): Evaluating Gas Network Capacities, MOS- SIAM Series on Optimization, Philadelphia, 2015.