Abstract

This paper addresses a two-stage stochastic-robust model for the day-ahead self-scheduling problem of an aggregator considering uncertainties. The aggregator, which integrates power and capacity of small-scale prosumers and flexible community-owned devices, trades electric energy in the day-ahead (DAM) and real-time energy markets (RTM), and trades reserve capacity and deployment in the reserve capacity (RCM) and reserve deployment markets (RDM). The ability of the aggregator providing reserve service is constrained by the regulations of reserve market rules, including minimum offer/bid size and minimum delivery duration. A combination approach of stochastic programming (SP) and robust optimization (RO) is used to model different kinds of uncertainties, including those of market price, power/demand and reserve deployment. The risk management of the aggregator is considered through conditional value at risk (CVaR) and fluctuation intervals of the uncertain parameters. Case studies numerically show the economic revenue and the energy-reserve schedule of the aggregator with participation in different markets, reserve regulations, and risk preferences.

Details

Title
Two-stage stochastic-robust model for the self-scheduling problem of an aggregator participating in energy and reserve markets
Author
Wang, Jian 1   VIAFID ORCID Logo  ; Xie, Ning 2 ; Huang, Chunyi 2 ; Wang, Yong 2 

 Shanghai Jiao Tong University, Department of Electrical Engineering, Shanghai, China (GRID:grid.16821.3c) (ISNI:0000 0004 0368 8293); Politecnico Di Milano, Department of Energy, Milan, Italy (GRID:grid.4643.5) (ISNI:0000 0004 1937 0327) 
 Shanghai Jiao Tong University, Department of Electrical Engineering, Shanghai, China (GRID:grid.16821.3c) (ISNI:0000 0004 0368 8293) 
Pages
45
Publication year
2023
Publication date
Dec 2023
Publisher
Power System Protection and Control Press
ISSN
23672617
e-ISSN
23670983
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2890357686
Copyright
© The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.