New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem

Abstract

As the modern transmission control and relay technologies evolve, transmission line switching has become an important option in power system operators' toolkits to reduce operational cost and improve system reliability. Most recent research has relied on the DC approximation of the power flow model in the optimal transmission switching problem. However, it is known that DC approximation may lead to inaccurate flow solutions and also overlook stability issues. In this paper, we focus on the optimal transmission switching problem with the full AC power flow model, abbreviated as AC OTS. We propose a new exact formulation for AC OTS and its mixed-integer second-order conic programming (MISOCP) relaxation. We improve this relaxation via several types of strong valid inequalities inspired by the recent development for the closely related AC Optimal Power Flow (AC OPF) problem. We also propose a practical algorithm to obtain high quality feasible solutions for the AC OTS problem. Extensive computational experiments show that the proposed formulation and algorithms efficiently solve IEEE standard and congested instances and lead to significant cost benefits with provably tight bounds.

References in corpus (4)

• Strong SOCP Relaxations for the Optimal Power Flow Problem
• Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization
• The QC Relaxation: Theoretical and Computational Results on Optimal Power Flow
• On linear relaxations of OPF problems

Cited by in corpus (18)

• Tight-and-cheap conic relaxation for the optimal reactive power dispatch problem
• Mathematical Programming formulations for the Alternating Current Optimal Power Flow problem
• Chance Constrained Economic Dispatch Considering the Capability of Network Flexibility Against Renewable Uncertainties
• A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow
• Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
• On Subadditive Duality for Conic Mixed-Integer Programs
• A study of rank-one sets with linear side constraints and application to the pooling problem
• Distributionally Robust Optimization for a Resilient Transmission Grid During Geomagnetic Disturbances
• Recover Feasible Solutions for SOCP Relaxation of Optimal Power Flow Problems in Mesh Networks
• Rational Polyhedral Outer-Approximations of the Second-Order Cone
• Compact Disjunctive Approximations to Nonconvex Quadratically Constrained Programs
• Substation-Level Grid Topology Optimization Using Bus Splitting
• Enhanced Energy Management System with Corrective Transmission Switching Strategy. Part I: Methodology
• Efficient Identification of Bus Split Events Using Synchrophasor Data
• Algorithms for Mitigating the Effect of Uncertain Geomagnetic Disturbances in Electric Grids
• Ensuring Network Connectedness in Optimal Transmission Switching Problems
• Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem
• Stochastic Optimal Power Flow with Network Reconfiguration: Congestion Management and Facilitating Grid Integration of Renewables