TY - JOUR
T1 - Efficient algorithm for locating and sizing series compensation devices in large power transmission grids
T2 - I. Model implementation
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 - We explore optimization methods for planning the placement, sizing and operations of flexible alternating current transmission system (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to series compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of linear programs (LP) that are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop - a speed that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically sized networks that suffer congestion from a range of causes, including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically sized network.
AB - We explore optimization methods for planning the placement, sizing and operations of flexible alternating current transmission system (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to series compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of linear programs (LP) that are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop - a speed that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically sized networks that suffer congestion from a range of causes, including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically sized network.
KW - nonconvex optimization
KW - power compensation devices
KW - power system transmission
UR - http://www.scopus.com/inward/record.url?scp=84910110754&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910110754&partnerID=8YFLogxK
U2 - 10.1088/1367-2630/16/10/105015
DO - 10.1088/1367-2630/16/10/105015
M3 - Article
AN - SCOPUS:84910110754
SN - 1367-2630
VL - 16
JO - New Journal of Physics
JF - New Journal of Physics
M1 - 105015
ER -