TY - JOUR
T1 - Ensuring network connectedness in optimal transmission switching problems
AU - Han, Tong
AU - Song, Yue
AU - Hill, David J.
N1 - Funding Information:
Manuscript received January 15, 2021; accepted February 8, 2021. Date of publication February 12, 2021; date of current version June 29, 2021. This work was supported by the Research Grants Council of the Hong Kong Special Administrative Region through the General Research Fund under Project 17209419. This brief was recommended by Associate Editor S. C. Wong. (Corresponding author: Tong Han.) The authors are with the Department of Electrical and Electronic Engineering, University of Hong Kong, Hong Kong (e-mail: [email protected]; [email protected]; [email protected]).
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2021/7
Y1 - 2021/7
N2 - Network connectedness is indispensable for the normal operation of transmission networks. However, there still remains a lack of efficient constraints that can be directly added to the problem formulation of optimal transmission switching (OTS) to ensure network connectedness strictly. To fill this gap, this brief proposes a set of linear connectedness constraints by leveraging the equivalence between network connectedness and feasibility of the vertex potential equation of an electrical flow network. The proposed constraints are compatible with any existing OTS models to ensure topology connectedness. Furthermore, we develop a reduction version for the proposed connectedness constraints, seeking for improvement of computational efficiency. Finally, numerical studies with a DC OTS model show the deficiency of OTS formulations without full consideration of network connectedness and demonstrate the effectiveness of the proposed constraints. The computational burden caused by the connectedness constraints is moderate and can be remarkably relieved by using the reduced version.
AB - Network connectedness is indispensable for the normal operation of transmission networks. However, there still remains a lack of efficient constraints that can be directly added to the problem formulation of optimal transmission switching (OTS) to ensure network connectedness strictly. To fill this gap, this brief proposes a set of linear connectedness constraints by leveraging the equivalence between network connectedness and feasibility of the vertex potential equation of an electrical flow network. The proposed constraints are compatible with any existing OTS models to ensure topology connectedness. Furthermore, we develop a reduction version for the proposed connectedness constraints, seeking for improvement of computational efficiency. Finally, numerical studies with a DC OTS model show the deficiency of OTS formulations without full consideration of network connectedness and demonstrate the effectiveness of the proposed constraints. The computational burden caused by the connectedness constraints is moderate and can be remarkably relieved by using the reduced version.
KW - network connectedness
KW - network connectivity
KW - optimal transmission switching
KW - Power networks
UR - http://www.scopus.com/inward/record.url?scp=85101453529&partnerID=8YFLogxK
U2 - 10.1109/TCSII.2021.3059070
DO - 10.1109/TCSII.2021.3059070
M3 - Article
AN - SCOPUS:85101453529
SN - 1549-7747
VL - 68
SP - 2603
EP - 2607
JO - IEEE Transactions on Circuits and Systems II: Express Briefs
JF - IEEE Transactions on Circuits and Systems II: Express Briefs
IS - 7
ER -