Electric power system one-line diagram generation with branch and bound algorithm

摘要

This paper presents an algorithm for automatic one-line diagram generation for power distribution systems. These systems are large and their mathematical graph representations consist of (up to) thousands of vertices (substations, junctions, pole switches) and edges (i.e. power lines). Their succinct visualization is essential in SCADA applications where a well constructed one-line diagram enables dispatchers to perform their daily tasks more efficiently (e.g. fault restoration). The algorithm proposed in this paper is optimized for the power system domain. It is based on the classical divide and conquer algorithm as it divides the large graphs into smaller, more manageable parts, which are separately drawn by the branch and bound algorithm and combined into complete one-line diagrams. The algorithm was tested both on test networks and real life feeders with multiple feed-in points and interconnects.