English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper deals with optimal transmission switching (OTS) problems involvingdiscrete binary decisions about network topology and non-convex power flowconstraints. We adopt a semidefinite programming formulation for the OPFproblem which, however, remains nonconvex due to the presence of discretevariables and bilinear products between the decision variables. To tackle thelatter, we introduce a novel physically-inspired, virtual-voltage approximationthat leads to provable lower and upper bounds on the solution of the originalproblem. To deal with the exponential complexity caused by the discretevariables, we introduce a graph partition-based algorithm which breaks theproblem into several parallel mixed-integer subproblems of smaller size.Simulations demonstrate the high degree of accuracy and affordablecomputational requirements of our approach.

Virtual-Voltage Partition-Based Approach to Optimal Transmission Switching