Download This PaperMeeting Corporate Renewable Power Targets
50 Pages Posted: 2 Jan 2019 Last revised: 18 Jan 2022
Date Written: December 2, 2018
Abstract
Several corporations have committed to procuring a percentage of their electricity demand from renewable sources by a future date. Long-term financial contracts with renewable generators based on a fixed strike price, known as virtual power purchase agreements (VPPAs), are popular to meet such a target. We formulate rolling power purchases using a portfolio of VPPAs as a Markov decision process, accounting for uncertainty in generator availability and in the prices of electricity, renewable energy certificates, and VPPAs. Obtaining an optimal procurement policy is intractable. We consider forecast-based reoptimization heuristics consistent with practice that limit the sourcing of different VPPA types and the timing of new agreements. We extend these heuristics and introduce an information-relaxation based reoptimization heuristic, both of which allow for full sourcing and timing flexibilities. The latter heuristic also accounts for future uncertainties when making a decision. We assess the value of decision flexibility in rolling power purchases to meet a renewable target by numerically comparing the aforementioned policies and variants thereof on realistic instances involving a novel strike price stochastic process calibrated to data. Policies with full timing flexibility and no sourcing flexibility reduce procurement costs significantly compared to one with neither type of flexibility. Introducing sourcing flexibility in the former policies results in further significant cost reduction, thus providing support for using VPPA portfolios that are both dynamic and heterogeneous. Computing near-optimal portfolios of this nature entails using our information-relaxation based reoptimization heuristic because portfolios constructed via forecast-based reoptimization exhibit higher suboptimality.
Keywords: energy, renewable power, sustainability, power purchase agreements, Markov decision processes, approximate dynamic programming
JEL Classification: C61, L9
Suggested Citation: Suggested Citation