Power grid decomposition based on vertex cut sets and its applications to topology control and power trading
Publisher VersionDOI: 10.1109/CDC.2018.8619241
MetadataShow full item record
First author draftAccepted manuscript
Citation (published version)Shuai Wang, John Baillieul. 2018. "Power Grid Decomposition Based on Vertex Cut Sets and Its Applications to Topology Control and Power Trading." 2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC). 57th IEEE Conference on Decision and Control (CDC). Miami Beach, FL, 2018-12-17 - 2018-12-19. DOI: 10.1109/CDC.2018.8619241
It is well known that the reserves/redundancies built into the transmission grid in order to address a variety of contingencies over a long planning horizon may, in the short run, cause economic dispatch inefficiency. Accordingly, power grid optimization by means of short term line switching has been proposed and is typically formulated as a mixed integer programming problem by treating the state of the transmission lines as a binary decision variable, i.e. in-service or out-of service, in the optimal power flow problem. To handle the combinatorial explosion, a number of heuristic approaches to grid topology reconfiguration have been proposed in the literature. This paper extends our recent results on the iterative heuristics and proposes a fast grid decomposition algorithm based on vertex cut sets with the purpose of further reducing the computational cost. The paper concludes with a discussion of the possible relationship between vertex cut sets in transmission networks and power trading.
Rights© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.