Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

Park, Byungkwon; DeMarco, Christopher L.

doi:10.1109/access.2020.2984521

Cited by 13 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each inequality in (31) can be verified by substituting (30). Interestingly, the set of four linear inequalities in (31) jointly also guarantees the validity of (30) for any binary z j . To demonstrate this, first consider the case of z j = 0.…”

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 89%

“…Otherwise if z j = 1, the other two inequalities (31b) and (31d) would enforce that Y mn = X mn . Hence, for binary z j the set of inequalities in (31) is equivalent to the bilinear relation in (30). Reformulating (30) using the linear inequalities in (31) is known as the Mccormick relaxation technique and has been usually used in power system topology designing problems [30], [31].…”

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 99%

“…Hence, for binary z j the set of inequalities in (31) is equivalent to the bilinear relation in (30). Reformulating (30) using the linear inequalities in (31) is known as the Mccormick relaxation technique and has been usually used in power system topology designing problems [30], [31]. Thus, the original constraint (28b) can be replaced with ( 29) and (31a) -(31d).…”

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 99%

“…Clearly, its optimum solution of X max defines an upper bound for every entry of X. Notice that to solve (36), we need to start with a rough estimate of the upper bound of X mn to tackle the inequality constraints in (31) and (32). This is possible by using a very large value of the upper bound estimate which is refined by (36).…”

Section: A Bounds On Continuous Variables X Mnmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Identification of Bus Split Events Using Synchrophasor Data

Zhou

Zhu

2020

Preprint

View full text Add to dashboard Cite

Accurate grid topology information is of paramount importance for routine power system operations, while the growing availability of synchrophasor data offers the opportunity to identify topology changes in real time. Identification of bus split events, where the substation becomes electrically disconnected, is becoming increasingly important for maintaining the security of power systems. This paper aims to provide an efficient modeling and monitoring framework for bus split events. The linear sensitivity analysis is first performed to quickly evaluate the grid-wide impact of such events. Furthermore, the synchrophasor data enabled identification problem is formulated by matching the changes in bus phase angles (and possibly line flows). To address the resultant bilinear multiplication involving the binary connectivity variables, the McCormick relaxation technique is leveraged to attain an equivalent mixed-integer linear program reformulation that is efficiently solvable. Numerical studies on the IEEE 14-bus and 300-bus systems demonstrate the validity and efficiency of the proposed identification algorithm towards real-time implementation.

show abstract

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 89%

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 99%

Section: Tractable Identification Via Mccormick Relaxationmentioning

confidence: 99%

Section: A Bounds On Continuous Variables X Mnmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Identification of Bus Split Events Using Synchrophasor Data

Zhou

Zhu

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Due to the binary vector w ,i , the set of inequalities in (11) is equivalent to the bi-linear relation in (10). Reformulating (10) with the linear inequalities in (11) is known as the McCormick relaxation technique, which has been popularly used in other problems of designing grid topology [20], [21]. Hence, the bi-linear product as given in ( 9) can be equivalently replaced with…”

Section: B Topology Optimization With Bus Splittingmentioning

confidence: 99%

Substation-Level Grid Topology Optimization Using Bus Splitting

Zhou¹,

Zamzam²,

Bernstein³

et al. 2020

Preprint

View full text Add to dashboard Cite

Operations of substation circuit breakers are of high significance for performing system maintenance and topology optimization. Bus splitting is one type of topology changes where the two bus-bars at a substation become electrically disconnected after certain actions of circuit breakers. As these events involve detailed substation modeling, they are not typically considered in power system routine operation and control. In this paper, an improved substation-level topology optimization is developed by expanding traditional line switching with breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bi-linear terms in the resultant topology optimization model. Thus, a tractable mixedinteger linear program formulation is presented which can be efficiently solved for real-time control. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the performance and economic benefits of the proposed topology optimization approach.

show abstract