CN116756885B - Drainage pipe network defect repair design and scale demonstration method based on dynamic programming - Google Patents
Drainage pipe network defect repair design and scale demonstration method based on dynamic programming Download PDFInfo
- Publication number
- CN116756885B CN116756885B CN202310535932.5A CN202310535932A CN116756885B CN 116756885 B CN116756885 B CN 116756885B CN 202310535932 A CN202310535932 A CN 202310535932A CN 116756885 B CN116756885 B CN 116756885B
- Authority
- CN
- China
- Prior art keywords
- defect
- repair
- pipe
- pipe section
- repaired
- 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.)
- Active
Links
- 230000007547 defect Effects 0.000 title claims abstract description 119
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000013461 design Methods 0.000 title claims abstract description 17
- 238000004364 calculation method Methods 0.000 claims abstract description 10
- 230000007847 structural defect Effects 0.000 claims description 18
- 238000009412 basement excavation Methods 0.000 claims description 8
- 230000002950 deficient Effects 0.000 claims description 4
- 230000007797 corrosion Effects 0.000 claims description 3
- 238000005260 corrosion Methods 0.000 claims description 3
- 238000005336 cracking Methods 0.000 claims description 3
- 238000007689 inspection Methods 0.000 claims description 3
- 239000000463 material Substances 0.000 claims description 3
- 230000035515 penetration Effects 0.000 claims description 3
- 239000010865 sewage Substances 0.000 description 8
- 238000001514 detection method Methods 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 239000003673 groundwater Substances 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000002351 wastewater Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000012466 permeate Substances 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000004065 wastewater treatment Methods 0.000 description 1
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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/14—Pipes
Abstract
The invention discloses a drainage pipe network defect repairing design and a scale demonstration method based on dynamic programming. Determining the total repairing cost of the pipe section according to the defect data information of the drainage pipe network; if the total cost of pipe segment repair does not exceed the total investment, all the pipe segments needing repair are transformed, an engineering quantity table is generated, and the process is finished; if the total cost of pipe segment repair exceeds the total investment, carrying out dynamic planning calculation on the total cost data of pipe segment repair, analyzing a scheme for maximizing the number of repaired defect points under the limit investment, and generating a pipe segment statistical table to be repaired; rechecking the pipe section statistical table to be repaired, if the repairing scheme is reasonable, generating an engineering quantity table, and ending; if the repair scheme is unreasonable, the pipe section statistics table to be repaired is adjusted. The invention takes the defect point repair quantity as a discrimination condition, automatically analyzes the optimal strategy of defect pipeline repair under the limited investment condition, and rapidly and accurately identifies the severe defect region.
Description
Technical Field
The invention belongs to the technical field of municipal engineering, and particularly relates to a drainage pipe network defect repairing design and scale demonstration method based on dynamic planning.
Background
The sewage pipe network is used as an important infrastructure for conveying urban sewage, and can effectively collect and transfer sewage and wastewater generated in population activities. With the rapid promotion of urban design and the implementation of a rain and sewage diversion strategy, the total length of a sewage pipe network and the density of pipes are rapidly increased. However, with the increase of the construction speed of the sewage pipe network, various problems in the pipe network are also presented successively, and the pipe network defect problem is particularly prominent. Pipe network defects can cause sewage to permeate into the ground and pollute groundwater environment; or groundwater infiltrates into the pipeline, resulting in a decrease in the influent concentration of the wastewater treatment plant, thereby affecting the efficiency of the wastewater system. Meanwhile, serious defects cause pipeline clogging, sewage overflow and severe environmental and social influences; pipeline defects cause water and soil loss to cause pavement collapse, and driving safety is affected.
Repairing pipeline defects and improving pipe network health degree have become industry consensus, however, repairing defects on all pipe networks has overlarge investment. Many cities today integrate pipe network belongings and defect data into a geographic information platform. How to reasonably screen out the pipe section with the biggest influence and the most prominent problem in massive pipe network defect detection data for repairing. At present, the repairing problem still mainly depends on manual analysis and detection data, the method has low efficiency and long period, the finally formed scheme is not necessarily an optimal scheme, and an analysis design method with high automation degree, rapidness and accuracy is urgently needed to improve the efficiency.
Disclosure of Invention
The invention aims to solve the defects of the background technology and provides a drainage pipe network defect repairing design and scale demonstration method based on dynamic programming.
The technical scheme adopted by the invention is as follows: a drainage pipe network defect repair design and scale demonstration method based on dynamic planning comprises the following steps:
step 1: acquiring topology relation data of a drainage pipe network, wherein the topology relation data comprises pipe section data and node data;
step 2: obtaining defect data information of a drainage pipe network, wherein the defect data information comprises pipe section numbers, defect point numbers, defect types, defect grades and defect densities;
step 3: determining the defect type and defect grade of a drainage pipe network to be repaired according to requirements of project requirements of the urban drainage pipe non-excavation repair update engineering technical procedure (CJJ 210-2014) and the urban drainage pipe detection and evaluation technical procedure (CJJ 181-2012);
step 4: dividing the type of the defect and the like to be repaired into a serious structural defect and a non-serious structural defect by taking the pipe section as a unit, and excavating and repairing the pipe section with the serious structural defect; for a pipe section with a less severe structural defect, calculating the defect density of the pipe section;
when the defect density is more than or equal to 0.5, adopting integral repair; when the defect density is less than or equal to 0.1, local repair is adopted; when the defect density is more than 0.1 and less than 0.5, judging the number of defect points of the pipe section;
when the number of the defect points is more than or equal to 3, adopting integral repair; when the number of the defect points is less than 3, adopting local repair;
step 5: counting the lengths of the excavated and repaired pipe sections and the number of defect points of the locally repaired pipe sections;
step 6: calculating the total repairing cost of the pipe section;
step 7: if the total cost of pipe segment repair does not exceed the total investment, all the pipe segments needing repair are transformed, an engineering quantity table is generated, and the process is finished;
step 8: if the total cost of pipe segment repair exceeds the total investment, carrying out dynamic planning calculation on the total cost data of pipe segment repair, analyzing a scheme for maximizing the number of repaired defect points under the limit investment, and generating a pipe segment statistical table to be repaired;
step 9: rechecking a pipe section statistical table to be repaired, importing auxiliary design software such as GIS or CAD and the like, combining the rationality of an actual rechecking repair scheme by a designer, and if the repair scheme is reasonable, generating an engineering quantity table and ending; if the repair scheme is not reasonable, returning to the step 8, and adjusting in the pipe segment statistical table to be repaired.
In the step 8, the process of the dynamic programming calculation is as follows:
counting the number of pipe sections as n by using a pipeline between two adjacent inspection wells, wherein the number of defect points to be repaired of each pipe section is represented by mi; the normalized repair total cost of each pipe section is expressed by wi, and if the total investment which can be input is w, the maximum number of repair defect points is required to be considered under the total investment limit;
let G [ i, w ] denote that at the total investment w, repairing i pipe sections can achieve the highest number of repairing defect points, solving by the following equation:
in the step 6, the calculation formula for calculating the total cost of repairing the pipe section is as follows:
the formula for overall repair or excavation repair is as follows:
wi＝C 1 *Li
the local repair formula is as follows:
wi＝C 2 *mi
wherein: wi-total cost of pipe section repair; c (C) 1 -an overall repair or excavation repair unit price corresponding to the pipe diameter of the pipe section; c (C) 2 -a local repair unit price corresponding to the pipe diameter of the pipe section;
li-length of pipe section; mi-number of defective spots.
The pipe section data at least comprises a number, a pipe diameter, an elevation, a length and a starting and ending node number.
The node data at least comprises a number, an elevation and a coordinate.
The defect types include 10 types of cracking, heave, deformation, dislocation, disjointing, corrosion, leakage, hidden connection of branch pipes, penetration of foreign matters and falling of interface materials.
The defect levels include level 1, level 2, level 3, and level 4.
All defect types with four grades, deformation with three grades, fluctuation defect types and branch pipe hidden connection defect types with all grades are set as serious structural defects, and other defect types are not serious structural defects.
Dynamic planning (Dynamic Programming, DP) is a branch of operations research and is the process of solving the optimization of decision-making processes. The application of dynamic programming achieves significant effects in knapsack problems, resource allocation problems, shortest path problems, and complex system reliability problems, among others. Dynamic planning algorithms are typically used to solve problems with certain optimal properties. In such a problem, there may be many possible solutions. Each solution corresponds to a value, and the solution with the optimal value is found. The basic idea is also to decompose the problem to be solved into a number of sub-problems, solve the sub-problems first, and then obtain the solution of the original problem from the solutions of the sub-problems. A table may be used to record the answers to all of the solved sub-questions. Regardless of whether the sub-problem is used later or not, the result is filled into the table as long as it is calculated. This is the basic idea of dynamic planning.
The beneficial effects of the invention are as follows:
the invention establishes an automatic statistical analysis method for the water drainage pipe network slicing defects by taking the topological relation data and the defect data information of the water drainage pipe network as the basis and utilizing a dynamic planning algorithm as a framework. Defects of the same pipe section are used as identification features, repair costs of different pipe sections are used as a discrimination basis, the number of repair points of the defects is used as a discrimination condition, an optimal strategy for repairing the defective pipeline under the limited investment condition is automatically analyzed, a severe defect area is rapidly and accurately identified, and repair strategy suggestions and engineering stage suggestions under different investment scales are rapidly proposed. The invention can improve the time of feasibility research, scheme planning, preliminary design stage scale demonstration, engineering stage planning and general estimation by more than 50 times, saves a great amount of mechanical labor time and improves the working efficiency.
Drawings
FIG. 1 is a general flow chart of the operation of the present invention;
FIG. 2 is a flow chart for screening and determining pipe network defects;
FIG. 3 is a flow chart of a dynamic programming algorithm.
Detailed Description
The invention will now be described in further detail with reference to the drawings and specific examples, which are given for clarity of understanding and are not to be construed as limiting the invention.
As shown in fig. 1-3, the present invention includes the steps of:
step 1: acquiring topology relation data of a drainage pipe network, wherein the topology relation data comprises pipe section data and node data;
step 2: obtaining defect data information of a drainage pipe network, wherein the defect data information comprises pipe section numbers, defect point numbers, defect types, defect grades and defect densities; the specific examples are shown in Table 1:
TABLE 1 defect types and defect grades
Step 3: according to requirements of project requirements of "town drainage pipeline trenchless repair and update engineering Specification (CJJ 210-2014) and" town drainage pipeline detection and evaluation Specification (CJJ 181-2012) ", determining defect types and defect grades of a drainage pipe network to be repaired, wherein the defect types and the defect grades are as shown in Table 2:
TABLE 2 statistical table for defect repair
Step 4: dividing the type of the defect and the like to be repaired into a serious structural defect and a non-serious structural defect by taking the pipe section as a unit, and excavating and repairing the pipe section with the serious structural defect; for a pipe section with a less severe structural defect, calculating the defect density of the pipe section;
when the defect density is more than or equal to 0.5, adopting integral repair; when the defect density is less than or equal to 0.1, local repair is adopted; when the defect density is more than 0.1 and less than 0.5, judging the number of defect points of the pipe section;
when the number of the defect points is more than or equal to 3, adopting integral repair; when the number of the defect points is less than 3, adopting local repair;
step 5: counting the lengths of the excavated and repaired pipe sections and the number of defect points of the locally repaired pipe sections;
step 6: calculating the total repairing cost of the pipe section;
step 7: if the total cost of pipe segment repair does not exceed the total investment, all the pipe segments needing repair are transformed, an engineering quantity table is generated, and the process is finished;
step 8: if the total cost of pipe segment repair exceeds the total investment, carrying out dynamic planning calculation on the total cost data of pipe segment repair, analyzing a scheme for maximizing the number of repaired defect points under the limit investment, and generating a pipe segment statistical table to be repaired;
step 9: rechecking a pipe section statistical table to be repaired, importing auxiliary design software such as GIS or CAD and the like, combining the rationality of an actual rechecking repair scheme by a designer, and if the repair scheme is reasonable, generating an engineering quantity table and ending; if the repair scheme is not reasonable, returning to the step 8, and adjusting in the pipe segment statistical table to be repaired.
In the step 8, the dynamic programming calculation process is as follows:
counting the number of pipe sections as n by using a pipeline between two adjacent inspection wells, wherein the number of defect points to be repaired of each pipe section is represented by mi; the normalized repair total cost of each pipe section is expressed by wi, and if the total investment which can be input is w, the maximum number of repair defect points is required to be considered under the total investment limit;
let G [ i, w ] denote that at the total investment w, repairing i pipe sections can achieve the highest number of repairing defect points, solving by the following equation:
in the step 6, the calculation formula for calculating the total cost of repairing the pipe section is as follows:
the formula for overall repair or excavation repair is as follows:
wi＝C 1 *Li
the local repair formula is as follows:
wi＝C 2 *mi
wherein: wi-total cost of pipe section repair; c (C) 1 -an overall repair or excavation repair unit price corresponding to the pipe diameter of the pipe section; c (C) 2 -a local repair unit price corresponding to the pipe diameter of the pipe section;
li-length of pipe section; mi-number of defective spots.
The unit price of the pipeline repair can be calculated according to projects and regions, and can also be estimated according to the following table 3.
TABLE 3 repair unit price table for different pipe diameters (unit: yuan/m)
| Pipe diameter | D400 | D500 | D600 | D800 | D1000 | D1200 | D1500 |
| Integral repair | 6000 | 6200 | 6500 | 6700 | 7200 | 7500 | 8500 |
| Local repair | 6000 | 6200 | 6500 | 6700 | 7200 | 7500 | 8500 |
| Excavation repair | 5500 | 5700 | 6700 | 7000 | 7100 | 7700 | 8000 |
The pipe section data at least comprises a number, a pipe diameter, an elevation, a length and a starting and ending node number.
The node data at least comprises a number, an elevation and a coordinate.
The defect types include 10 types of cracking, heave, deformation, dislocation, disjointing, corrosion, leakage, hidden connection of branch pipes, penetration of foreign matters and falling of joint materials.
In the present embodiment, all defect types with four levels, deformation with three levels, undulating defect types, and branch pipe blind joint defect types with all levels are set as serious structural defects, and other defect types are not serious structural defects.
What is not described in detail in this specification is prior art known to those skilled in the art.
Claims (8)
1. A drainage pipe network defect repair design and scale demonstration method based on dynamic planning is characterized in that: the method comprises the following steps:
step 1: acquiring topology relation data of a drainage pipe network, wherein the topology relation data comprises pipe section data and node data;
step 2: obtaining defect data information of a drainage pipe network, wherein the defect data information comprises pipe section numbers, defect point numbers, defect types, defect grades and defect densities;
step 3: determining the defect type and defect grade of the drain pipe network to be repaired;
step 4: dividing the type of the defect and the like to be repaired into a serious structural defect and a non-serious structural defect by taking the pipe section as a unit, and excavating and repairing the pipe section with the serious structural defect; for a pipe section with a less severe structural defect, calculating the defect density of the pipe section;
when the defect density is more than or equal to 0.5, adopting integral repair; when the defect density is less than or equal to 0.1, local repair is adopted; when the defect density is more than 0.1 and less than 0.5, judging the number of defect points of the pipe section;
when the number of the defect points is more than or equal to 3, adopting integral repair; when the number of the defect points is less than 3, adopting local repair;
step 5: counting the lengths of the excavated and repaired pipe sections and the number of defect points of the locally repaired pipe sections;
step 6: calculating the total repairing cost of the pipe section;
step 7: if the total cost of pipe segment repair does not exceed the total investment, all the pipe segments needing repair are transformed, an engineering quantity table is generated, and the process is finished;
step 8: if the total cost of pipe segment repair exceeds the total investment, carrying out dynamic planning calculation on the total cost data of pipe segment repair, analyzing a scheme for maximizing the number of repaired defect points under the limit investment, and generating a pipe segment statistical table to be repaired;
step 9: rechecking the pipe section statistical table to be repaired, if the repairing scheme is reasonable, generating an engineering quantity table, and ending; if the repair scheme is not reasonable, returning to the step 8, and adjusting in the pipe segment statistical table to be repaired.
2. The drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 1, wherein the method is characterized in that: in the step 8, the process of the dynamic programming calculation is as follows:
counting the number of pipe sections as n by using a pipeline between two adjacent inspection wells, wherein the number of defect points to be repaired of each pipe section is represented by mi; the normalized repair total cost of each pipe section is expressed by wi, and if the total investment which can be input is w, the maximum number of repair defect points is required to be considered under the total investment limit;
let G [ i, w ] denote that at the total investment w, repairing i pipe sections can achieve the highest number of repairing defect points, solving by the following equation:
3. the drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 1, wherein the method is characterized in that: in the step 6, the calculation formula for calculating the total cost of repairing the pipe section is as follows:
the formula for overall repair or excavation repair is as follows:
wi＝C 1 *Li
the local repair formula is as follows:
wi＝C 2 *mi
wherein: wi-total cost of pipe section repair; c (C) 1 -an overall repair or excavation repair unit price corresponding to the pipe diameter of the pipe section; c (C) 2 -a local repair unit price corresponding to the pipe diameter of the pipe section;
li-length of pipe section; mi-number of defective spots.
4. The drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 1, wherein the method is characterized in that: the pipe section data at least comprises a number, a pipe diameter, an elevation, a length and a starting and ending node number.
5. The drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 1, wherein the method is characterized in that: the node data at least comprises a number, an elevation and a coordinate.
6. The drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 1, wherein the method is characterized in that: the defect types include 10 types of cracking, heave, deformation, dislocation, disjointing, corrosion, leakage, hidden connection of branch pipes, penetration of foreign matters and falling of interface materials.
7. The drainage pipe network defect repair design and scale demonstration method based on dynamic programming as claimed in claim 6, wherein the method is characterized in that: the defect levels include level 1, level 2, level 3, and level 4.
8. The dynamic programming-based drainage pipe network defect repair design and scale demonstration method as claimed in claim 7, wherein the method is characterized in that: all defect types with four grades, deformation with three grades, fluctuation defect types and branch pipe hidden connection defect types with all grades are set as serious structural defects, and other defect types are not serious structural defects.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310535932.5A CN116756885B (en) | 2023-05-12 | 2023-05-12 | Drainage pipe network defect repair design and scale demonstration method based on dynamic programming |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310535932.5A CN116756885B (en) | 2023-05-12 | 2023-05-12 | Drainage pipe network defect repair design and scale demonstration method based on dynamic programming |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116756885A CN116756885A (en) | 2023-09-15 |
| CN116756885B true CN116756885B (en) | 2023-12-05 |
Family
ID=87952238
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310535932.5A Active CN116756885B (en) | 2023-05-12 | 2023-05-12 | Drainage pipe network defect repair design and scale demonstration method based on dynamic programming |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116756885B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101591271B1 (en) * | 2015-03-13 | 2016-02-04 | 한국건설기술연구원 | Decision-making system for prioritizing sewer rehabilitation, and method for the same |
| CN115841466A (en) * | 2022-11-30 | 2023-03-24 | 西安理工大学 | Automatic quantitative assessment method for defects of drainage pipe network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102021203075A1 (en) * | 2021-03-26 | 2022-09-29 | Carl Zeiss Smt Gmbh | METHOD, DEVICE AND COMPUTER PROGRAM FOR REPAIRING A MASK DEFECT |
-
2023
- 2023-05-12 CN CN202310535932.5A patent/CN116756885B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101591271B1 (en) * | 2015-03-13 | 2016-02-04 | 한국건설기술연구원 | Decision-making system for prioritizing sewer rehabilitation, and method for the same |
| CN115841466A (en) * | 2022-11-30 | 2023-03-24 | 西安理工大学 | Automatic quantitative assessment method for defects of drainage pipe network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116756885A (en) | 2023-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107563019B (en) | Urban distributed hydrological model digitization method for complex underlying surface | |
| CN112990739B (en) | Phosphorite area water environment risk assessment method based on multi-medium pollution characteristic identification | |
| CN113803646B (en) | Drainage pipe network monitoring and point distribution method suitable for defective pipeline inspection | |
| CN115435245A (en) | Method for quickly identifying defects of high-water-level operation pipeline | |
| Kruszyński et al. | Computer modeling of water supply and sewerage networks as a tool in an integrated water and wastewater management system in municipal enterprises | |
| CN116756885B (en) | Drainage pipe network defect repair design and scale demonstration method based on dynamic programming | |
| CN116738632A (en) | Drainage pipe network defect repair design and scale demonstration method based on greedy algorithm | |
| CN115618769A (en) | Drainage system evaluation method and system based on hydraulic model | |
| CN115356260A (en) | High-water-level running pipeline health condition efficient detection method | |
| CN113177285B (en) | Urban drainage system topological relation problem identification and correction method based on drainage model | |
| CN116109174A (en) | Intelligent water affair informatization processing platform | |
| CN116126963A (en) | Inflow infiltration diagnosis method for nonlinear multi-source heterogeneous drainage model | |
| CN112097125B (en) | Water supply pipe network pipe burst detection and positioning method based on self-adaptive checking | |
| CN115270372A (en) | Drainage pipe network siltation judgment method based on depth sequence model | |
| CN114818221A (en) | Pipe network operation situation analysis method based on pipe network hydrodynamic model and data driving model | |
| Kruszyński et al. | Application and digital implementation GIS data to computer modeling of the sanitary sewage network in Podlaskie voivodship | |
| Davies et al. | A statistical investigation of structurally unsound sewers | |
| CN117634891A (en) | Automatic evaluation method and system for invasion risk of external water of drainage pipe network | |
| CN117407479A (en) | Automatic and rapid dividing method for urban drain pipe network catchment area based on GIS | |
| CN117688790B (en) | Waterlogging flooding point pre-judging method based on multidimensional real-time monitoring and big data analysis | |
| Atambo et al. | Prediction model development for sanitary sewer pipes’ condition assessment using logistic regression and neural networks | |
| Adel et al. | Productivity analysis of horizontal directional drilling | |
| CN114357774A (en) | Early rainwater quantitative identification method and system based on rainfall recurrence period | |
| Shiu et al. | A Modified Hydrologic Model Algorithm Based on Integrating Graph Theory and GIS Database. Water 2022, 14, 3000 | |
| CN116305687A (en) | Calculation method for key nodes of drainage pipe network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |