Modeling, Partitioning And Layering Of Urban Water Supply Network Based On Complex Network Theory

Urban water supply network is a large-scale network with time-varyingproperties, with characteristics of complex structure, laying optional,difficulty of maintenance, and in actual management and schedulingexperience methods are usually adopted. In information dealing, dataprocessing is also facing large scale and computing complex problems, thusmodeling, partition and layering of urban water supply network are alwayshot spots of water industry research. Phenomena of water loss and userrandom using will contribute to abnormal pressure in water supply network.Combined with a real urban water supply network, this paper studies themodeling and partition of water supply network based on the relatedtheories and algorithms of complex network, to locate the district and layerof the nodes with abnormal pressure, as well as the Hydropower dispatchingequipment accordingly. The contributions of this paper are divided into thefollowing three parts:(1) The urban water supply network is firstly simplified, in which wemake a deep study into the pressure and flow relationship of the nodes andpipes before and after pipes omission, pipe merging and pipe decomposition.After the simplification of urban water supply network, it’s furtherabstracted into a directed graph G(V,E), making it the combination of twoclasses of elements and nodes. We draw the directions from the simulationof the network and update the map in the direction of the information byusing the method of time sampling, and the resulting model can reflect themain node in the urban water supply network and the close degree ofconnection between them. (2) This paper proposes a kind of urban water supply networkpartitioning algorithm. This algorithm is combined with the loop-flowstructure of water supply network and the closeness degree index of thecomplex network. In reference to the water suppliers-loops-usersstructure of the urban water supply network, we search loop structuresthrough the complex network depth-first search method algorithm, and thenby the closeness degree index which is used to defined minimum energyindex to determine the upstream water and downstream users of each loop.Compared with other partition algorithm based on topology analysis, thismethod has the more clear practical meaning, and can reflect the actualcommunity distribution of the water supply network.This paper puts forward an important node mining method of the urbanwater supply network. This method combines the flow-betweenness andapproximate flow-betweenness (commonly used in computing) in complexnetwork, and the initiation part, information spreading part and the finalcomputation part have been adjusted to accord with the actual situation ofwater supply network. This method can well reflect the urban water supplynetwork between the relative importances of each node, on the basis of theclassified file the entire hierarchy of water supply network.