Automated Framework for Water Looped Network Equilibrium

Zahreddine Hafsi (), Sami Elaoud, Manoranjan Mishra and Mohsen Akrout
Additional contact information
Zahreddine Hafsi: National Engineering School of Sfax
Sami Elaoud: National Engineering School of Sfax
Manoranjan Mishra: Indian Institute of Technology Ropar
Mohsen Akrout: National Engineering School of Sfax

Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), 2018, vol. 32, issue 2, No 16, 657 pages

Abstract: Abstract In this paper, a novel algorithm is proposed for balancing water looped network in steady state through a fully automated general framework of hydraulic networks regardless of their topological complexity. The model is developed by combining the following two steps, firstly a set of independent loops are identified based on a graph theoretical analysis in a looped network. Further the second step is devoted to the equilibrium process by determining the flow rate distribution within the network ducts and the pressure in the delivery nodes. The above such equilibrium process gives rise to a system of non linear algebraic equations which are solved numerically using both Hardy Cross (HC) and Newton Raphson (NR) methods. In HC method, the flow correction term is modified and a generalized expression is given to consider various possibilities of independent loops selection. Some real networks topologies that were commonly used as benchmarks, for testing various independent loops selection algorithms, are taken as case studies to apply the general automatic framework for hydraulic network analysis. Such network analysis enhances proving the applicability as well as the effectiveness of the proposed approach. Also, during the equilibrium procedure, it is proved that NR method is capable of producing accurate results and it converges more rapidly comparing to the widely used HC method. Moreover, it is demonstrated that NR’s iterative process, contrary to HC’s one, converges to reliable results even with a choice of random initial flow rates which makes a NR algorithm quite simple to implement without affecting the accuracy of the results.

Keywords: Water looped network; Minimum spanning tree; Kirchhoff’s laws; Independent loops; Hardy cross; Newton Raphson (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11269-017-1831-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:waterr:v:32:y:2018:i:2:d:10.1007_s11269-017-1831-2

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/11269

DOI: 10.1007/s11269-017-1831-2

Access Statistics for this article

Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA) is currently edited by G. Tsakiris

More articles in Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA) from Springer, European Water Resources Association (EWRA)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().