Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Accelerated-Decomposition Approach for Security-Constrained Unit Commitment with Corrective Network Reconfiguration- Part II: Results and Discussion (2007.10142v1)

Published 17 Jul 2020 in math.OC, cs.SY, and eess.SY

Abstract: This paper presents a novel approach to handle the computational complexity in security-constrained unit commitment (SCUC) with corrective network reconfiguration (CNR) to harness the flexibility in transmission networks. This is achieved with consideration of scalability through decomposing the SCUC/SCUC-CNR formulation and then fast screening non-critical sub-problems. This is compared against the extensive formulations of SCUC and SCUC-CNR to show the advantages of the proposed typical-decomposition and accelerated-decomposition approaches to SCUC and SCUC-CNR respectively. Simulation results on the IEEE 24-bus system show that the proposed methods are substantially faster without the loss in solution quality. The proposed accelerated-decomposition approaches can be implemented for large power systems as they have great performance in the scalability tests on the IEEE 73-bus system and the Polish system when compared against the respective extensive formulations and typical-decomposition approaches. Overall, a dynamic post-contingency network can substantially alleviate network congestion and lead to a lower optimal cost.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Arun Venkatesh Ramesh (10 papers)
  2. Xingpeng Li (74 papers)
  3. Kory W. Hedman (9 papers)
Citations (1)

Summary

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