A Fast Decomposition Method to Solve SCOPF Empowered by Parallel Computing

This paper shows a heterogeneous and parallel computing (PHC) methodology applied to the Security Constraint Optimal Power Flow problem (SCOPF). The methodology used an original decomposition of base and contingency cases for the SCOPF and solved the problem through constraint handling, droop contro...

Full description

Saved in:
Bibliographic Details
Main Authors: Rodriguez, Diego, Gers, Juan M, Gomez, Diego, Garzon, Wilmer, Alvarez, David, Rivera, Sergio
Format: Conference Proceeding
Language:English
Subjects:
Central Processing Unit
Computer architecture
Contingency management
Graphics Processing Unit (GPU)
Graphics processing units
Parallel and Heterogeneous Computing (PHC)
Parallel processing
Proposals
Security Constraint Optimal Power Flow (SCOPF)
Switches
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper shows a heterogeneous and parallel computing (PHC) methodology applied to the Security Constraint Optimal Power Flow problem (SCOPF). The methodology used an original decomposition of base and contingency cases for the SCOPF and solved the problem through constraint handling, droop control and PV/PQ switching. PHC architecture was based on GPU and CPU to accelerate power flow calculations and parallelize contingency evaluations. The methodology was tested on power grids with sizes from 500 to 20,000 buses with promising results. The methodology allows power system optimization while guaranteeing power system security in N-1 scenarios in time frames appropriate for power system operation.
ISSN:1944-9933
DOI:10.1109/PESGM48719.2022.9916694