Virtual-Voltage Partition-Based Approach to Optimal Transmission Switching release_646kp77n45c67lylnoqinbvupe

by Chin-Yao Chang and Sonia Martinez and Jorge Cortes

Released as a article .

2017  

Abstract

This paper deals with optimal transmission switching (OTS) problems involving discrete binary decisions about network topology and non-convex power flow constraints. We adopt a semidefinite programming formulation for the OPF problem which, however, remains nonconvex due to the presence of discrete variables and bilinear products between the decision variables. To tackle the latter, we introduce a novel physically-inspired, virtual-voltage approximation that leads to provable lower and upper bounds on the solution of the original problem. To deal with the exponential complexity caused by the discrete variables, we introduce a graph partition-based algorithm which breaks the problem into several parallel mixed-integer subproblems of smaller size. Simulations demonstrate the high degree of accuracy and affordable computational requirements of our approach.
In text/plain format

Archived Files and Locations

application/pdf  392.1 kB
file_kw33bjk34nbwzmn2aea4k3nmly
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-12-23
Version   v2
Language   en ?
arXiv  1710.02970v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0aa6220a-8a20-4d05-becd-15c786041efe
API URL: JSON