A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction
A computationally improved algorithm to find the best transmission switching (TS) candidate for load shed reduction after (<i>N</i>-2) contingencies is presented. TS is a planned line outage and research from the past shows that changing transmission system's mesh topology changes the power flows and removes post contingency violations (PCVs). One of the major challenges is to find the best TS candidate in a suitable time. Here, the best TS candidate is determined by using a novel heuristic method by decreasing the search space based on proximity to load shedding bus (LSB). The proposed method is capable of finding the best TS candidate faster than the well-known existing algorithm in the literature and guarantees removal of PCVs. Moreover, proposed algorithm is compatible with both AC and DC optimal power flow (OPF) formulations. Finally, the proposed method is implemented by modifying the topology of the transmission system after (<i>N</i>-2) contingencies in the IEEE 39-bus, IEEE 118-bus, and Polish 2383-bus test systems. Two metrics are used to compare results from the proposed method with those from state-of-the-art to show the speedup and accuracy achieved. Parallel computing is used to increase the computational performance of the proposed algorithm.