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

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 optimal transmission switching (AC OTS). We propose a new exact formulation for ACOTS and its mixed-integer second-order cone programming 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 problem [Kocuk et al., Strong SOCP relaxations for the optimal power flow problem, Oper. Res., vol. 64, no. 6, pp. 1177-1196, 2016]. 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.