Academic Journal
Optimizing Instantaneous and Ramping Reserves With Different Response Speeds for Contingencies—Part I: Methodology
| Title: | Optimizing Instantaneous and Ramping Reserves With Different Response Speeds for Contingencies—Part I: Methodology |
|---|---|
| Authors: | Josh Schipper, Alan Wood, Conrad Edwards |
| Source: | IEEE Transactions on Power Systems. 35:3953-3960 |
| Publisher Information: | Institute of Electrical and Electronics Engineers (IEEE), 2020. |
| Publication Year: | 2020 |
| Subject Terms: | Quadratically Constrained Programming, Convex Optimization, Field of Research::09 - Engineering::0906 - Electrical and Electronic Engineering::090608 - Renewable Power and Energy Systems Engineering (excl. Solar Cells), Field of Research::09 - Engineering::0906 - Electrical and Electronic Engineering::090607 - Power and Energy Systems Engineering (excl. Renewable Power), 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Reserve Markets, 02 engineering and technology, Primary Frequency Control Reserve, 7. Clean energy, Contingency Reserve |
| Description: | The need to efficiently manage different reserve types, inertia, and the largest credible contingency is critical to the continued uptake of variable renewable energy (VRE) and security of a power system. This article presents an optimization formulation for the dispatch of contingency reserves to satisfy frequency limits. Reserve options are divided into two categories: instantaneous reserve (a stepped response with a time delay) and a ramped response with both a time delay and ramp rate. The problem is to optimally select reserve capacity from a set of offers with different response speeds, i.e. different time delays, ramp rates, and prices. The optimal reserve dispatch requires the frequency transient for a contingency to be constrained against frequency limits that occur at specified times after the contingency. The first result of this article is the demonstration of convexity of the feasible solution space; thereby, retaining desirable uniqueness properties of the optimal solution, and polynomial time performance of a solver. The feasible solution space is characterized by piecewise constraints whose components are quadratic. The second result of this article is the development of a solving methodology that utilizes the convex properties of the proposed formulation. |
| Document Type: | Article |
| File Description: | application/pdf |
| ISSN: | 1558-0679 0885-8950 |
| DOI: | 10.1109/tpwrs.2020.2981862 |
| DOI: | 10.1109/tpwrs.2020.2984702 |
| Access URL: | https://ir.canterbury.ac.nz/bitstream/10092/100637/2/FINAL%20VERSION.pdf https://ir.canterbury.ac.nz/bitstream/10092/100638/2/FINAL_VERSION.pdf https://ir.canterbury.ac.nz/handle/10092/100638 https://ieeexplore.ieee.org/document/9056563/ http://ui.adsabs.harvard.edu/abs/2020ITPSy..35.3953S/abstract https://ir.canterbury.ac.nz/bitstream/10092/100638/2/FINAL_VERSION.pdf |
| Rights: | IEEE Copyright |
| Accession Number: | edsair.doi.dedup.....21f6db36de7127ed5f86dc04a20bc4ed |
| Database: | OpenAIRE |
| ISSN: | 15580679 08858950 |
|---|---|
| DOI: | 10.1109/tpwrs.2020.2981862 |