The University of New Mexico
Text

Power System Graph Converter


Authors: Juan Diego Colmenares F. (jcolmenares2710 at unm.edu), Dominik Neumayr, Svetlana V. Poroseva (poroseva at unm.edu)

Power System Graph Converter v.1.1
Copyright@2011, The Florida State University Research Foundation, Inc. All right reserved.

This software comes "as is" in a form of a single executable Jar file without warranties of any kind and for educational/non-commercial use only

This is a preliminary work associated with copyright material that is an initial GL non-commercial open-source coding work that provides an opportunity to draw a network with henetrogenous nodes: sources and sinks, and to automatically convert the network drawing into the adjacency matrix or the adjacency list. Networks considered in our group are power systems. Only simplified power system diagrams, which include generators (sources), loads (sinks), links, and interconnections of links, can be drawn with this software. Networks other than power systems can be drawn as well understanding that "generators" are sources and "loads" are sinks of a quantity of interst.

An adjacency matrix is a symmetric matrix that describes connectivity of the network components. The matrix columns/rows correspond to the network elements. Matrices generated by this software are different from those used in the traditional network analysis. In addition to nodes, such as sources as sinks, all links are included as separate matrix elements. Such network representation is of partcilar importance for the analysis of network resilience/survivability for which this software was primarily developed. Indeed, links are more vulnerable to external damage caused by adverse events than sources and sinks. Different links connecting the same nodes can have different capacity, vulnerability, and susceptibility. Thus, each link has to be treated individually when analysing the network chances to survive. Interconnections or junctions (physical connections) of links are not included as the matrix elements, because a fault in an interconnection can be represented by faults in the adjacent links.

When two components in the network are adjacent, the matrix elements on the crossing of the column and the row corresponding to the two elements is equal to unit, otherwise, it is zero. The generated matrix (list) is structured, that is, it contains information about the network element type. Initial matrix (list) positions i,j = 1,...,g are assigned to sources (g is the number of sources/generators). The following positions i,j=g+1,...,g+v, are reserved for sinks (v is the number of sinks/loads). The remaining elements are links. Positions are automatically assigned to the network elements during the network drawing. The matrix below corresponds to the network on the left.

In addition to the network representation described above, the software has an option to draw a network using only links of three different types: links that are directly connected to sources, links that are directly connected to sinks, and links between those two types.For example, the network shown in the figure above can be represented by links only as shown below:

The software interface is intuitive and easy to use. Using the toolbar and mouse buttons, one can draw a network of any complexity relatively fast. The conversion into the adjacency matrix/list is a one-click operation.

To install software, it is sufficient to download a single file: power_sys_drawing_RC_1.1.jar. No compilation is necessary. Clicking on this file should open the following interface:

If instead, a system suggests to open an archive or shows a file as a set of directories, you need to install the Java Runtime Environment. To install JRE on Ubuntu, for example, follow the steps shown in this link. To install on a Windows machine, follow this link. .

Download here v.1.1

The software should be compatible with any computer platform that supports Java applications.

More detailed description of this software can be found in

  • D. Neumayr, S. V. Poroseva, “On Development of Computational Tools for Evaluating System Survivability Due to Its Topology,” AIAA-2011-1818 , Proc. the 52st AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Denver, April 4-11, 2011.

  • Useful references to lear more about the network represenation:

  • S. V. Poroseva, “Designing Power System Topologies of Enhanced Survivability,” AIAA-2010-2572 , Proc. of the 51st AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Orlando, April 12-15, 2010.
  • S. V. Poroseva, ““Selfish” algorithm for reducing the computational cost of the network survivability analysis,” Journal of Optimization and Engineering, 2012, doi:10.1007/s11081-012-9207-1.The final publication is available at http://link.springer.com. preprint

  • Acknowledgments

    The authors would like to acknowledge support from the Idaho National Lab (2018) that allowed the software upgrade in 2018. Previously, partial support was provided for the software development from the Office of Naval Research (grant N00014-08-1-0080) and from the Engineering Research Center for Future Renewable Electric Energy Delivery and Management Systems supported by the National Science Foundation (grant NSF EEC-0812121) during Dr. Poroseva's affiliation with the Center for Advanced Power Systems, Florida State University, where the project was initiated.