CN112836321A - Method for establishing drainage pipe network data model - Google Patents

Method for establishing drainage pipe network data model Download PDF

Info

Publication number
CN112836321A
CN112836321A CN202011626776.6A CN202011626776A CN112836321A CN 112836321 A CN112836321 A CN 112836321A CN 202011626776 A CN202011626776 A CN 202011626776A CN 112836321 A CN112836321 A CN 112836321A
Authority
CN
China
Prior art keywords
pipe
network
rainwater
sewage
confluence
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202011626776.6A
Other languages
Chinese (zh)
Inventor
陈方亮
李善生
张帆
魏琪
刘杰
王欣
黄丽娜
刘毅
梁帅锋
张玉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhengzhou Litong Water Co ltd
Original Assignee
Zhengzhou Litong Water Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhengzhou Litong Water Co ltd filed Critical Zhengzhou Litong Water Co ltd
Priority to CN202011626776.6A priority Critical patent/CN112836321A/en
Publication of CN112836321A publication Critical patent/CN112836321A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2113/00—Details relating to the application field
    • G06F2113/08—Fluids

Abstract

The invention discloses a method for establishing a drainage pipe network data model, which comprises the following steps of S1, constructing a directed network iteration expression of a rainwater pipe network; s2, constructing a directed network iteration expression of the sewage pipe network; s3, constructing a directed network iteration expression of the confluence pipe network; s4, combining the steps S1-S3, building a GIS data structure. The whole urban drainage pipe network is divided into three sub-pipe networks according to functions, namely a rainwater drainage pipe network, a sewage drainage pipe network and a confluence drainage pipe network, the three sub-pipe networks are respectively subjected to large-amount data acquisition and respectively built into sub-data models, then the data models of the three sub-pipe networks are constrained by a logic network model to generate a network model of the whole drainage pipe network, and the drainage pipe network model is built under the support of a large amount of real-time dynamic data and is more fit with an actual drainage pipe network.

Description

Method for establishing drainage pipe network data model
Technical Field
The invention belongs to the field of drainage, and particularly relates to a method for establishing a drainage pipe network data model.
Background
Drainage is important for city construction, especially, sewage discharge and drainage in rainy days are severe tests for city drainage, and the current situation of city drainage has the following problems: 1. the existing data of the drainage pipe network data are seriously insufficient and cannot be fully utilized; 2. the waterlogging which is ubiquitous in rainy seasons is serious, and the problems of great economic loss and personnel and property safety are caused. The water supply network of the whole city does not have a systematic accurate drainage pipe network model, and the drainage of the whole city cannot be effectively managed and simulated.
Disclosure of Invention
Aiming at the defects described in the prior art, the invention provides a method for establishing a drainage pipe network data model.
According to the principles of graph theory, the following definitions are given:
definition 1:
the following drawings: the expression of graph G is G ═ V, E;
g ═ (V, E) is a system where V is a non-empty finite set, and the elements V in V are called nodes; the element E in E is called an edge, and the element in E is tied to a pair of elements in V.
Definition 2:
directed graph: if each edge in the graph G has a direction, the graph G is called as a directed graph and is marked as D (v, E); in order to distinguish from an undirected graph, the vertex order pairs of the directed graph are < vi, vj >, < vi, vj > denote a directed edge, vi is the start point of the edge, and vj is the end point of the edge.
Definition 3:
degree of the directed graph vertex v: let "D" (v, E) be a directed graph, where the number of edges starting at v in D is referred to as "v out", and is denoted as "degGo out(v) (ii) a The number of edges with v as the end point is called the in-degree of v and is denoted as degInto(v) (ii) a The sum of in-degree and out-degree is called degree of v and is recorded as deg (v).
Definition 4:
path: setting G ═ V, E as a graph, Vp, Vq ∈ V; the path between Vp and Vq refers to the vertex sequence Vp, Va., via., Vq, where (Vp, Va), (Vp, Vi2), (Vp, Vi3), (Vin, Va) are the edges or arcs in the graph G, respectively.
If Vp is Vq, the path is called a loop or a ring, and if n vertices of a loop Vp, Va, via.
Definition 5:
network: in a directed graph, there is and only one source s and one sink t, the source s being degInto(v) Node 0, t is degGo out(v) A node of 0; and the capacity of the edge e is the weight c (e) on the edge e, and the directed graph is a directed weighted graph; if the directed graph is a strict directed graph, the directed weighted graph is called a network.
Although a directed graph with circles is rarely designed in urban drainage planning design, namely rainwater flowing out from a certain node does not return to the node after passing through a plurality of pipelines, generally, a drainage pipe network has many directed trees in the simplest example of a no-circle directed graph, but the drainage pipe network graph is usually constructed due to actual diversion and is not a simple directed tree, so that the drainage pipe network is considered to be a directed network graph, namely the directed graph with the right of the edges.
Therefore, in order to establish a drainage pipe network of a city, the technical scheme adopted by the invention is as follows:
a method for establishing a drainage pipe network data model comprises the following steps:
and S1, constructing a directed network iteration expression of the rainwater pipe network.
S1.1, constructing a directed network graph of the rainwater pipe network.
Let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the rainwater pipe network comprises a rainwater inlet, a rainwater inspection well, a rainwater pump station, a rainwater pipe and a rainwater outlet;
the rainwater pipes including the rainwater trunk pipes and the rainwater branch pipes are arcs of a directed network diagram, and the set of the rainwater pipes is an arc set A;
the rainwater inlets are sources of the directed network graph, and the set of the rainwater inlets is a source set X;
the rainwater outlets are sinks of the directed network graph, and the set of the rainwater outlets is a source set Y;
the rainwater inspection well and the rainwater pump station are made to be middle points of the directed network graph, and the set of the rainwater inspection well and the rainwater pump station is a middle point set U.
S1.2, taking a vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the rainwater pipe network is constructed;
Figure RE-GDA0002963250060000031
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S1.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the rainwater pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000041
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of the arc aij (aij ∈ a) is cij, cij is the capacity of the rainwater pipeline, and cij ═ c (aij) ═ c (e), because for vaij ∈ a, i.e., each rainwater pipeline corresponds to a capacity, then for va ∈ a, a capacity function c (a), i.e., a network map weight function c (e), corresponds; the maximum design flow of the rainwater pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual or calculated through an empirical formula.
Each element of the capacity matrix C (p + m) × (m + q) clearly represents the capacity of the individual storm drains in the storm drain network and the connection of the apex to the storm drains.
And S2, constructing a directed network iteration expression of the sewage pipe network.
S2.1, constructing a directed network graph of the sewage pipe network.
Let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the sewage pipe network comprises a sewage collecting well, a sewage inspection well, a lifting pump station, a sewage pipe, a sewage treatment plant and a sewage outlet;
the sewage pipes including the sewage main pipe and the sewage branch pipe are arcs of a directed network diagram, and the collection of the sewage pipes is an arc set A;
enabling the sewage collection wells to be sources of the directed network graph, and enabling the set of the sewage collection wells to be a source set X;
enabling a sewage treatment plant and a sewage outlet to be sinks of a directed network diagram, and enabling a set of the sewage treatment plant and the sewage outlet to be a source set Y;
and enabling the sewage inspection well and the lifting pump station to be intermediate points of the directed network graph, and enabling the set of the sewage inspection well and the lifting pump station to be an intermediate point set U.
S1.2, taking a vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the sewage pipe network is constructed;
Figure RE-GDA0002963250060000051
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S1.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the sewage pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000061
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of arc aij (aij ∈ a) is cij, cij is the capacity of the sewer line, cij ═ c (aij) ═ c (e); since for vaij ∈ a, i.e. one capacity per sewer line, for va ∈ a, there is a capacity function c (a), i.e. the network graph weight function c (e); the maximum design flow of the sewage pipe with a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each sewage pipe in the sewage pipe network and the communication condition between the vertex and the sewage pipe;
s3, constructing a directed network iteration expression of the confluence pipe network;
s3.1, constructing a directed network graph of the confluence pipe network;
let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the confluence pipe network comprises a confluence water inlet, a confluence inspection well, a confluence pump station, a confluence pipe and a confluence water outlet;
making a confluence pipe comprising a confluence main pipe and confluence branch pipes as arcs of a directed network graph, wherein the set of the confluence pipe is an arc set A;
making the confluence water inlet as a source of the directed network graph, and making a set of the confluence water inlets as a source set X;
making the confluent water outlets be confluent of a directed network graph, and taking a set of the confluent water outlets as a source set Y;
making a confluence inspection well and a confluence pump station as middle points of a directed network graph, and making a set of the confluence inspection well and the confluence pump station as a middle point set U;
s3.2, taking the vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the confluence pipe network is constructed;
Figure RE-GDA0002963250060000071
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S3.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the confluence pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000081
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; when bij ═ 1, the capacity of the arc aij (aij ∈ a) is cij, cij is the capacity of the confluent pipeline, and cij ═ c (aij) ═ c (e); because V aij epsilon A corresponds to a capacity for each converging pipeline, V a epsilon A corresponds to a capacity function c (a), namely a network graph weight function c (e); the maximum design flow of the confluence pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each flow merging pipe in the confluence pipe network and the communication condition of the top point and the flow merging pipe.
And S4, combining the steps S1-S3, building a GIS data structure to obtain a GIS drain network model.
S4.1, establishing a rainwater pipe information stack table;
the rainwater pipe information stack table comprises an attribute information ID value AID of a rainwater pipe, a spatial information ID value GID of the rainwater pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.2, establishing a sewage pipe information stack table;
the sewage pipe information stack table comprises an attribute information ID value AID of a sewage pipe, a spatial information ID value GID of the sewage pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.3, establishing a confluence pipe information stack table;
the information stack table of the confluence tube comprises an attribute information ID value AID of a sewage tube, a space information ID value GID of the confluence tube, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a dead point ground elevation XYDMBG, a starting point tube bottom elevation SYGDBG, a dead point tube bottom elevation XYGDBG, a tube diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.4, establishing a water outlet information stack table;
the water outlet information stack table comprises an attribute information ID value AID of the equipment, a space information ID value GID of the equipment, a road name SZLM where the equipment is located, the catchment area SSHSQ and the burial depth MS;
s4.5, establishing an inspection well information table;
the inspection well information stack table comprises an attribute information ID value AID of equipment, a spatial information ID value GID of the equipment, a road name SZLM where the equipment is located, the catchment area SSHSQ and a buried depth MS;
s4.6, establishing an equipment pipeline relation stack table;
the equipment pipeline relation stack table comprises an FTGID of a starting equipment GID, a GX GID of a pipeline GID and an SCGID of a stopping equipment GID;
s4.7, establishing a corresponding relation between the equipment pipeline relation stack table and a rainwater pipe information stack table, a sewage pipe information stack table, a confluence pipe information stack table, a water outlet information stack table and an inspection well information stack table according to the directed network diagram to obtain a GIS drainage pipe network model;
the rainwater pipe information stack table establishes a corresponding relation with the GX GID of the pipeline GID of the equipment pipeline relation stack table through the spatial information ID value GID of the rainwater pipe;
the sewage pipe information stack table establishes a corresponding relation between the spatial information ID value GID of the sewage pipe and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the conflux tube information stack table establishes a corresponding relation through the spatial information ID value GID of the conflux tube and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the water outlet information stack table respectively establishes corresponding relations with the FTGID of the starting point device GID and the SCGID of the stopping point device GID through the space information ID value GID of the device;
and the inspection well information stack table respectively establishes corresponding relations with the FTGID of the starting point equipment GID and the SCGID of the stopping point equipment GID through the spatial information ID value GID of the equipment.
The invention divides the whole urban drainage pipe network into three sub-pipe networks according to functions, namely a rainwater drainage pipe network, a sewage drainage pipe network and a confluence drainage pipe network, collects a large amount of real-time data for the three sub-pipe networks respectively and establishes sub-data models respectively, then combines the data models of the three sub-pipe networks with GIS data under the constraint of the network model to generate a GIS pipe network model of the whole drainage pipe network, the drainage pipe network model is established under the support of a large amount of collected data and is more fit with the actual drainage pipe network, and the sub-module establishment is realized in a block manner, only the data corresponding to the sub-model needs to be considered when a single sub-model is established, so that the data processing process is simplified, the model can be rapidly and accurately obtained, the drainage pipe network model established by the method can simulate and early warn the drainage of the city, and the optimization and improvement.
Drawings
Fig. 1 is a schematic view of a storm water pipe net according to the present invention.
Fig. 2 is a diagram of a GIS data structure of the drainage network of the present invention.
Detailed Description
A method for establishing a drainage pipe network data model comprises the following steps:
and S1, constructing a directed network iteration expression of the rainwater pipe network.
S1.1, constructing a directed network graph of the rainwater pipe network.
Let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the rainwater pipe network comprises a rainwater inlet, a rainwater inspection well, a rainwater pump station, a rainwater pipe and a rainwater outlet;
the rainwater pipes including the rainwater trunk pipes and the rainwater branch pipes are arcs of a directed network diagram, and the set of the rainwater pipes is an arc set A;
the rainwater inlets are sources of the directed network graph, and the set of the rainwater inlets is a source set X;
the rainwater outlets are sinks of the directed network graph, and the set of the rainwater outlets is a source set Y;
the rainwater inspection well and the rainwater pump station are made to be middle points of the directed network graph, and the set of the rainwater inspection well and the rainwater pump station is a middle point set U.
S1.2, taking a vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the rainwater pipe network is constructed;
Figure RE-GDA0002963250060000111
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S1.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the rainwater pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000121
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of the arc aij (aij ∈ a) is cij, cij is the capacity of the rainwater pipeline, and cij ═ c (aij) ═ c (e), because for vaij ∈ a, i.e., each rainwater pipeline corresponds to a capacity, then for va ∈ a, a capacity function c (a), i.e., a network map weight function c (e), corresponds; the maximum design flow of the rainwater pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual or calculated through an empirical formula.
Each element of the capacity matrix C (p + m) × (m + q) clearly represents the capacity of each storm drain in the storm drain network and the communication between the apex and the storm drains, as shown in fig. 1.
And S2, constructing a directed network iteration expression of the sewage pipe network.
S2.1, constructing a directed network graph of the sewage pipe network.
Let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the sewage pipe network comprises a sewage collecting well, a sewage inspection well, a lifting pump station, a sewage pipe, a sewage treatment plant and a sewage outlet;
the sewage pipes including the sewage main pipe and the sewage branch pipe are arcs of a directed network diagram, and the collection of the sewage pipes is an arc set A;
enabling the sewage collection wells to be sources of the directed network graph, and enabling the set of the sewage collection wells to be a source set X;
enabling a sewage treatment plant and a sewage outlet to be sinks of a directed network diagram, and enabling a set of the sewage treatment plant and the sewage outlet to be a source set Y;
and enabling the sewage inspection well and the lifting pump station to be intermediate points of the directed network graph, and enabling the set of the sewage inspection well and the lifting pump station to be an intermediate point set U.
S1.2, taking a vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the sewage pipe network is constructed;
Figure RE-GDA0002963250060000131
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S1.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the sewage pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000141
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of arc aij (aij ∈ a) is cij, cij is the capacity of the sewer line, cij ═ c (aij) ═ c (e); since for vaij ∈ a, i.e. one capacity per sewer line, for va ∈ a, there is a capacity function c (a), i.e. the network graph weight function c (e); the maximum design flow of the sewage pipe with a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each sewage pipe in the sewage pipe network and the communication condition between the vertex and the sewage pipe;
s3, constructing a directed network iteration expression of the confluence pipe network;
s3.1, constructing a directed network graph of the confluence pipe network;
let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the confluence pipe network comprises a confluence water inlet, a confluence inspection well, a confluence pump station, a confluence pipe and a confluence water outlet;
making a confluence pipe comprising a confluence main pipe and confluence branch pipes as arcs of a directed network graph, wherein the set of the confluence pipe is an arc set A;
making the confluence water inlet as a source of the directed network graph, and making a set of the confluence water inlets as a source set X;
making the confluent water outlets be confluent of a directed network graph, and taking a set of the confluent water outlets as a source set Y;
making a confluence inspection well and a confluence pump station as middle points of a directed network graph, and making a set of the confluence inspection well and the confluence pump station as a middle point set U;
s3.2, taking the vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the confluence pipe network is constructed;
Figure RE-GDA0002963250060000151
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0.
S3.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the confluence pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure RE-GDA0002963250060000161
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; when bij ═ 1, the capacity of the arc aij (aij ∈ a) is cij, cij is the capacity of the confluent pipeline, and cij ═ c (aij) ═ c (e); because V aij epsilon A corresponds to a capacity for each converging pipeline, V a epsilon A corresponds to a capacity function c (a), namely a network graph weight function c (e); the maximum design flow of the confluence pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each flow merging pipe in the confluence pipe network and the communication condition of the top point and the flow merging pipe.
And S4, combining the steps S1-S3, building a GIS data structure to obtain a GIS drain network model.
S4.1, establishing a rainwater pipe information stack table;
the rainwater pipe information stack table comprises an attribute information ID value AID of a rainwater pipe, a spatial information ID value GID of the rainwater pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.2, establishing a sewage pipe information stack table;
the sewage pipe information stack table comprises an attribute information ID value AID of a sewage pipe, a spatial information ID value GID of the sewage pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.3, establishing a confluence pipe information stack table;
the information stack table of the confluence tube comprises an attribute information ID value AID of a sewage tube, a space information ID value GID of the confluence tube, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a dead point ground elevation XYDMBG, a starting point tube bottom elevation SYGDBG, a dead point tube bottom elevation XYGDBG, a tube diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.4, establishing a water outlet information stack table;
the water outlet information stack table comprises an attribute information ID value AID of the equipment, a space information ID value GID of the equipment, a road name SZLM where the equipment is located, the catchment area SSHSQ and the burial depth MS;
s4.5, establishing an inspection well information table;
the inspection well information stack table comprises an attribute information ID value AID of equipment, a spatial information ID value GID of the equipment, a road name SZLM where the equipment is located, the catchment area SSHSQ and a buried depth MS;
s4.6, establishing an equipment pipeline relation stack table;
the equipment pipeline relation stack table comprises an FTGID of a starting equipment GID, a GX GID of a pipeline GID and an SCGID of a stopping equipment GID;
and S4.7, establishing a corresponding relation between the equipment pipeline relation stack table and the rainwater pipe information stack table, the sewage pipe information stack table, the confluence pipe information stack table, the water outlet information stack table and the inspection well information table according to the directed network diagram to obtain a GIS drainage pipe network model, wherein as shown in figure 2, Varchar indicates that the field type is a variable-length character type, Tnt indicates an integer type space section, and Number indicates a numerical type space section.
The rainwater pipe information stack table establishes a corresponding relation with the GX GID of the pipeline GID of the equipment pipeline relation stack table through the spatial information ID value GID of the rainwater pipe;
the sewage pipe information stack table establishes a corresponding relation between the spatial information ID value GID of the sewage pipe and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the conflux tube information stack table establishes a corresponding relation through the spatial information ID value GID of the conflux tube and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the water outlet information stack table respectively establishes corresponding relations with the FTGID of the starting point device GID and the SCGID of the stopping point device GID through the space information ID value GID of the device;
and the inspection well information stack table respectively establishes corresponding relations with the FTGID of the starting point equipment GID and the SCGID of the stopping point equipment GID through the spatial information ID value GID of the equipment.
In the description herein, references to the description of "one embodiment," "an example," "a specific example" or the like are intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.

Claims (4)

1. A method for establishing a drainage pipe network data model is characterized by comprising the following steps: s1, constructing a directed network iteration expression of the rainwater pipe network;
s2, constructing a directed network iteration expression of the sewage pipe network;
s3, constructing a directed network iteration expression of the confluence pipe network;
s4, combining the steps S1-S3, building a GIS data structure to obtain a GIS drainage pipe network model;
s4.1, establishing a rainwater pipe information stack table;
the rainwater pipe information stack table comprises an attribute information ID value AID of a rainwater pipe, a spatial information ID value GID of the rainwater pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.2, establishing a sewage pipe information stack table;
the sewage pipe information stack table comprises an attribute information ID value AID of a sewage pipe, a spatial information ID value GID of the sewage pipe, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a stop ground elevation XYDMBG, a starting point pipe bottom elevation SYGDBG, a stop pipe bottom elevation XYGDBG, a pipe diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.3, establishing a confluence pipe information stack table;
the information stack table of the confluence tube comprises an attribute information ID value AID of a sewage tube, a space information ID value GID of the confluence tube, a located road name SZLM, the catchment area SSHSQ, a starting point ground elevation SYDMBG, a dead point ground elevation XYDMBG, a starting point tube bottom elevation SYGDBG, a dead point tube bottom elevation XYGDBG, a tube diameter GJ, a length CD, a buried depth MS and a slope PD;
s4.4, establishing a water outlet information stack table;
the water outlet information stack table comprises an attribute information ID value AID of the equipment, a space information ID value GID of the equipment, a road name SZLM of the equipment, the catchment area SSHSQ and the burial depth MS;
s4.5, establishing an inspection well information table;
the inspection well information stack table comprises an attribute information ID value AID of equipment, a spatial information ID value GID of the equipment, a road name SZLM of the equipment, the catchment area SSHSQ and a burial depth MS;
s4.6, establishing an equipment pipeline relation stack table;
the equipment pipeline relation stack table comprises an FTGID of a starting equipment GID, a GX GID of a pipeline GID and an SCGID of a stopping equipment GID;
s4.7, establishing a corresponding relation between the equipment pipeline relation stack table and a rainwater pipe information stack table, a sewage pipe information stack table, a confluence pipe information stack table, a water outlet information stack table and an inspection well information stack table according to the directed network diagram to obtain a GIS drainage pipe network model;
the rainwater pipe information stack table establishes a corresponding relation with the GX GID of the pipeline GID of the equipment pipeline relation stack table through the spatial information ID value GID of the rainwater pipe;
the sewage pipe information stack table establishes a corresponding relation between the spatial information ID value GID of the sewage pipe and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the conflux tube information stack table establishes a corresponding relation through the spatial information ID value GID of the conflux tube and the GX GID of the pipeline GID of the equipment pipeline relation stack table;
the water outlet information stack table respectively establishes corresponding relations with the FTGID of the starting point device GID and the SCGID of the stopping point device GID through the space information ID value GID of the device;
and the inspection well information stack table respectively establishes corresponding relations with the FTGID of the starting point equipment GID and the SCGID of the stopping point equipment GID through the spatial information ID value GID of the equipment.
2. The method for establishing a drainage pipe network data model according to claim 1, wherein the specific steps of constructing the directed network iterative expression of the rainwater pipe network are as follows:
s1.1, constructing a directed network graph of the rainwater pipe network;
let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the rainwater pipe network comprises a rainwater inlet, a rainwater inspection well, a rainwater pump station, a rainwater pipe and a rainwater outlet;
the rainwater pipes including the rainwater trunk pipes and the rainwater branch pipes are arcs of a directed network diagram, and the set of the rainwater pipes is an arc set A;
the rainwater inlets are sources of the directed network graph, and the set of the rainwater inlets is a source set X;
the rainwater outlets are sinks of the directed network graph, and the set of the rainwater outlets is a source set Y;
enabling the rainwater inspection well and the rainwater pump station to be intermediate points of the directed network graph, and enabling a set of the rainwater inspection well and the rainwater pump station to be an intermediate point set U;
s1.2, taking a vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the rainwater pipe network is constructed;
Figure FDA0002879377780000041
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0;
s1.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the rainwater pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure FDA0002879377780000042
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of arc aij (aij ∈ a) is cij, cij is the capacity of the rainwater pipeline, cij ═ c (aij) ═ c (e); the maximum design flow of the rainwater pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element of the capacity matrix C (p + m) × (m + q) clearly represents the capacity of the individual storm drains in the storm drain network and the connection of the apex to the storm drains.
3. The method for establishing the drainage pipe network data model according to claim 1, wherein the specific steps for constructing the directed network iterative expression of the sewage pipe network are as follows:
s2.1, constructing a directed network diagram of the sewage pipe network;
let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the sewage pipe network comprises a sewage collecting well, a sewage inspection well, a lifting pump station, a sewage pipe, a sewage treatment plant and a sewage outlet;
the sewage pipes including the sewage main pipe and the sewage branch pipe are arcs of a directed network diagram, and the collection of the sewage pipes is an arc set A;
enabling the sewage collection wells to be sources of the directed network graph, and enabling the set of the sewage collection wells to be a source set X;
enabling a sewage treatment plant and a sewage outlet to be sinks of a directed network diagram, and enabling a set of the sewage treatment plant and the sewage outlet to be a source set Y;
enabling the sewage inspection well and the lifting pump station to be middle points of a directed network graph, and enabling a set of the sewage inspection well and the lifting pump station to be a middle point set U;
s2.2, taking the vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the sewage pipe network is constructed;
Figure FDA0002879377780000061
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0;
s2.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the sewage pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure FDA0002879377780000062
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; if bij ═ 1, the capacity of arc aij (aij ∈ a) is cij, cij is the capacity of the sewer line, cij ═ c (aij) ═ c (e); the maximum design flow of the sewage pipe with a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each sewer pipe in the sewer network and the communication between the vertex and the sewer pipe.
4. The method for establishing the drainage pipe network data model according to claim 1, wherein the specific steps for constructing the directed network iterative expression of the combined pipe network are as follows:
s3.1, constructing a directed network graph of the confluence pipe network;
let the directed network graph be G ═ (V, a), a be the arc set of G; v is a set of vertices of G;
and V ═ X; u; y } - { x1, x2, x3, ·, xp; v1, v2, v 3.., vm; y1, y2, y3,.., yq };
wherein X is a subset of V, and each vertex X in X is the starting point of the arc in G;
y is a subset of V for which the collection is, each vertex Y in Y being the end point of an arc in G, and X ═ Y ═ 0;
u is a subset of V, each vertex U in U is both the start and end points of some arcs in G, and X ═ U ═ 0, Y ═ U ═ 0;
the confluence pipe network comprises a confluence water inlet, a confluence inspection well, a confluence pump station, a confluence pipe and a confluence water outlet;
making a confluence pipe comprising a confluence main pipe and confluence branch pipes as arcs of a directed network graph, wherein the set of the confluence pipe is an arc set A;
making the confluence water inlet as a source of the directed network graph, and making a set of the confluence water inlets as a source set X;
making the confluent water outlets be confluent of a directed network graph, and taking a set of the confluent water outlets as a source set Y;
making a confluence inspection well and a confluence pump station as middle points of a directed network graph, and making a set of the confluence inspection well and the confluence pump station as a middle point set U;
s3.2, taking the vertex set { X: U } as a row, and taking the vertex set { U; y is a column, and an arc matrix B (p + m) × (m + q) of a directed network graph G of the confluence pipe network is constructed;
Figure FDA0002879377780000071
if aij ═ u, Uj ∈ a, let bij ═ 1; otherwise bij is 0;
s3.3, obtaining a capacity matrix C (p + m) × (m + q) of a directed network graph G of the confluence pipe network, wherein the capacity matrix C (p + m) × (m + q) is a directed network iterative expression:
Figure FDA0002879377780000081
if the arc aij belongs to a in the arc matrix B (p + m) × (m + q), and bij is 0, then cij is 0; when bij ═ 1, the capacity of the arc aij (aij ∈ a) is cij, cij is the capacity of the confluent pipeline, and cij ═ c (aij) ═ c (e); the maximum design flow of the confluence pipe of a certain material, pipe diameter, gradient and roughness can be found according to a drainage planning design manual;
each element in the capacity matrix C (p + m) × (m + q) can clearly represent the capacity of each flow merging pipe in the confluence pipe network and the communication condition of the top point and the flow merging pipe.
CN202011626776.6A 2020-12-31 2020-12-31 Method for establishing drainage pipe network data model Pending CN112836321A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011626776.6A CN112836321A (en) 2020-12-31 2020-12-31 Method for establishing drainage pipe network data model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011626776.6A CN112836321A (en) 2020-12-31 2020-12-31 Method for establishing drainage pipe network data model

Publications (1)

Publication Number Publication Date
CN112836321A true CN112836321A (en) 2021-05-25

Family

ID=75924571

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011626776.6A Pending CN112836321A (en) 2020-12-31 2020-12-31 Method for establishing drainage pipe network data model

Country Status (1)

Country Link
CN (1) CN112836321A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113392462A (en) * 2021-06-29 2021-09-14 西安理工大学 Sewage pipe network rapid modeling method based on Revit secondary development
CN113392523A (en) * 2021-06-14 2021-09-14 云南省设计院集团有限公司 Sewage pipe network health condition diagnosis model based on long-duration multi-measuring-point
CN113420396A (en) * 2021-05-28 2021-09-21 浙江浙安数智环境工程有限公司 Method for tracing pollution of urban drainage pipe network
CN115795122A (en) * 2023-01-31 2023-03-14 中国水利水电科学研究院 Topological relation carding method for urban drainage pipe network
CN116992536A (en) * 2023-07-31 2023-11-03 北京梦诚科技有限公司 Rain sewage graph calculation method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100583815B1 (en) * 2005-10-17 2006-05-26 (주)그린시스 Apparatus and method for integrated management of drainage pump area
JP2006266072A (en) * 2004-12-14 2006-10-05 Toshiba Corp Rainwater drain support system and method, its control system and method
CN105117572A (en) * 2015-10-06 2015-12-02 北京工业大学 Automatic SWMM hydraulic model building method based on rainwater pipe network design computation sheet
CN107145958A (en) * 2017-03-20 2017-09-08 广东工业大学 A kind of intelligent draining dispatching method of municipal drainage pipe network based on improvement particle cluster algorithm

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006266072A (en) * 2004-12-14 2006-10-05 Toshiba Corp Rainwater drain support system and method, its control system and method
KR100583815B1 (en) * 2005-10-17 2006-05-26 (주)그린시스 Apparatus and method for integrated management of drainage pump area
CN105117572A (en) * 2015-10-06 2015-12-02 北京工业大学 Automatic SWMM hydraulic model building method based on rainwater pipe network design computation sheet
CN107145958A (en) * 2017-03-20 2017-09-08 广东工业大学 A kind of intelligent draining dispatching method of municipal drainage pipe network based on improvement particle cluster algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
姜永发等: "城市排水管网GIS空间数据模型研究", 《自然科学进展》 *
张书亮等: "GIS支持下的城市雨水出水口汇水区自动划分研究", 《水利学报》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113420396A (en) * 2021-05-28 2021-09-21 浙江浙安数智环境工程有限公司 Method for tracing pollution of urban drainage pipe network
CN113392523A (en) * 2021-06-14 2021-09-14 云南省设计院集团有限公司 Sewage pipe network health condition diagnosis model based on long-duration multi-measuring-point
CN113392462A (en) * 2021-06-29 2021-09-14 西安理工大学 Sewage pipe network rapid modeling method based on Revit secondary development
CN113392462B (en) * 2021-06-29 2023-09-26 西安理工大学 Sewage pipe network rapid modeling method based on Revit secondary development
CN115795122A (en) * 2023-01-31 2023-03-14 中国水利水电科学研究院 Topological relation carding method for urban drainage pipe network
CN116992536A (en) * 2023-07-31 2023-11-03 北京梦诚科技有限公司 Rain sewage graph calculation method and system

Similar Documents

Publication Publication Date Title
CN112836321A (en) Method for establishing drainage pipe network data model
CN110298076B (en) Urban waterlogging intelligent modeling and analysis method based on GIS and SWMM
CN107832931B (en) Modularized analysis method for waterlogging risk in plain water network region
Shao et al. Data integration and its application in the sponge city construction of China
Oraei Zare et al. Multi-objective optimization for combined quality–quantity urban runoff control
CN108763615A (en) Based on pipe network and road dual system SWMM to city flood ponding depth analogy method
CN113011903A (en) Water pollution accurate tracing method based on GIS and hydraulic model
Sanchez et al. An integrated cellular automata evolutionary-based approach for evaluating future scenarios and the expansion of urban drainage networks
CN112052561A (en) Method for formulating waterlogging prevention emergency plan of drainage system
CN114358664B (en) Flood scheduling and water resource guaranteeing method under conditions of changing environment and torrent and drought and torrent
CN108319758A (en) Tunnel drainage Optimized System Design method is worn under a kind of city based on hydraulic model
CN111898911A (en) Drainage waterlogging prevention emergency scheme design system
CN111581767A (en) Calibration characteristic parameter calibration method for pipe network-river coupling model
Wang et al. Risk assessment of rainstorm waterlogging in new district based on MIKE Urban
CN102184278B (en) Optimization method for drain pipe network
CN106651040A (en) Optimal layout method of urban waterlogging monitoring points
CN115841071A (en) Digital twin basin scene modeling method based on water circulation dynamic knowledge graph
Puleo et al. Water and energy saving in urban water systems: the ALADIN project
Farzin et al. Developing the performance of modern methods using multi-objective optimization in urban runoff control
CN114818211A (en) MIKE + based quantitative simulation technical method for constructing sewage collection system
CN113089792A (en) Municipal pipe network emergency drainage waterlogging water treatment method
KR20110118438A (en) System and method of integrated decision making for u-hydrologic circle
Jiang GIS stream network analysis for Huaihe River basin of China
Cai et al. Modeling and analyzing of waterlogging in typical urban area
Seraphim et al. Implication of urban occupation patterns in the natural infiltration

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20210525