Searcharxiv⌕ Search

arXiv subjects

Marco Lübbecke

Publications and source records attributed to Marco Lübbecke.

6 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↗

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↗

Branch-and-price strikes back for the k-vertex cut problem

Given an undirected graph, the k-vertex cut problem (k-VCP) asks for a minimum-cost set of vertices whose removal yields at least k connected components in the resulting graph. The k-VCP is an important problem in network optimization, with applications in infrastructure protection and epidemic containment. We present a new extended integer linear programming (ILP) formulation that unifies and strengthens existing models and serves as the foundation for a new branch-and-price algorithm for the k-VCP. An in-depth theoretical study enables us to devise algorithmic components such as tailored branching rules that preserve the structure of the pricing problems, as well as valid inequalities and symmetry-handling techniques. We also show that our new model dominates all previous ILP formulations of the k-VCP in terms of their linear relaxations, which theoretically justifies the computational effectiveness of our approach. Extensive computational experiments against state-of-the-art methods demonstrate substantially improved performance, both in terms of instances solved to proven optimality and running times.

math.OC↗

The SCIP Optimization Suite 10.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 SCIP Optimization Suite 10.0. The updates in SCIP 10.0 include a new solving mode for exactly solving rational mixed-integer linear programs, a new presolver for detecting implied integral variables, a novel cut-based conflict analysis and separator for flower inequalities, two new heuristics, a novel tool for explaining infeasibility, a new interface for nonlinear solvers as well as improvements in symmetry handling, branching strategies, and SCIP's Benders' decomposition framework. SCIP Optimization Suite 10.0 also includes new and improved features in the the presolving library PaPILO, the parallel framework UG, and the decomposition framework GCG. Moreover, the SCIP Optimization Suite 10.0 contains MIP-DD, the first open-source delta debugger for mixed-integer programming solvers. 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↗