Abstract

Contingency analysis (CA) is one of the essential tools for the optimal design and security assessment of a reliable power system. However, its computational requirements rise with the growth of distributed generations in the interconnected power system. As CA is a complex and computationally intensive problem, it requires a fast and accurate calculation to ensure the secure operation. Therefore, efficient mathematical modelling and parallel programming are key to efficient static security analysis. This paper proposes a parallel algorithm for static CA that uses both central processing units (CPUs) and graphical processing units (GPUs). To enhance the accuracy, AC load flow is used, and parallel computation of load flow is done simultaneously, with efficient screening and ranking of the critical contingencies. We perform extensive experiments to evaluate the efficacy of the proposed algorithm. As a result, we establish that the proposed parallel algorithm with high-performance computing (HPC) computing is much faster than the traditional algorithms. Furthermore, the HPC experiments were conducted using the national supercomputing facility, which demonstrates the proposed algorithm in the context of N−1 and N−2 static CA with immense power systems, such as the Indian northern regional power grid (NRPG) 246-bus and the polish 2383-bus networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.