Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/3651Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Prabhakar, P.S.V. | - |
| dc.contributor.author | Krishan, Ram | - |
| dc.contributor.author | Pullaguram, Deepak Reddy | - |
| dc.date.accessioned | 2025-12-17T11:27:30Z | - |
| dc.date.available | 2025-12-17T11:27:30Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.citation | 10.1109/NPSC57038.2022.10069705 | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/3651 | - |
| dc.description | NITW | en_US |
| dc.description.abstract | —Contingency analysis (CA) is one of the critical tools of a static security assessment (SSA). It is used to forecast the operating states of a power system under one or more outages of generators, transmission lines, transformers, etc. To perform SSA, repetitive load flow analyses are required for obtaining the bus voltages, bus injections, and line flows considering each possible outage. A repetitive load flow analysis demands huge computational efforts like efficient system modelling for faster load flow solutions, parallel programming and High performance computing (HPC). In this paper, an N-1-1 CA has been anal ysed using fast decoupled load flow (FDLF) with a strategy of screening and ranking the catastrophic contingencies. This paper explores a computationally efficient method to analyze the severity and the ranking of N-1-1 contingencies for large power system SSA. The performance of the FDLF based SSA method is demonstrated on two standard IEEE 14 and 118 bus systems. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | 2022 22nd National Power Systems Conference, NPSC 2022 | en_US |
| dc.subject | Contingency Ranking | en_US |
| dc.subject | Contingency Screening | en_US |
| dc.title | Static Security Assessment of Large Power Systems under N-1-1 Contingency | en_US |
| dc.type | Other | en_US |
| Appears in Collections: | Electrical Engineering | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.