Primal and dual bounds for Optimal Transmission Switching

Coffrin, Carleton; Hijazi, Hassan; Lehmann, Karsten; Hentenryck, Pascal Van

doi:10.1109/pscc.2014.7038446

Cited by 28 publications

(23 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of iterations of the cutting-plane algorithm on F soc and F dc is also consistent with this hypothesis. This type of behavior was also observed in the literature on similar problems such as Optimal Transmission Switching [23,13]. However, it is uncommon.…”

Section: Performance Of the Cutting-plane Algorithm On Categories (C2supporting

confidence: 74%

“…There are outliers to the fact that the cutting‐plane algorithm on

{scriptF}_{dc}

and

{scriptF}_{soc}

results in the same choice of interdiction plans; for instance consider the instance IEEE three‐area RTS96 with 73 buses: when

k = 3

, the Hamming distance between the interdiction plans obtained from the two formulations is 2 and the difference between the objective values obtained using the primal recovery procedure is 15%. In fact, there are many other problems in power systems where the SOC relaxation and the DC approximation of the power flow constraints produce contrasting results. We delegate to future work the need for further study to determine if the sameness of the solutions between the two formulations holds more generally for the PNK.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic N‐k failure‐identification for power systems

et al. 2018

Self Cite

View full text Add to dashboard Cite

This article considers a probabilistic generalization of the N‐k failure‐identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed‐integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting‐plane algorithm is proposed to solve the convex relaxation and linear approximations of the N‐k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small‐, medium‐, and large‐scale test instances; the test instances include the IEEE 14‐bus system, the IEEE single‐area and three‐area RTS96 systems, the IEEE 118‐bus system, the WECC 240‐bus test system, the 1354‐bus PEGASE system, and the 2383‐bus Polish winter‐peak test system.

show abstract

Section: Performance Of the Cutting-plane Algorithm On Categories (C2supporting

confidence: 74%

“…There are outliers to the fact that the cutting‐plane algorithm on

{scriptF}_{dc}

and

{scriptF}_{soc}

results in the same choice of interdiction plans; for instance consider the instance IEEE three‐area RTS96 with 73 buses: when

k = 3

Section: Computational Resultsmentioning

confidence: 99%

Probabilistic N‐k failure‐identification for power systems

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…Heuristic algorithms are also used in solving the ACOTS problems [19,20]. In [19], the accuracies of ACOTS and DC optimal TS (DCOTS) are compared using heuristic algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…The results show that DCOTS model may be inaccurate and performs poorly in several cases. In [20], the DCOTS approximation model, the SDP and SOCP relaxation methods, and the original AC model solved by heuristic algorithms are compared. The results demonstrate that the DC power flow model is not reliable for obtaining optimal line switching results, while the heuristic algorithms can be valuable for finding AC feasible solutions, and the relaxation method is instrumental in guaranteeing the optimization objective.…”

Section: Introductionmentioning

confidence: 99%

Optimal transmission switching to eliminate voltage violations during light-load periods using decomposition approach

Zhao

Zhou

et al. 2018

J. Mod. Power Syst. Clean Energy

View full text Add to dashboard Cite

With the rapid load increase in some countries such as China, power grids are becoming more strongly interconnected, and the differences between peak and valley loads are also increasing. As a result, some bulk power systems are facing high voltage limit violations during light-load periods. This paper proposes to utilize transmission switching (TS) to eliminate voltage violations. The TS problem is formed as a mixed-integer nonlinear program (MINLP) with AC power flow constraints and binary variables. The proposed MINLP problem is non-deterministic polynomial hard. To efficiently solve the problem, a decomposition approach is developed. This approach decomposes the original problem into a mixedinteger linear programming master problem and an AC optimal power flow slave problem that is used to check the AC feasibility. Prevention of islanding is also taken into consideration to ensure the feasibility of the TS results. The modified IEEE 39-bus and IEEE 57-bus test systems are used to demonstrate the applicability and effectiveness of the proposed method.

show abstract

“…However, the accuracy of the DC power flow is a topic of much discussion: Some papers take an favorable outlook, (e.g., [2,7]), while others (e.g., [8][9][10][11]) are more cautious. The accuracy of the DC power flow is particularly important in power restoration as a feasible AC base-point solution is often not available and it is preferable to operate the network near its design limits.…”

Section: Introductionmentioning

confidence: 99%