2248. A Comprehensive Approach to Solving Large-Scale Security-Constrained Optimal Transmission Switching Problems
Invited abstract in session WE-2: Decomposition Methods & Robust Optimization, stream Discrete and Combinatorial Optimization.
Wednesday, 16:30-18:00Room: H4
Authors (first author is the speaker)
| 1. | Tim Donkiewicz
|
| Chair of Operations Research, RWTH Aachen University | |
| 2. | Oliver Gaul
|
| Chair of Operations Research, RWTH Aachen University |
Abstract
The Security-Constrained Optimal Transmission Switching problem consists of finding a cost-efficient generator and topology configuration for a power network. Considering the size of the considered networks as well as the large number of scenarios (contingencies) and different topologies, we show how to employ Benders decomposition to solve the problem. We describe acceleration techniques such as partial subproblem solving, cut selection and primal heuristics. Additionally, we present a nested Benders decomposition approach for the problem. Preliminary computational results indicate major performance improvements with the proposed enhancements.
Keywords
- Decomposition Methods
- Robust Optimization
- Energy Policy and Planning
Status: accepted
Back to the list of papers