OAK

An IGDT-WDRCC based optimal bidding strategy of VPP aggregators in new energy market considering multiple uncertainties

Metadata Downloads
Abstract
This study addresses the volatility and uncertainty challenges in managing renewable energy within electricity markets, particularly focusing on the role of Virtual Power Plant (VPP) aggregators. Recognizing the risks these uncertainties pose to the revenue and stability of power systems, the paper presents a novel information gap decision theory (IGDT)-Wasserstein metric based distributionally robust chance constraint (WDRCC) approach to devise an optimal bidding strategy for VPP operators. It involves a data-driven distributionally robust optimization framework, leveraging the worst-case scenario from the distributed resource uncertainties, guided by an ambiguity set rooted in the Wasserstein metric. Furthermore, the distributionally robust chance constraint modeling is introduced ensuring that uncertainty constraints of distributed resources meet a predefined risk level. Although this method shows promising out-of-sample performance, it relies on forecasted energy prices, a notable limitation given the price volatility and information inadequacy in the newly-opened market. To address this, the risk-averse bidding strategy, grounded in IGDT, is proposed simulataneously to safeguard the operator's expected returns against price uncertainties, implementing an advanced piecewise linear approximation technique, ”nf4l,” for linearizing the bi-linear term from IGDT. The effectiveness of this approach is empirically validated through a comprehensive case study and sensitivity analysis. © 2024
Author(s)
Kim, Jun-HyeokHwang, Jin SolKim, Yun-Su
Issued Date
2024-12
Type
Article
DOI
10.1016/j.energy.2024.133712
URI
https://scholar.gist.ac.kr/handle/local/9189
Publisher
Elsevier Ltd
Citation
Energy, v.313
ISSN
0360-5442
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.