Open AccessA privacy‐preserving approach to day‐ahead TSO‐DSO coordinated stochastic scheduling for energy and reserve
Author(s) -
Habibi Mahdi,
Vahidinasab Vahid,
Sepasian Mohammad Sadegh
Publication year - 2022
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/gtd2.12286
Subject(s) - computer science , scheduling (production processes) , schedule , mathematical optimization , stochastic programming , distributed generation , energy market , distributed computing , renewable energy , engineering , electrical engineering , mathematics , operating system
Proliferation of distributed energy resources (DERs) calls for a coordinated transmission and distribution (T&D) scheduling at the day‐ahead stage. The problem becomes more complicated dealing with the variability of stochastic parameters. Also, privacy and complexity are two barriers to the development of such coordinated platforms. This paper addresses these issues by introducing a hybrid centrally‐supported decentralized stochastic framework for the day‐ahead energy and reserve market with minimum complexity and the need for data‐sharing between system operators. The proposed model is able to calculate the bidirectional power exchange at the T&D interface and the separated costs, dispatches, and reserves of all market participants. The proposed model does not consider any priority for operators and increases the liquidity by facilitating participants’ access to the market platform. Also, the second‐order cone programming (SOCP) formulation is used for calculating the AC power flow of distribution grids, and the model is validated and compared with other implementation strategies. The proposed model is implemented on a modified IEEE 24‐bus test system, and results show that the model can schedule resources for supplying energy and reserves in both transmission and distribution levels in an acceptable computation time.