A topology-based algorithm for tracking network connectivity

Abstract

This paper describes a fast algorithm to track the network connectivity of islands, currently in production as part of AEP's new network topology processor function. After breaker activities have caused one or more branches to switch buses, the new algorithm uses a local updating procedure to track the network connectivity. This is in contrast to the global depth-first search method currently used in most energy management system installations. The new algorithm and its two subordinate tasks are introduced and thoroughly discussed. The corresponding data structures are also described to aid implementation by other investigators. An example is provided to illustrate the algorithmic steps. The results of applying the new algorithm to a 2450-bus, 5600-branch AEP real-time base-case network are presented. Graph theory notation and terminology are used throughout.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>