2234. Efficiently Solving Benders Subproblems for the Security-Constrained Optimal Transmission Switching Problem with Substation Reconfiguration
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. | Oliver Gaul
|
| Chair of Operations Research, RWTH Aachen University | |
| 2. | Tim Donkiewicz
|
| Chair of Operations Research, RWTH Aachen University |
Abstract
The Security-Constrained Optimal Transmission Switching Problem with Substation Reconfiguration deals with the configuration of the topology and generation of a power network in order to reduce overall costs. Security constraints require the individual evaluation of this configuration for a large set of scenarios. Substation reconfiguration allows for a wide variety of possible topologies, but also introduces a significant number of additional edges and nodes. We demonstrate how to tackle the large problem size via a Benders decomposition approach, where the master problem decides on the network configuration, and each subproblem evaluates a security scenario. The main focus of the presentation then lies on an efficient algorithm to fully solve these subproblems by using linear equation systems. In particular, we are able to almost completely remove the computational impact of substation reconfiguration on subproblems. Preliminary results show significant performance gains.
Keywords
- Decomposition Methods
- Robust Optimization
- Energy Policy and Planning
Status: accepted
Back to the list of papers