A privacy‐preserving approach to day‐ahead TSO‐DSO coordinated stochastic scheduling for energy and reserve
Abstract 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 t...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Wiley
2022
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/bed5db210df940178a5f021646dea065 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract 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. |
|---|