TY - JOUR
T1 - Efficient algorithm for locating and sizing series compensation devices in large power transmission grids
T2 - II. Solutions and applications
AU - Frolov, Vladimir
AU - Backhaus, Scott
AU - Chertkov, Misha
N1 - Publisher Copyright:
© 2014 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.
PY - 2014/10/24
Y1 - 2014/10/24
N2 - In a companion manuscript (Frolov et al 2014 New J. Phys. 16 art. no.) , we developed a novel optimization method for the placement, sizing, and operation of flexible alternating current transmission system (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide series compensation (SC) via modification of line inductance. In this sequel manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (∼2700 nodes and ∼3300 lines). The results from the 30-bus network are used to study the general properties of the solutions, including nonlocality and sparsity. The Polish grid is used to demonstrate the computational efficiency of the heuristics that leverage sequential linearization of power flow constraints, and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, we can use the algorithm to solve a Polish transmission grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (i) uniform load growth, (ii) multiple overloaded configurations, and (iii) sequential generator retirements.
AB - In a companion manuscript (Frolov et al 2014 New J. Phys. 16 art. no.) , we developed a novel optimization method for the placement, sizing, and operation of flexible alternating current transmission system (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide series compensation (SC) via modification of line inductance. In this sequel manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (∼2700 nodes and ∼3300 lines). The results from the 30-bus network are used to study the general properties of the solutions, including nonlocality and sparsity. The Polish grid is used to demonstrate the computational efficiency of the heuristics that leverage sequential linearization of power flow constraints, and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, we can use the algorithm to solve a Polish transmission grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (i) uniform load growth, (ii) multiple overloaded configurations, and (iii) sequential generator retirements.
KW - Nonconvex optimization
KW - Power compensation devices
KW - Power system transmission
UR - http://www.scopus.com/inward/record.url?scp=84910152193&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910152193&partnerID=8YFLogxK
U2 - 10.1088/1367-2630/16/10/105016
DO - 10.1088/1367-2630/16/10/105016
M3 - Article
AN - SCOPUS:84910152193
VL - 16
JO - New Journal of Physics
JF - New Journal of Physics
SN - 1367-2630
M1 - 105016
ER -