Hyppää sisältöön
    • Suomeksi
    • In English
Trepo
  • Suomeksi
  • In English
  • Kirjaudu
Näytä viite 
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

An optimal bidding and scheduling method for load service entities considering demand response uncertainty

Han, Rushuai; Hu, Qinran; Cui, Hantao; Chen, Tao; Quan, Xiangjun; Wu, Zaijun (2022-12-15)

 
Avaa tiedosto
An_optimal_bidding_and_scheduling_method.pdf (3.790Mt)
Lataukset: 



Han, Rushuai
Hu, Qinran
Cui, Hantao
Chen, Tao
Quan, Xiangjun
Wu, Zaijun
15.12.2022

Applied Energy
120167
doi:10.1016/j.apenergy.2022.120167
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202211248604

Kuvaus

Peer reviewed
Tiivistelmä
With the rapid development of demand-side management technologies, load serving entities (LSEs) may offer demand response (DR) programs to improve the flexibility of power system operation. Reliable load aggregation is critical for LSEs to improve profits in electricity markets. Due to the uncertainty, the actual aggregated response of loads obtained by conventional aggregation methods can experience significant deviations from the bidding value, making it difficult for LSEs to develop an optimal bidding and scheduling strategy. In this paper, a bi-level scheduling model is proposed to maximize the net revenue of the LSE from optimal DR bidding and energy storage systems ESS scheduling by considering the impacts of the uncertainty of demand response. An online learning method is adopted to improve aggregation reliability. Additionally, the net profit for LSEs can be raised by strategically switching ESS between two modes, namely, energy arbitrage and deviation mitigation. With Karush–Kuhn–Tucker (KKT) optimality condition-based decoupling and piecewise linearization applied, this bi-level optimization model can be reformulated and converted into a mixed-integer linear programming (MILP) problem. The effectiveness and advantages of the proposed method are verified in a modified IEEE RTS-24 bus system.
Kokoelmat
  • TUNICRIS-julkaisut [24199]
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste
 

 

Selaa kokoelmaa

TekijätNimekkeetTiedekunta (2019 -)Tiedekunta (- 2018)Tutkinto-ohjelmat ja opintosuunnatAvainsanatJulkaisuajatKokoelmat

Omat tiedot

Kirjaudu sisäänRekisteröidy
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste