Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment
Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines, in practice only a limited number of contingencies could be evaluated. This paper proposes a graph theory based <tex>$...
Guardado en:
Autores principales: | , , , , |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
IEEE
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/60a9d8f5b60b4067b291a98e3af0a11a |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
id |
oai:doaj.org-article:60a9d8f5b60b4067b291a98e3af0a11a |
---|---|
record_format |
dspace |
spelling |
oai:doaj.org-article:60a9d8f5b60b4067b291a98e3af0a11a2021-12-01T00:01:46ZGraph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment2196-542010.35833/MPCE.2019.000602https://doaj.org/article/60a9d8f5b60b4067b291a98e3af0a11a2021-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9163311/https://doaj.org/toc/2196-5420Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines, in practice only a limited number of contingencies could be evaluated. This paper proposes a graph theory based <tex>$N$</tex>-1 contingency selection method to effectively identify the most critical contingencies, which can be used in security-constrained unit commitment (SCUC) problems to derive secure and economic operation decisions of the power grid. Specifically, the power flow transferring path identification algorithm and the vulnerability index are put forward to rank individual contingencies according to potential transmission line overloads. Effectiveness of the proposed <tex>$N$</tex>-1 contingency selection method is quantified by applying the corresponding SCUC solution to the full <tex>$N$</tex> - 1 security evaluation, i.e., quantifying total post-contin-gency generation-load imbalance in all <tex>$N$</tex> -1 contingencies. Numerical results on several benchmark IEEE systems, including 5-bus, 24-bus, and 118-bus systems, show effectiveness of the proposed method. Compared with existing contingency selection methods which usually resort to full power flow calculations, the proposed method relies on power gird topology to effectively identify critical contingencies for facilitating the optimal scheduling of SCUC problems.Lu NanYikui LiuLei WuTianqi LiuChuan HeIEEEarticleConcentric relaxationcontingency analysisgraph theorysecurity-constrained unit commitment (SCUC)shortest pathvulnerability indexProduction of electric energy or power. Powerplants. Central stationsTK1001-1841Renewable energy sourcesTJ807-830ENJournal of Modern Power Systems and Clean Energy, Vol 9, Iss 6, Pp 1458-1467 (2021) |
institution |
DOAJ |
collection |
DOAJ |
language |
EN |
topic |
Concentric relaxation contingency analysis graph theory security-constrained unit commitment (SCUC) shortest path vulnerability index Production of electric energy or power. Powerplants. Central stations TK1001-1841 Renewable energy sources TJ807-830 |
spellingShingle |
Concentric relaxation contingency analysis graph theory security-constrained unit commitment (SCUC) shortest path vulnerability index Production of electric energy or power. Powerplants. Central stations TK1001-1841 Renewable energy sources TJ807-830 Lu Nan Yikui Liu Lei Wu Tianqi Liu Chuan He Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
description |
Contingency analysis is an important building block in the stability and reliability analysis of power grid operations. However, due to the large number of transmission lines, in practice only a limited number of contingencies could be evaluated. This paper proposes a graph theory based <tex>$N$</tex>-1 contingency selection method to effectively identify the most critical contingencies, which can be used in security-constrained unit commitment (SCUC) problems to derive secure and economic operation decisions of the power grid. Specifically, the power flow transferring path identification algorithm and the vulnerability index are put forward to rank individual contingencies according to potential transmission line overloads. Effectiveness of the proposed <tex>$N$</tex>-1 contingency selection method is quantified by applying the corresponding SCUC solution to the full <tex>$N$</tex> - 1 security evaluation, i.e., quantifying total post-contin-gency generation-load imbalance in all <tex>$N$</tex> -1 contingencies. Numerical results on several benchmark IEEE systems, including 5-bus, 24-bus, and 118-bus systems, show effectiveness of the proposed method. Compared with existing contingency selection methods which usually resort to full power flow calculations, the proposed method relies on power gird topology to effectively identify critical contingencies for facilitating the optimal scheduling of SCUC problems. |
format |
article |
author |
Lu Nan Yikui Liu Lei Wu Tianqi Liu Chuan He |
author_facet |
Lu Nan Yikui Liu Lei Wu Tianqi Liu Chuan He |
author_sort |
Lu Nan |
title |
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
title_short |
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
title_full |
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
title_fullStr |
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
title_full_unstemmed |
Graph Theory Based N-1 Transmission Contingency Selection and Its Application in Security-constrained Unit Commitment |
title_sort |
graph theory based n-1 transmission contingency selection and its application in security-constrained unit commitment |
publisher |
IEEE |
publishDate |
2021 |
url |
https://doaj.org/article/60a9d8f5b60b4067b291a98e3af0a11a |
work_keys_str_mv |
AT lunan graphtheorybasedn1transmissioncontingencyselectionanditsapplicationinsecurityconstrainedunitcommitment AT yikuiliu graphtheorybasedn1transmissioncontingencyselectionanditsapplicationinsecurityconstrainedunitcommitment AT leiwu graphtheorybasedn1transmissioncontingencyselectionanditsapplicationinsecurityconstrainedunitcommitment AT tianqiliu graphtheorybasedn1transmissioncontingencyselectionanditsapplicationinsecurityconstrainedunitcommitment AT chuanhe graphtheorybasedn1transmissioncontingencyselectionanditsapplicationinsecurityconstrainedunitcommitment |
_version_ |
1718406142929928192 |