Graph-based loop extraction for automatic analysis of a water pipe distribution network and comparison with EPANET

Authors:
Publisher website
Google Scholar
Abstract
This study introduces a new approach for automatic water pipe distribution network analysis by four integrated algorithms using graph theory, which are algorithms of minimal loop extraction, automatic initialization, automatic updating of initial discharges, and automatic pressure calculation at nodes. Object-oriented concepts have been used to design the algorithms for efficient data handling. The present integrated approach reduces the dependency of different processes involved in the analysis. The nested breadth first search traversal is used in the first algorithm to extract the loops without subdividing the graphical network. The initialization of pipes in loops is performed by satisfying the continuity equation at nodes in the second algorithm. The initialization, in the loop, is done in such a way that the adjacent loop will carry the residual discharge. Friction in the pipes is calculated iteratively for all flow types. Updating of discharge in pipes is according to the simultaneous loop flow adjustment method in the third algorithm. Initial discharges in the pipes of the loop in network are updated by corrective discharge in the loop according to the direction. The algorithm of nodal pressure calculation is done in the fourth algorithm, which is based on the energy equation in terms of pressure on the reference node. The results obtained by the proposed work are matched with EPANET software, in which the graphical display of the network is more user friendly and has the desired accuracy.

This publication has 15 references indexed in Scilit: