Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ensuring Network Connectedness in Optimal Transmission Switching Problems (2006.12752v2)

Published 23 Jun 2020 in eess.SY and cs.SY

Abstract: 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 paper 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.

Summary

We haven't generated a summary for this paper yet.