Algorithm Acceleration and Data Storage Volume Reduction in Reliability Modeling Within Distribution Network

Investigation and assessment of a system performance was complex. So Equipment reliability modeling may be a proper solution to easier it. Electricity distribution network is among systems reliability of which is of great importance. They are highly complex due to their large size and hence their modeling takes a long time. This study offers a simple algorithm for Electricity distribution networks modeling which enjoys algorithm high speed and data low volume. It is based on a graph search method called coloring. In this innovative method, it is suggested to search minimal path from the beginning of the feeder to the sink points. Also it is applied by saving paths in terms of switches and through logical operations of symmetric difference without searching paths from each input to estimate minimal path between all inputs and outputs. In so doing there will be no need for explicitly defining the source node, as it is easily recognizable via junction matrix composition. This kind of network modeling is so flexible and it is simply applicable to bidirectional or non-planar graphs

Acceleration, data volume reduction, graph theory, reliability, modeling