Accuracies of Optimal Transmission Switching Heuristics Based on DCOPF and ACOPF

This paper considers optimal transmission switching (OTS) to reduce generation cost by removing lines from service. A mixed integer program (MIP) has been proposed to solve the OTS problem, based on the linear direct current optimal power flow (DCOPF) model. Because of excessive computation times for large, real systems, the MIP model has been followed by some heuristics, also based on the DCOPF, to obtain near-optimal solutions quickly. However, the approximations in the DCOPF model may lead to poor choices of lines to remove from service. We assess the quality of line removal recommendations that rely on a previously published, DCOPF-based heuristic, by estimating actual cost reduction with the exact ACOPF model, using the IEEE 118-bus and 300-bus test systems with several demand levels. We also extend this heuristic to be based on the ACOPF and compare the quality of its recommendations to those of the DCOPF-based heuristic. The DCOPF-based heuristic performs very poorly in several cases, even leading to cost increases sometimes. There is a need for approximations to the ACOPF which are accurate enough to produce reliably good results for OTS heuristics, but fast enough for practical use.