Plug-n-Play Alternating Projection Algorithm for Large-scale Security Constraint Optimal Power Flow

TL;DR

This paper introduces a distributed alternating projection algorithm for large-scale security-constrained optimal power flow, enabling efficient local optimization and communication among power system buses to improve computational performance.

Contribution

It proposes a novel plug-and-play distributed algorithm for SCOPF that partitions the problem and exchanges local solutions among buses, enhancing scalability and efficiency.

Findings

Competitive CPU computation time compared to commercial tools

Effective partitioning of large-scale SCOPF problems

Distributed optimization improves scalability

Abstract

In this paper, we present an optimization algorithm based on an alternating projection method to solve the large-scale security constraint optimal power flow (SCOPF) problem in power systems. The SCOPF is first partitioned into sub-problems, which share common power components. The proposed algorithm is fundamentally a distributed computing algorithm, which optimizes power flow in each electrical bus. The output of the local optimization problem will be exchanged among neighboring buses for the overall solution for the whole power system. We performed the algorithm against a modified 14-bus power system and demonstrated that the method is competitive with the commercial products regarding the CPU computation time.