The Allocation of a Variable Series Reactor Considering AC Constraints and Contingencies

TL;DR

This paper introduces an optimization model for allocating Variable Series Reactors in power networks, considering AC constraints and contingencies, and demonstrates its effectiveness through IEEE 118-bus case studies.

Contribution

It develops a novel Benders decomposition approach to solve a complex non-convex MINLP for VSR allocation considering AC constraints and multiple scenarios.

Findings

Efficient VSR allocation reduces transmission congestion.

The proposed method effectively handles large-scale non-convex problems.

Numerical results show high performance on IEEE 118-bus system.

Abstract

The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. This paper proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.