Water Science and Engineering 2010, 3(1) 23-35 DOI:   10.3882/j.issn.1674-2370.2010.01.003  ISSN: 1674-2370 CN: 32-1785/TV

Current Issue | Archive | Search                                                            [Print]   [Close]
Information and Service
This Article
Supporting info
Service and feedback
Email this article to a colleague
Add to Bookshelf
Add to Citation Manager
Cite This Article
Email Alert
large-scale networks
hydraulic simulation
graph theory
fundamental loop
spanning tree
Article by Huan-feng,.D
Article by Guo-ping,.Y

Spanning tree-based algorithm for hydraulic simulation of large-scale water supply networks

Huan-feng DUAN,Guo-ping YU

1. Department of Civil and Environmental Engineering, Hong Kong University of Science and Technology, Hong Kong, P. R. China
2. College of Environmental Science and Engineering, Tongji University, Shanghai 200092, P. R. China


With the purpose of making calculation more efficient in practical hydraulic simulations, an improved algorithm was proposed and was applied in the practical water distribution field. This methodology was developed by expanding the traditional loop-equation theory through utilization of the advantages of the graph theory in efficiency. The utilization of the spanning tree technique from graph theory makes the proposed algorithm efficient in calculation and simple to use for computer coding. The algorithms for topological generation and practical implementations are presented in detail in this paper. Through the application to a practical urban system, the consumption of the CPU time and computation memory were decreased while the accuracy was greatly enhanced compared with the present existing methods.

Keywords large-scale networks   hydraulic simulation   graph theory   fundamental loop   spanning tree   efficiency  
Received 2010-04-01 Revised  Online: 2010-04-02 
DOI: 10.3882/j.issn.1674-2370.2010.01.003
Corresponding Authors: Huan-feng DUAN
Email: ceduan@ust.hk
About author:

Bhave, P. R. 1981. Node flow analysis of water distribution systems. Journal of Transportation Engineering, 107(4), 457-467.
Cross, H. 1936. Analysis of Flow in Networks of Conduits or Conductors. Urbana: University of Illinois.
Deuerlein, J. W. 2008. Decomposition model of a general water supply network graph. Journal of Hydraulic Engineering, 134(6), 822-832.
Duan, H. F., and Yu, G. P. 2006. Improved hybrid genetic algorithms for optimal scheduling model of urban water-supply system. Journal of Tongji University (Science Edition), 34(3), 377-381.
Gross, J. L., and Yellen, J. 2006. Graph Theory and its Applications (2nd Edition). Boca Raton: Chapman and Hall/CRC.
Novak, L., and Gibbons, A. 1999. Hybrid Graph Theory and Network Analysis. Cambridge: Cambridge University Press.
Ormsbee, L. E. 2006. The history of water distribution network analysis: The computer age. Proceedings of the 8th Annual Water Distribution Systems Analysis Symposium, 1-6. Cincinnati.
Whaley, R. S., and Hume, R. 1986. An optimization algorithm for looped water networks. Proceedings of the 18th PSIG Annual Meeting, 1-19. New Orleans.
Yan, X. S., and Liu, S. Q. 2002. System of Water Supply and Drainage Distribution. Beijing: China Architecture and Building Press.
Young, B. 1994. Design of branched-water-supply network on uneven terrain. Journal of Environmental Engineering, 120(4), 974-980. [doi:10.1061/(ASCE)0733-9372(1994)120:4(974)]
Similar articles
1.Su-juan ZHENG*1;Xiu-ming YU2;Li-qing CAO3.Application of k-person and k-task maximal efficiency assignment algorithm to water piping repair
[J]. Water Science and Engineering, 2009,2(2): 98-104
2.Helena M. RAMOS, Filipe Vieira, Didia I.C. Covas.Energy efficiency in a water supply system: Energy consumption and CO2 emission[J]. Water Science and Engineering, 2010,3(3): 331-340

Copyright by Water Science and Engineering