Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching

• DOI: 10.1287/ijoc.2017.0751
• Publication Date: 2017-08-09T07:00:41Z
• Authors: Kathryn M. Schuma...; Amy E. M. Cohn; Richard Li-Yang Chen
• Keywords: Contingency; Power system simulation; Component (thermodynamics); Power transmission

Most power grid systems are operated to be N-1 secure, meaning that the system can withstand failure of any one component. There is increasing interest in more stringent security standards, where must able survive (nearly) simultaneous k components (i.e., N-k). However, this improved reliability criterion significantly increases number contingency scenarios considered when solving unit commitment problem. Additional computational complexity introduced taking into account transmission switching. This relatively inexpensive method redirecting flows has been proposed as a way introducing flexibility better events. We present an algorithm for problem simultaneously addresses both challenges N-k requirement and use switching during operation. analyze algorithmic performance results IEEE24 RTS-96 test = 1 2. also include discussion how approach might extended solve problems with ≥ 3. The online supplement, data, available at https://doi.org/10.1287/ijoc.2017.0751 .