Distributed Security-Constrained Unit Commitment for Large-Scale Power Systems

Independent system operators (ISOs) of electricity markets solve the security-constrained unit commitment (SCUC) problem to plan a secure and economic generation schedule. However, as the size of power systems increases, the current centralized SCUC algorithm could face critical challenges ranging f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on power systems Ročník 30; číslo 4; s. 1925 - 1936
Hlavní autoři: Kargarian, Amin, Fu, Yong, Li, Zuyi
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.07.2015
Témata:
Distributed solution algorithm
electricity market
Indexes
Joining processes
Linear programming
Optimization
Power systems
Scheduling
security-constrained unit commitment
Vectors
ISSN:0885-8950, 1558-0679
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Independent system operators (ISOs) of electricity markets solve the security-constrained unit commitment (SCUC) problem to plan a secure and economic generation schedule. However, as the size of power systems increases, the current centralized SCUC algorithm could face critical challenges ranging from modeling accuracy to calculation complexity. This paper presents a distributed SCUC (D-SCUC) algorithm to accelerate the generation scheduling of large-scale power systems. In this algorithm, a power system is decomposed into several scalable zones which are interconnected through tie lines. Each zone solves its own SCUC problem and a parallel calculation method is proposed to coordinate individual D-SCUC problems. Several power systems are studied to show the effectiveness of the proposed algorithm.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2014.2360063