Efficient period elimination Benders decomposition for network-constrained AC unit commitment

Recent complexities in interconnected power system operation call for more efficient and fast approaches for operational problems including network-constrained unit commitment (NCUC). In this study, an algorithm called period-elimination Benders decomposition (PEBD) is proposed to enhance the comput...

Full description

Saved in:
Bibliographic Details
Published in:IET generation, transmission & distribution transmission & distribution, 2019-05, Vol.13 (10), p.1802-1810
Main Authors: Ghanbari-Firouzabadi, Ali, Pirayesh, Abolfazl, Esmaili, Masoud
Format: Article
Language:English
Subjects:
AC NCUC problems
classical BD
computational efficiency
efficient approaches
efficient period elimination BD
fast approaches
integer programming
interconnected power system operation call
inter‐regional transactions
iteration
larger power systems
network‐constrained AC unit commitment
operational problems including network‐constrained unit commitment
optimisation
PEBD method
period‐elimination Benders decomposition
power balance
power generation dispatch
power generation economics
power generation scheduling
power markets
power system interconnection
power system security
recent complexities
Research Article
satisfied time periods
solution procedure
SPs
time period
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recent complexities in interconnected power system operation call for more efficient and fast approaches for operational problems including network-constrained unit commitment (NCUC). In this study, an algorithm called period-elimination Benders decomposition (PEBD) is proposed to enhance the computational efficiency of AC NCUC problems. After linearising the AC NCUC, two subproblems (SPs) are defined to ensure power balance at buses as well as constraints of branches and inter-regional transactions. In the classical Benders decomposition (BD), all time periods are solved at all iterations up to convergence. However, in the proposed PEBD, a time period that satisfies a SP in an iteration is eliminated from the solution procedure of that SP at next iterations. After both SPs are satisfied for all time periods, the solution is checked for interrelation constraints and a few more iterations may be needed to finalise the solution. The efficiency and accuracy of the proposed PEBD method are verified by examining it on two test systems. It is found that the PEBD greatly enhances the speed of NCUC, especially in larger power systems due to eliminating unnecessary calculations for satisfied time periods.
ISSN:1751-8687
1751-8695
DOI:10.1049/iet-gtd.2018.5409