An algorithmic approach to tracing closed loops in a power systems network

This paper proposes an approach to synthesize loops in a power systems network using graph theory techniques for the purpose of accommodating unscheduled flows (USFs), allocating power losses, and performing congestion analysis. The proposed algorithm utilizes no directional heuristics for edges using power flow results to detect loops in the transmission network graph. Each edge or transmission line is assumed to be bidirectional, and assigned to two loops, except in degenerate cases. The proposed algorithm utilizes a two-step iterative process with a second-order polynomial complexity. The results of using the algorithm are demonstrated on 3 standard IEEE test systems.