Searcharxiv⌕ Search

arXiv subjects

Tim Donkiewicz

Publications and source records attributed to Tim Donkiewicz.

8 recordsLinked to original sources

Integrated Topology and Redispatch Optimization of Real-World Power Transmission Systems using Branch-and-Benders-Cut

Transmission system operators can reduce congestion management costs by jointly optimizing network topology, generator redispatch, and transformer settings. The large number of switching decisions, detailed operational constraints, and security requirements under outages make this problem computationally demanding. We present a full mixed-integer linear programming formulation that combines line switching, substation reconfiguration, generator commitment and redispatch, and transformer settings with operational requirements. We solve the problem using an exact branch-and-Benders-cut algorithm. We integrate specialized subproblem solution methods, subproblem selection, cut filtering, partial decomposition, and techniques for enforcing network connectivity. A sequential switching heuristic provides initial solutions for the exact solve. An extensive computational study on 130 synthetic instances demonstrates substantial reductions in solution time compared with standard Benders decomposition and shows how heuristic warmstarting improves solution quality, especially when more switching actions are allowed. Results on real transmission networks illustrate how joint topology and redispatch decisions identify effective switching actions that sequential approaches can miss. Selected solutions generated by our approach were presented to system operators and subsequently checked using alternating current power flow calculations. All seven discussed solutions passed a first operator assessment, indicating the practical potential of the integrated approach.

math.OC↗

Composition of Near-Planar Infrastructure Network Instances with Certified Skewness Bounds

Computational studies of optimization problems on infrastructure networks may require more suitable instances than are available. We propose a method to obtain additional instances by extracting and joining connected parts of existing networks, reusing their topology and parameters. Many infrastructure networks are near-planar, so added connections should preserve this property. We measure near-planarity by skewness, the minimum number of edges whose removal makes a graph planar. We derive bounds on the additional skewness caused by joining and give sufficient conditions under which none is added, and propose the corresponding strategy. We evaluate our approach on 100 sets of network parts extracted from each of PGLib-OPF and SNDlib. Within time limits, we show that no skewness is added for about half of the resulting power transmission networks and all considered telecommunication networks. Our method gives smaller mean upper bounds on added skewness than baselines that select vertices randomly, in order of decreasing degree, or using a Kamada--Kawai layout. Extraction and composition may also make the resulting optimization instances infeasible. To reduce this risk, we solve a simpler, tractable variant of the intended optimization problem during generation and restart if it is infeasible. On the generated instances, we solve security-constrained optimal transmission switching and survivable network design problems in full, demonstrating that the instances vary in computational difficulty with runtimes ranging from seconds to hours. The method thus extends the available benchmark sets with instances that inherit source data, have known skewness bounds, and cover a range of computational difficulty.

math.OC↗

Fast Subproblem Solving in Benders Decomposition for Affine Potential-Based Flow Problems with Topology Switching and Scenarios

Potential-based flow problems arise for a range of practical problems, like the operation of lossless power networks. The distribution of flows through the network is governed by the potential equation, which relates arc flows and node potentials following arc potential functions. We consider a general variant with affine potential functions, topology switching, and scenarios. It can be solved using a Benders decomposition algorithm, with each scenario corresponding to a subproblem. Subproblem solving time can then significantly contribute to overall running time. We present a fast algorithm to obtain Benders optimality and feasibility cuts from fixed master solutions. Problems with affine potential functions are reduced to equivalent problems where every potential function is the identity function. Optimal primal and dual solutions as well as unbounded dual rays are determined by systems of linear equations (SLE), resulting in a constant number of SLEs solved per subproblem. SLEs are solved using LU-factorizations, with the similarity between primal and dual, scenarios, and master solutions exploited by reusing factorizations via low-rank updates to significantly reduce theoretical complexity. We demonstrate the method on security-constrained optimal transmission switching instances, where subproblem solve time reductions of 97.98 percent compared to a standard LP solver are observed.

math.OC↗

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching

Many large-scale optimization problems decompose into a master problem and scenario subproblems, a structure that can be exploited by Benders decomposition. In Benders decomposition, each iteration may generate many cuts from scenario subproblems, and adding all of them as constraints then causes the master problem to grow rapidly. These are constraints that may need to be added to the master problem to guarantee optimality and feasibility of solutions, but we can avoid adding those constraints that are never violated. Adding fewer cuts per iteration can reduce the number of cuts added in total, but increase the number of iterations. In contrast, the cuts filtered for regular cut selection in mixed-integer programming solvers are optional and added exclusively to improve runtime behavior. We study Benders cut filtering: given the Benders cuts produced in an iteration, which subset should be added to the master problem? To our knowledge, few prior works have studied this question. We propose violation-based filtering (retaining the most-violated cuts), diversity-based filtering via k-medoids clustering on pairwise cosine distances (adding an original cut closest to the cluster centroid), and a hybrid that selects a most-violated cut per cluster. Each strategy can be augmented with an aggregated cut that retains discarded information. Computational experiments on 149 instances of an affine potential-based flow problem with topology switching and robustness scenarios -- solved via Benders decomposition -- show that all informed filtering strategies solve at least 125 instances (vs. 91 for the unfiltered baseline), reducing shifted geometric mean solve time by 55-57%. The hybrid strategy attains the best geometric mean (271.89 s vs. 629.34 s, a 57% reduction, p < 0.001).

math.OC↗

Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems

Scenario-based optimization problems can be solved via Benders decomposition, which separates first-stage (master problem) decisions from second-stage (subproblem) recourse actions and iteratively refines the master problem with Benders cuts. In conventional Benders decomposition, all subproblems are solved at each iteration. For problems with many scenarios, solving only a selected subset can reduce computation. We quantify the potential in selecting only those subproblems that yield cuts, and develop subproblem scoring and selection strategies. The proposed multi-criteria scoring methods combine historical subproblem performance metrics with problem-specific features, trained online via logistic regression to adapt to the changing likelihood of subproblem usefulness. Multiple stopping criteria balance exploration and exploitation: cut limits, proportional solve limits, and score thresholds. We evaluate our approach on a variant of the survivable network design problem, which serves as a testbed due to its natural decomposition into many subproblems of varying importance. Computational experiments on 135 test instances demonstrate the potential and practical performance of subproblem selection. Analysis reveals that 52.1% of all subproblems solved are unnecessary (they contribute no cuts and occur outside cut-free rounds). An oracle with perfect foresight reduces total solve times by 34.4%. Random selection performs significantly worse than full enumeration, showing that naive strategies can degrade performance. Our best-scoring and selection method achieves statistically significant improvements in both runtime and primal-dual integrals. These results provide empirical evidence that informed subproblem selection can improve Benders decomposition in this setting, while highlighting challenges in developing reliable prediction models.

math.OC↗

The SCIP Optimization Suite 9.0

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in the SCIP Optimization Suite 9.0. The updates in SCIP 9.0 include improved symmetry handling, additions and improvements of nonlinear handlers and primal heuristics, a new cut generator and two new cut selection schemes, a new branching rule, a new LP interface, and several bug fixes. The SCIP Optimization Suite 9.0 also features new Rust and C++ interfaces for SCIP, new Python interface for SoPlex, along with enhancements to existing interfaces. The SCIP Optimization Suite 9.0 also includes new and improved features in the LP solver SoPlex, the presolving library PaPILO, the parallel framework UG, the decomposition framework GCG, and the SCIP extension SCIP-SDP. These additions and enhancements have resulted in an overall performance improvement of SCIP in terms of solving time, number of nodes in the branch-and-bound tree, as well as the reliability of the solver.

math.OC↗

Enabling Research through the SCIP Optimization Suite 8.0

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of this paper is on the role of the SCIP Optimization Suite in supporting research. SCIP's main design principles are discussed, followed by a presentation of the latest performance improvements and developments in version 8.0, which serve both as examples of SCIP's application as a research tool and as a platform for further developments. Further, the paper gives an overview of interfaces to other programming and modeling languages, new features that expand the possibilities for user interaction with the framework, and the latest developments in several extensions built upon SCIP.

math.OC↗

The SCIP Optimization Suite 8.0

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 8.0 of the SCIP Optimization Suite. Major updates in SCIP include improvements in symmetry handling and decomposition algorithms, new cutting planes, a new plugin type for cut selection, and a complete rework of the way nonlinear constraints are handled. Additionally, SCIP 8.0 now supports interfaces for Julia as well as Matlab. Further, UG now includes a unified framework to parallelize all solvers, a utility to analyze computational experiments has been added to GCG, dual solutions can be postsolved by PaPILO, new heuristics and presolving methods were added to SCIP-SDP, and additional problem classes and major performance improvements are available in SCIP-Jack.

math.OC↗