Please use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/1277
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hafsi, Z. | - |
dc.contributor.author | Elaoud, S. | - |
dc.contributor.author | Mishra, M. | - |
dc.contributor.author | Akrout, M. | - |
dc.date.accessioned | 2019-05-23T10:45:34Z | - |
dc.date.available | 2019-05-23T10:45:34Z | - |
dc.date.issued | 2019-05-23 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1277 | - |
dc.description.abstract | As a preliminary important phase for a hydraulic network analysis procedure, loops identification process is studied in this paper by presenting an automated algorithm to select a set of independent loops for the network equilibrium. Through the presented study, the hydraulic network is modeled as an undirected graph edges-vertices. Also, to take into consideration the mechanical characteristics of the network, weights are assigned to pipes based on their hydraulic resistances. The assigned weights are taken as a selection criterion for loops identification. A numerical code under Matlab environment is generated and the established framework is tested on a set of real case networks. The obtained results are compared to those issued from previous researchers. Thus, the framework has proved its efficiency in identifying a set of independent loops even for complex network topologies. The mutual independence of the obtained loops is verified which allows to use the presented algorithm to build a general automated framework for water distribution network analysis. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Hydraulic network | en_US |
dc.subject | Minimum spanning tree | en_US |
dc.subject | Pipe weight graph theory | en_US |
dc.title | Independent loops selection in a hydraulic looped network | en_US |
dc.type | Article | en_US |
Appears in Collections: | Year-2018 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Full Text.pdf | 378.53 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.