Analysis of Head-loss Equations under EPANET and Hardy Cross Method
Journal Title: Saudi Journal of Engineering and Technology - Year 2017, Vol 2, Issue 3
Abstract
Abstract: A comparative analysis of head-loss equations under EPANET computer program and Hardy Cross iterative method was carried out in this project. A single period analysis was performed on a three-loop network in EPANET’s work space. Also, the network was solved with the Hardy Cross method, applying a single loop adjustment algorithm. The frictional head-losses in each of the methods were computed using the Darcy Weisbach and Hazen Williams head-loss equations. The convergence of the flow rate corrections in each of the cases was evaluated and compared. Results of the analysis showed that the flow rate corrections converged at the 4th and 14th iteration for the two head-loss formulae in EPANET and Hardy Cross method respectively. The results were subjected to t-test on 5% level of significance, and it showed that there is no significant difference in the use of either of the head-loss equations for computations in each of the methods. Thus, any one of the head-loss equations can be used for effective analysis of pipe networks. Keywords: EPANET 2.0 software, Convergence, Head loss Equation, Hardy cross method, Pipe network.
Authors and Affiliations
I. I. Nwajuaku, Y. M. Wakawa
Keywords
Related Articles
- EP ID EP401708
- DOI -
- Views 175
- Downloads 0
Sustainable Neighborhood in Doha (State of Qatar): A Strategy for Achieving Urban Quality in Al-Hitmi
Abstract: Over the past two decades, gulf cities have been rapidly growing, mainly after the discovery of oil. Large-scale urban projects have been constructed as a result of globalization, which has affected the built e...
The Relation of Fibonacci sequence with the Other Numbers
Abstract:The Fibonacci sequence is famous because it’s have amazing and great properties. In this study, we prove some of the interesting properties which include the relations between Fibonacci numbers and (9, 19, 29)....
Randic and General Randic Indcies of Unicyclic Graphs
Abstract: Let a simple graph G is a connected graph. The General Randic Index GR(G) of a graph G is defined as GR(G) = ∑ (ρuρv )t ; uv ∈ E(G) where ρu and ρv are the degree of vertices u and v....
Effect of the Different Energy of Compaction on Subbse Course of Roads
Abstract: Compaction of subbase is often the main load-bearing layer of a pavement. It is designed to evenly spread the load of the paving, it compacted with heavy equipment until the material forms a dense layer of inte...
Robust control of Multi Machine Power System Using Intelligent Control methods and their Performance Comparison
Abstract:This paper is deals with the robustness property of various intelligent control methods namely Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Bacterial Foraging Algorithm (BFA), and Harmony Search Al...