Hyppää sisältöön
    • Suomeksi
    • In English
  • Suomeksi
  • In English
  • Kirjaudu
Näytä aineisto 
  •   Etusivu
  • OSUVA
  • Artikkelit
  • Näytä aineisto
  •   Etusivu
  • OSUVA
  • Artikkelit
  • Näytä aineisto
JavaScript is disabled for your browser. Some features of this site may not work without it.

Stochastic Security Constrained Unit Commitment with High Penetration of Wind Farms

Kia, Mohsen; Hosseini, Seyed Hamid; Heidari, Alireza; Lotfi, Mohamed; Catalão, João P. S.; Shafie-khah, Miadreza; Osório, Gerardo; Santos, Sérgio F. (2019-08-01)

 
Katso/Avaa
Artikkeli (506.7Kb)
Lataukset: 

URI
https://doi.org/10.1109/EEEIC.2019.8783812

Kia, Mohsen
Hosseini, Seyed Hamid
Heidari, Alireza
Lotfi, Mohamed
Catalão, João P. S.
Shafie-khah, Miadreza
Osório, Gerardo
Santos, Sérgio F.
IEEE
01.08.2019
doi:10.1109/EEEIC.2019.8783812
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe202102235717

Kuvaus

vertaisarvioitu
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Tiivistelmä
Secure and reliable operation is one of the main challenges in restructured power systems. Wind energy has been gaining increasing global attention as a clean and economic energy source, despite the operational challenges its intermittency brings. In this study, we present a formulation for electricity and reserve market clearance in the presence of wind farms. Uncertainties associated with generation and line outages are modeled as different system scenarios. The formulation incorporates the cost of different scenarios in a two-stage short-term (24-hours) clearing process, also considering different types of reserve. The model is then linearized in order to be compatible with standard mixed-integer linear programming solvers, aiming at solving the security constrained unit-commitment problem using as few variables and optimization constraints as possible. As shown, this will expedite the solution of the optimization problem. The model is validated by testing it on a case study based on the IEEE RTS1, for which results are presented and discussed.
Kokoelmat
  • Artikkelit [1922]
https://osuva.uwasa.fi
Ota yhteyttä | Tietosuoja | Saavutettavuusseloste
 

 

Tämä kokoelma

TekijäNimekeAsiasanaYksikkö / TiedekuntaOppiaineJulkaisuaikaKokoelmat

Omat tiedot

Kirjaudu sisäänRekisteröidy
https://osuva.uwasa.fi
Ota yhteyttä | Tietosuoja | Saavutettavuusseloste