Research Article | OPEN ACCESS
Algorithm Acceleration and Data Storage Volume Reduction in Reliability Modeling Within Distribution Network
Esmail limouzade
Department of Electronic, Dezful Branch, Islamic Azad University, Dezful, Iran
Research Journal of Applied Sciences, Engineering and Technology 2013 16:4149-4154
Received: July 31, 2012 | Accepted: September 08, 2012 | Published: April 30, 2013
Abstract
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.
Keywords:
Acceleration, data volume reduction, graph theory, reliability, modeling,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|