A Computationally Improved Heuristic Algorithm for Transmission
Switching Using Line Flow Thresholds for Load Shed Reduction
Abstract
We present a computationally improved heuristic algorithm for
transmission switching (TS) to recover load shed. Research from the past
showed that changing power system topology may control power flows and
remove line congestion. Hence, TS may reduce the required load shed. One
of the main challenges is to find a potential TS candidate in a suitable
time. Here, we propose a novel heuristic method that is capable of
finding the potential TS candidate faster than existing algorithms in
literature. The proposed method is compatible with both the AC and DC
optimal power flows (OPF). Three metrics are used to compare the
proposed algorithm with the state-of-the-art from literature to show the
speedup and accuracy achieved. The proposed method is implemented on the
IEEE 30-bus system, PEGASE 89-bus system, IEEE 118-bus system, and
Polish 2383-bus system. The results on the large-scale Polish 2383-bus
system shows that the proposed algorithm is scalable to large real-world
systems. Parallel computing is implemented to further improve the
computational performance of the proposed algorithm.