
Hybrid uncertainty‐based offering strategy for virtual power plants
Author(s) -
Alahyari Arman,
Ehsan Mehdi,
Pozo David,
Farrokhifar Meisam
Publication year - 2020
Publication title -
iet renewable power generation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.005
H-Index - 76
eISSN - 1752-1424
pISSN - 1752-1416
DOI - 10.1049/iet-rpg.2020.0249
Subject(s) - mathematical optimization , virtual power plant , computer science , robust optimization , profit (economics) , electricity market , operator (biology) , wind power , demand response , linear programming , renewable energy , electricity , distributed generation , mathematics , economics , engineering , biochemistry , chemistry , electrical engineering , repressor , transcription factor , gene , microeconomics
This study proposes an optimal day‐ahead (DA) electricity market offering model for a virtual power plant (VPP) formed by a mix of renewable distributed energy resources along with energy storage, such as electric vehicles. Two sources of uncertainty are considered, namely, wind power generation, modelled by an uncertainty set, and DA market price, modelled by scenarios. Opposite to classical robust optimisation approaches, the authors model maps minimal (worst‐case) profits to a conservativeness parameter, while the classical robust optimisation maps conservativeness parameter to worst‐case profits. In this regard, by using their optimisation framework, a VPP operator only deals with setting a minimum‐profit constraint, which is more sensible and easy for interpretation, while the required conservativeness is endogenously determined. The proposed mathematical model for constructing the offering curve is a hierarchical four‐level robust optimisation problem. The first level represents the optimal decision on the price–quantity offer bids; the second‐ and third‐level relate to the optimal identification of conservativeness parameter; and the fourth‐level represents the optimal operation of the VPP managed assets. The four‐level model is reformulated as a single‐level mixed‐integer linear programming problem. The proposed approach and its applicability are verified using numerical simulations.