Pipe network GIS (Geographic Information System)

Abstract

The invention relates to the field of pipe network GIS geographic information systems, in particular to a pipe network GIS geographic information system. By dynamically correcting the maximum permissible length of pipe sections, automatically screening compliant pipe sections and marking abnormal types, engineering potential safety hazards caused by a traditional fixed threshold value are solved, a water supply communication network is constructed based on a graph traversal algorithm, isolation sections are intelligently recognized, and repair suggestions containing newly-added node coordinates and the number are generated. The method comprises the following steps of: determining the total coverage water supply of mountainous areas or dispersed villages, quantifying the influence of pressure gradient and pipe diameter parameters on path priorities by adopting a multi-objective optimization mechanism, dynamically adjusting a weight coefficient to balance water pressure guarantee and pipe cost, and generating a candidate path pool covering all water consumption points through a topological model. Head loss is verified in real time, and a low-pressure infeasible scheme is eliminated; the problems that an existing pipe network geographic information system is low in efficiency in water supply branch planning, and cost, water pressure and isolation zone coverage are difficult to consider at the same time are solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of pipe network GIS geographic information system, in particular to a pipe network GIS geographic information system. BACKGROUND

[0002] The traditional pipe network geographic information system (GIS) relies on static data and fixed rules in water supply branch planning, and it is difficult to dynamically adapt to complex terrain, pipe material characteristics and water point distribution and other actual constraints. Especially when dealing with water supply demand in natural villages or mountainous areas with island phenomenon, repeated path calculation often leads to low planning efficiency and high cost. In the prior art, pipe spacing screening is usually based on a fixed length threshold, ignoring the dynamic influence of pipe material pressure capacity and terrain slope on the maximum allowable pipe length, and lacking intelligent verification mechanism for pipe network connectivity, resulting in problems such as insufficient water pressure or isolated sections that cannot be covered in the planning scheme. SUMMARY

[0003] In view of the deficiencies of the prior art, the present application provides a pipe network GIS geographic information system, which solves the problem of low efficiency of the existing pipe network geographic information system in water supply branch planning, and the problem of difficulty in considering cost, water pressure and isolated section coverage.

[0004] To achieve the above purpose, the present application provides the following technical scheme: a pipe network GIS geographic information system, the system comprising:

[0005] A data acquisition module is configured to acquire the inlet and outlet, i.e. end points, of the water supply branch connected by the water supply system, and a plurality of water demand points to be covered by the water supply branch;

[0006] A node setting module is configured to set a plurality of control nodes that the water supply branch can pass through, and to encode the positions of the end points, control nodes and water points;

[0007] A pipe spacing calculation module is configured to calculate the pipe spacing between any two control nodes, end points and control nodes, end points and points, points and points, and points and control nodes, and to generate a candidate spacing set;

[0008] A compliant spacing screening module is configured to set the maximum pipe laying length, screen the spacing data in the candidate spacing set that meets the condition that the pipe spacing is less than or equal to the maximum pipe laying length, and generate a compliant spacing set;

[0009] a connectivity verification module, which verifies the pipe network connectivity between each water point and the two end points based on the set of compliant distances, and outputs a prompt of a planned water supply branch if the verification is passed, or outputs a suggestion of a control node to be added if the verification is not passed, and enters the node setting module;

[0010] a scheme output module, which is used to calculate an optimal water supply path connecting the two end points and each water point according to the set of compliant distances and by using a dynamic flow distribution algorithm after the pipe network connectivity verification is passed, and outputs a final planning scheme.

[0011] Preferably, the specific steps of the compliant distance screening module for generating the set of compliant distances are as follows:

[0012] S41. Calculate the corrected maximum allowable pipe segment length according to the pipe material type, pressure-bearing level and terrain slope of the laying area of the water supply branch;

[0013] S42. Set the set of compliant distances, and iterate through each pipe line distance in the set of candidate distances, if the pipe line distance is less than or equal to the corrected maximum allowable pipe segment length, and the slope of the pipe corresponding to the pipe line distance is less than or equal to the maximum allowable slope of the pipe material, then the pipe line distance is included in the set of compliant distances;

[0014] S43. Mark the pipe line distances not included in the set of compliant distances in the set of candidate distances as abnormal pipes, and output the abnormal type.

[0015] Preferably, the specific steps of the connectivity verification module for verifying the pipe network connectivity between each water point and the two end points based on the set of compliant distances are as follows:

[0016] S51. Take the water inlet end of the water supply branch as the starting point, and iterate through all connectable pipe line nodes and water points based on the set of compliant distances, and construct a set of water supply connectivity regions W;

[0017] S52. Verify whether the water outlet end and each water point belong to the set W;

[0018] If yes, it is determined that the pipe network connectivity is passed;

[0019] If there is a water point or a water outlet end not belonging to the set W, it is marked as an isolated section and a set W' is generated;

[0020] S53. For each isolated section in the set W', calculate the minimum distance between it and the set of water supply connectivity regions W, and generate an expanded suggestion region in combination with the pipe material extension coefficient;

[0021] S54. Output the coordinate range of the expanded suggestion region and the number of control nodes to be newly added.

[0022] As preferred, the specific steps of the scheme output module outputting the final planning scheme are as follows:

[0023] S61, initialize flow weight parameters, set total flow Q total , pressure attenuation coefficient a, pipe segment priority factor b, maximum iteration number T max and the number of path generation per iteration N path ;

[0024] S62, starting from the water inlet end, generate a candidate path set based on the compliance distance set, and calculate the flow distribution weight W of each pipe segment i,j ;

[0025] S63, update the flow distribution weight of each pipe segment after each iteration;

[0026] S64, repeat the iteration until the maximum iteration number is reached, and then output the path with the highest flow distribution weight as the optimal water supply path.

[0027] As preferred, in step S62, the specific steps of generating a candidate path set based on the compliance distance set are as follows:

[0028] S621, taking the endpoints of the pipe segments in the compliance distance set as vertices and the compliance pipe segments as edges, construct an undirected graph;

[0029] S622, taking the water inlet end and the water outlet end as the starting point and the ending point of the candidate path respectively, traverse the undirected graph to generate several candidate paths covering all water points, and the total head loss of the candidate path satisfies:

[0030]

[0031] In the above formula, H inlet represents the initial pressure head of the water inlet end, provided by the water pump or high-level tank, f i，j represents the Darcy resistance coefficient of pipe segment (i, j), L i，j represents the actual length of pipe segment (i, j), g is the acceleration of gravity, and ΔZ i，j represents the elevation difference of pipe segment (i, j), H required represents the minimum service water head required by the user;

[0032] S623, calculate the comprehensive weight of each candidate path; the calculation formula of the comprehensive weight is:

[0033]

[0034] In the above formula, W path，k represents the comprehensive weight of the kth path, N path represents the number of candidate paths generated in each iteration, and Path krepresents the kth candidate water supply path, which is a complete water supply route from the water inlet end to the water outlet end;

[0035] S624, screening a number of candidate paths with the largest comprehensive weight values, and establishing a candidate path set.

[0036] As preferred, in step S41, the calculation formula of the corrected maximum allowable pipe segment length is:

[0037]

[0038] In the above formula, L' limit represents the corrected maximum allowable pipe segment length, L limit represents the maximum allowable pipe segment length before correction, E material represents the elastic modulus of the reference pipe material, θ represents the terrain slope angle of the pipe segment laying area, S max represents the maximum allowable slope of the pipe material.

[0039] As preferred, in step S62, the calculation formula of the flow distribution weight W i,j is as follows:

[0040]

[0041] wherein,

[0042]

[0043] In the above formula, P i,j represents the pressure gradient of nodes i to j, ΔH i，j represents the water head difference of nodes i to j, L i，j represents the length of the pipe segment of nodes i to j, D i,j represents the equivalent diameter of the pipe segment of nodes i to j.

[0044] As preferred, in step S63, the update formula of the flow distribution weight is as follows:

[0045]

[0046] In the above formula, and respectively represent the flow distribution weight of pipe segment (i, j) at the t+1th and tth iterations, ρ represents a history retention factor, 0 < ρ < 1, Q k represents the distribution flow of the kth path, is an indicator function, which is 0 if the kth path contains pipe segment (i, j), and 1 otherwise, W path，k represents the comprehensive weight of the kth path, N path represents the number of candidate paths generated in each iteration, Pathk represents the kth candidate water supply path, which is a complete water supply route from the water inlet end to the water outlet end.

[0047] Compared with the prior art, the present application provides a pipe network GIS geographic information system, which has the following

[0048] Advantages:

[0049] 1. The present application dynamically adjusts the maximum allowable pipe segment length according to the pipe material type, pressure capacity and terrain slope of the laying area. High-strength pipe materials (such as steel pipes) can extend the laying distance to reduce costs, and steep slope areas automatically shorten the length to avoid stress concentration. This breaks through the limitations of traditional fixed thresholds, scientifically balances material performance and terrain influence, reduces the risk of pipe bursting or rupture, and avoids the addition of redundant nodes. It is especially suitable for complex terrain scenarios such as mountainous areas and villages, and takes into account safety and construction efficiency.

[0050] 2. The present application automatically constructs a water supply connected network based on compliant pipe segment data, real-time checks the hydraulic accessibility of all water points and endpoints, quickly locates isolated sections formed due to length or slope exceeding limits, calculates the minimum connection distance based on pipe material characteristics, outputs the coordinate range and number of newly added control nodes, solves the problem of low efficiency and easy omission of traditional manual inspection, significantly reduces the rework rate, and ensures full coverage of water supply network in scattered villages or mountainous areas.

[0051] 3. The present application quantifies the water flow driving force by the ratio of pressure difference to pipe segment length, combines pipe diameter parameters to represent flow resistance, dynamically adjusts pressure weight and pipe diameter weight coefficients, prioritizes high pressure difference paths to ensure end water pressure, and optimizes large pipe diameter paths to reduce pumping energy consumption, achieving multi-objective collaborative optimization of water pressure balance, pipe material cost and path efficiency, adapting to different engineering scene needs such as heavy water pressure in mountainous areas and economy in plains.

[0052] 4. The present application constructs compliant pipe segments as a topological network model, forces the path to cover all water points, real-time checks whether the total head loss of the path meets the minimum service water pressure requirement, automatically eliminates low-pressure infeasible solutions, and selects high-quality paths through comprehensive weight ordering (weight determined by pressure and pipe diameter parameters), improving the overall solution quality and supporting efficient planning of large-scale complex pipe networks.

[0053] 5. The present application uses an update mechanism that fuses historical weight retention and current flow allocation results, gradually increases the pipe segment weight for high frequency use to strengthen high-quality paths, and decays the pipe segment weight for low frequency use to eliminate inefficient solutions. Combined with the control of maximum iteration number to control the consumption of calculation resources, it ensures the balance between exploring new paths and utilizing historical experience, breaks through the local optimal limit of traditional static planning, and significantly improves the reliability of water supply solutions in mountainous areas or high-density urban areas. BRIEF DESCRIPTION OF DRAWINGS

[0054] The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiments of the application and together with the description serve to explain the application. In the drawings:

[0055] Figure 1 It is a structural block diagram of the pipe network GIS geographic information system.

[0056] In the figure: 1, data acquisition module; 2, node setting module; 3, pipeline spacing calculation module; 4, compliance spacing screening module; 5, connectivity verification module; 6, scheme output module. DETAILED DESCRIPTION

[0057] In order to make the above objectives, features and advantages of the present application more apparent, further detailed description of the present application will be given below with reference to the accompanying drawings and specific embodiments. The realization process of how to apply technical means to solve technical problems and achieve technical effects of the present application can be fully understood and implemented.

[0058] Those of ordinary skill in the art can understand that all or part of the steps of the following embodiments can be completed by programs instructing relevant hardware, therefore, the present application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt a computer program product in the form of being implemented on one or more computer usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program codes.

[0059] In order to solve the problem that the existing pipe network geographic information system has low efficiency in the planning of water supply branches and is difficult to balance the cost, water pressure and isolation section coverage, the present application provides a pipe network GIS geographic information system, which integrates multi-parameter dynamic correction, intelligent connectivity verification and multi-target flow distribution algorithm to improve the accuracy and engineering feasibility of water supply branch planning. The system comprises:

[0060] The data acquisition module 1 for acquiring data of water inlet ends and water outlet ends, i.e. end points, of a water supply branch to be connected and a plurality of water demand points covered by the water supply branch, supports multi-source data access such as GPS positioning and pipe network database, ensures that planning is based on real scenarios, and avoids manual input errors; the node setting module 2 for setting a plurality of control nodes through which the water supply branch can pass, and positionally encodes the end points, control nodes and water demand points, allows planning personnel to set control nodes such as valve wells and pressure stations through which the water supply branch can pass, and uniquely encodes all nodes, end points and water demand points, and through flexible configuration of node positions, adapts to complex terrain restrictions such as bypassing obstacles or farmland, and improves the feasibility of the planning scheme; the pipe spacing calculation module 3 for calculating the pipe spacing between any two control nodes, end points and control nodes, end points and points, points and points, and points and control nodes, and generating a candidate spacing set; the compliance spacing screening module 4 for setting the maximum pipe laying length, screening spacing data in the candidate spacing set that meets the condition that the pipe spacing is less than or equal to the maximum pipe laying length, to generate a compliance spacing set, thereby breaking through the limitations of traditional fixed length thresholds, combining with engineering practical constraints such as pipe material pressure bearing and slope safety, and avoiding the risk of pipe explosion caused by over-limit laying; the connectivity verification module 5 for verifying the pipe network connectivity between each water demand point and the two end points based on the compliance spacing set, if the verification is passed, outputting a prompt that the water supply branch can be planned, if the verification is not passed, outputting a suggestion that a control node needs to be added, and entering the node setting module 2, verifying the hydraulic connectivity of all water demand points and end points through a graph traversal algorithm, identifying isolated sections and generating repair suggestions, intelligently identifying island phenomena, providing quantitative suggestions for adding nodes or adjusting paths, and significantly reducing planning rework rate; the scheme output module 6 for, after the pipe network connectivity verification is passed, calculating the optimal water supply path connecting the two end points and each water demand point according to the compliance spacing set and using a dynamic flow distribution algorithm, and outputting the final planning scheme, using the dynamic flow distribution algorithm (combined with pressure gradient and pipe diameter priority factor) to iteratively calculate the optimal water supply path, output the final planning scheme, and multi-objective optimization such as water pressure balance, pipe material cost and path length, to ensure that the scheme takes into account economy and reliability.

[0061] The specific steps of the compliance spacing screening module 4 for generating the compliance spacing set are as follows:

[0062] S41, according to the pipe material type, pressure rating and topographic slope of the laying area of the water supply branch, calculate the corrected maximum allowable pipe segment length; the calculation formula of the corrected maximum allowable pipe segment length is:

[0063]

[0064] In the above formula, L' limit represents the corrected maximum allowable pipe segment length, L limitIndicates the maximum allowable pipe length before correction, E material represents the elastic modulus of the reference pipe, θ represents the terrain slope angle of the pipe laying area, S max Indicates the maximum allowable slope of the pipe. Longer pipe sections are allowed for high elastic modulus pipes (such as steel pipes), while shorter lengths are allowed for low elastic modulus pipes (such as PVC) to avoid material deformation risks. In steep slope areas, pipe sections need to be shortened to prevent stress concentration in the pipe sections due to gravity. This breaks through the limitations of traditional fixed length thresholds, scientifically reflects the impact of pipe performance and terrain, and reduces the risk of pipe bursts or fractures. Quantified formulas ensure that pipe section lengths are within the safe range of materials and slopes, reducing engineering risks.

[0065] S42. Set a compliant spacing set, traverse each pipeline spacing in the candidate spacing set, and if the pipeline spacing is less than or equal to the corrected maximum allowable pipe section length, and the slope of the pipeline corresponding to the pipeline spacing is less than or equal to the maximum slope allowed by the pipe, then include the pipeline spacing in the compliant spacing set. At the same time, verify the length and slope to avoid omissions caused by single condition screening, such as a long flat pipe section being compliant, but a short steep slope pipe section being non-compliant.

[0066] S43. Mark the pipeline spacing in the candidate spacing set that is not included in the compliant spacing set as abnormal pipelines, and output the abnormality type, that is, mark which of the following two conditions the pipeline spacing does not meet. The two conditions are: the pipeline spacing is less than or equal to the corrected maximum allowable pipe section length, and the slope of the pipeline corresponding to the pipeline spacing is less than or equal to the maximum slope allowed by the pipe, and thus marked as length exceeding the limit and slope exceeding the limit respectively. By clarifying the type of exceeding the limit, length or slope, specific repair directions are provided to planners, such as adding nodes or replacing pipes.

[0067] Through dynamic correction, multi-condition screening and intelligent anomaly marking, the accuracy, safety and efficiency of pipeline network planning have been significantly improved, solving the problem of insufficient adaptability of traditional GIS systems in complex engineering scenarios.

[0068] The specific steps of the connectivity verification module 5 to verify the pipe network connectivity between each water point and the two end points based on the compliance distance set are as follows:

[0069] S51. Starting from the water inlet of the water supply branch, traverse all connected pipeline nodes and water use points based on the compliance spacing set to construct a water supply connection area set W. For example, through breadth-first search (BFS) or similar algorithms, dynamically generate the connection area set W that can be covered by the current compliance pipe section, and reflect the connection status of the newly added nodes or pipe sections after adjustment in real time, thereby improving planning flexibility.

[0070] S52, verify whether the water outlet and each water point belong to the set W;

[0071] If yes, determine that the pipe network is connected;

[0072] If there is a water point or outlet that does not belong to the set W, mark it as an isolated section and generate a set W', and determine the location and number of isolated sections to avoid the water supply blind area caused by missed detection in the traditional method.

[0073] S53, for each isolated section in the set W', calculate the minimum distance between it and the set W of water supply connected regions, generate an expanded recommended area by combining the pipe extension coefficient, and determine the location and number of nodes to be added through the minimum distance calculation, such as adding nodes when the distance exceeds the pipe extension coefficient, and recommend the minimum number of added nodes based on the characteristics of the pipe material to avoid redundant construction and reduce engineering cost.

[0074] S54, output the coordinate range of the expanded recommended area and the number of required additional control nodes, and output the coordinate range of the expanded recommended area and the number of required additional control nodes to the planning interface or report file to guide manual survey or automatic adjustment.

[0075] The specific steps of the scheme output module 6 to output the final planning scheme are as follows:

[0076] S61, initialize the flow weight parameter, set the total flow Q total , the pressure attenuation coefficient a, the pipe segment priority factor b, the maximum number of iterations T max and the number of path generation per iteration N path , adjust the pressure

[0077] attenuation coefficient a (control pressure gradient influence), pipe segment priority factor b (control pipe diameter influence), adapt to different engineering priority requirements, such as heavy pressure in mountainous areas and economy in plains.

[0078] S62, starting from the inlet, generate a candidate path set based on the compliance distance set, and calculate the flow distribution weight W i,j of each pipe segment; the calculation formula of the flow distribution weight W i,j is as follows:

[0079]

[0080] wherein,

[0081]

[0082] In the above formula, P i,j represents the pressure gradient from node i to j, AH i，j represents the head difference from node i to node j, L i，j represents the length of the pipe segment from node i to j, and D i,jThe equivalent diameter of the pipe section from node i to node j represents the equivalent diameter of the pipe section from node i to node j, and the weight formula integrates the pressure gradient (driving force) and the pipe diameter (resistance) to quantify the path priority, ensure that the high pressure difference and large pipe diameter path is preferentially allocated to the flow, filter the infeasible path with the compliance spacing set, and reduce the invalid calculation.

[0083] The specific steps for generating the candidate path set based on the compliance spacing set are:

[0084] S621, the end points of the pipe sections in the compliance spacing set are taken as vertices, and the compliance pipe sections are taken as edges to construct an undirected graph, and the physical pipe network is converted into a graph theory model, which is convenient for applying efficient path search algorithms.

[0085] S622, the inlet end and the outlet end are taken as the starting point and the terminal point of the candidate path respectively, and the undirected graph is traversed to generate a plurality of candidate paths covering all water points, and the total water head loss of the candidate path satisfies:

[0086]

[0087] In the above formula, H inlet represents the initial pressure head of the inlet end, which is provided by the water pump or the high-level water tank, f i，j represents the Darcy friction factor of the pipe section (i, j), L i，j represents the actual length of the pipe section (i, j), g is the acceleration of gravity, and ΔZ i，j represents the elevation difference of the pipe section (i, j), H required represents the minimum service water head required by the user, which is removed by the formula, and the path covers all water points, avoids missing allocation, and ensures the integrity of water supply service.

[0088] S623, the comprehensive weight of each candidate path is calculated; the calculation formula of the comprehensive weight is:

[0089]

[0090] In the above formula, W path，k represents the comprehensive weight of the kth path, N path represents the number of candidate paths generated in each iteration, Path k represents the kth candidate water supply path, which is a complete water supply route from the inlet end to the outlet end, and the comprehensive pressure gradient (hydraulic efficiency) and the pipe diameter (economy) are used to scientifically quantify the path priority, and any low-weight pipe section in the path significantly reduces the overall score, avoids the "short board effect", and ensures the balanced quality of the path.

[0091] S624, a plurality of candidate paths with the largest comprehensive weight value are screened out, and a candidate path set is established, and the optimal path is quickly screened out through sorting, and the subsequent iteration calculation amount is reduced.

[0092] S63, update the flow distribution weight of each pipe segment after each iteration; the update formula of the flow distribution weight is as follows:

[0093]

[0094] In the above formula, and respectively represent the flow distribution weight of pipe segment (i, j) at the t+1th and tth iteration, ρ represents a historical retention factor, 0 < ρ < 1, Q k represents the distribution flow of the kth path, is an indicator function, and if the kth path contains pipe segment (i, j), the value is 0, otherwise, it is 1, W path，k represents the comprehensive weight of the kth path, N path represents the number of candidate paths generated in each iteration, Path k represents the kth candidate water supply path, which is a complete water supply route from the water inlet end to the water outlet end, the high-frequency use path is gradually strengthened through weight iteration to approach the global optimal solution, and the retention factor ρ prevents the weight from mutating and enhances the stability of the algorithm.

[0095] S64, repeat the iteration until the maximum number of iterations is reached, and then output the path with the highest flow distribution weight as the optimal water supply path, which ensures that the algorithm fully explores the path space and avoids missing high-quality schemes through multiple iterations, and the maximum number of iterations is set to balance the calculation resource limitation and the result convergence requirement.

[0096] It should be noted that the system provided in the above embodiments, in realizing its functions, is only exemplified by the above division of each functional module, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the above described functions. In addition, the system and method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process is detailed in the method embodiments, which will not be repeated here.

[0097] The application provides an intelligent pipe network GIS geographic information system, which solves the engineering safety hazards caused by the traditional fixed threshold by dynamically correcting the maximum allowable length of the pipe section (combining the elastic modulus of the pipe material and the terrain slope), automatically screening the compliant pipe section and marking the abnormal type; based on the graph traversal algorithm, the water supply connected network is constructed and the isolated section is intelligently identified, the repair suggestion containing the coordinates and quantity of the new nodes is generated, and the full coverage water supply of the mountainous area or scattered villages is ensured; the multi-objective optimization mechanism is adopted, the influence of the pressure gradient and the pipe diameter parameter on the path priority is quantified, the weight coefficient is dynamically adjusted to balance the water pressure guarantee and the pipe material cost, and different scene requirements are adapted; through the topological model, the candidate path pool covering all water points is generated, the water head loss is checked in real time, and the low-pressure infeasible scheme is eliminated, the high-quality path is screened in combination with the comprehensive weight ordering; the iterative weight updating strategy is introduced, the historical experience and the flow distribution result are fused, the high-frequency pipe section is gradually strengthened, the low-frequency path is naturally eliminated, the global optimal solution is approached within the controllable iteration number, the dependence on the artificial experience and the local optimal limit of the traditional planning are broken through, and the planning efficiency, safety and economy of the water supply network under the complex terrain are significantly improved, and reliable technical support is provided for the mountainous long-distance water supply, high-density urban pipe network and the like scenes.

[0098] The above embodiments have been described in detail, and specific examples have been applied to the principles and embodiments of the application. The above examples are only used to help understand the method of the application and its core idea; at the same time, for those skilled in the art, according to the idea of the application, the specific embodiments and application range will be changed, and the above description should not be understood as a limitation of the application.

Claims

1. A pipe network GIS geographic information system, characterized in that: The system includes: A data acquisition module (1), the data acquisition module (1) is used to obtain from the water supply system the water inlet and water outlet ends for connecting the water supply branch, i.e., the endpoints, and a number of water-demanding points to be covered by the water supply branch; A node setting module (2), the node setting module (2) is used to set a number of control nodes that the water supply branch can pass through, and to position-code the endpoints, control nodes and water use points; A pipeline spacing calculation module (3) is used to calculate the pipeline spacing between any two control nodes, an endpoint and a control node, an endpoint and a point, a point and a point, and a point and a control node, to generate a candidate spacing set; A compliant spacing screening module (4), wherein the compliant spacing screening module (4) is used to set a maximum pipeline laying length, and screen spacing data in a candidate spacing set that satisfies a pipeline spacing less than or equal to the maximum pipeline laying length, so as to generate a compliant spacing set; A connectivity verification module (5) verifies the pipe network connectivity between each water point and the two end points based on the compliance interval set. If the verification is successful, a prompt is outputted indicating that a water supply branch can be planned. If the verification is unsuccessful, a suggestion is outputted indicating that additional control nodes need to be added, and the process proceeds to the node setting module (2). A scheme output module (6) is used to calculate the optimal water supply path connecting the two end points and each water use point based on the compliance interval set and using a dynamic flow distribution algorithm after the pipe network connectivity verification is passed, and output a final planning scheme.

2. The pipe network GIS geographic information system according to claim 1, characterized in that: The specific steps of the compliance distance screening module (4) generating the compliance distance set are as follows: S41. Calculate the corrected maximum allowable pipe length based on the pipe material type, pressure rating, and terrain slope of the water supply branch line; S42. Set a compliant spacing set, traverse each pipeline spacing in the candidate spacing set, and if the pipeline spacing is less than or equal to the corrected maximum allowable pipe segment length, and the slope of the pipeline corresponding to the pipeline spacing is less than or equal to the maximum allowable slope of the pipe material, then include the pipeline spacing in the compliant spacing set; S43: Mark the pipeline spacing in the candidate spacing set that is not included in the compliance spacing set as abnormal pipelines, and output the abnormality type.

3. The pipe network GIS geographic information system according to claim 1, characterized in that: The specific steps of the connectivity verification module (5) for verifying the pipe network connectivity between each water point and the two end points based on the compliance distance set are as follows: S51. Starting from the water inlet of the water supply branch, traverse all connected pipeline nodes and water use points based on the compliance interval set to construct a water supply connection area set W; S52, verify whether the water outlet and each water point belong to the set W; If yes, the pipe network connectivity is determined to be passed; If there is a water point or outlet that does not belong to the set W, it will be marked as an isolated section and the set W' will be generated; S53. For each isolated section in the set W', calculate the minimum distance between it and the water supply connection area set W, and generate a recommended expansion area based on the pipe ductility coefficient; S54: Output the coordinate range of the expansion suggestion area and the number of control nodes required to be added.

4. The pipe network GIS geographic information system according to claim 1, characterized in that: The specific steps of the scheme output module (6) outputting the final planning scheme are: S61. Initialize the traffic weight parameter and set the total traffic Q total , pressure attenuation coefficient α, pipe segment priority factor β, maximum number of iterations T max And the number of paths generated in each round of iteration N path ; S62: Starting from the water inlet, generate a set of candidate paths based on the set of compliant spacings, and calculate the flow distribution weight W of each pipe segment. i,j ; S63, updating the flow distribution weight of each pipe section after each round of iteration; S64. Repeat the iteration until the maximum number of iterations is reached, and then output the path with the highest flow distribution weight as the optimal water supply path.

5. The pipe network GIS geographic information system according to claim 4, characterized in that: In step S62, the specific steps of generating a candidate path set based on the compliance distance set are: S621. Use the endpoints of the pipe segments in the compliant interval set as vertices and the compliant pipe segments as edges to construct an undirected graph. S622: With the water inlet and the water outlet as the starting point and end point of the candidate path, traverse the undirected graph to generate several candidate paths covering all water use points. The total head loss of the candidate paths satisfies: In the above formula, H inlet Indicates the initial pressure head at the water inlet end, provided by a water pump or high-level water tank, f i，j represents the Darcy friction coefficient of the pipe section (i, j), L i，j represents the actual length of the pipe segment (i, j), g is the acceleration due to gravity, ΔZ i，j Indicates the elevation difference of pipe segment (i, j), H required Indicates the minimum service head required by the user; S623. Calculate the comprehensive weight of each candidate path. The calculation formula for the comprehensive weight is: In the above formula, W path，k represents the comprehensive weight of the kth path, N path Indicates the number of candidate paths generated in each iteration, Path k represents the kth candidate water supply path, which is a complete water supply route from the water inlet to the water outlet; S624: Filter several candidate paths with the largest comprehensive weight values ​​and establish a candidate path set.

6. The pipe network GIS geographic information system according to claim 1, characterized in that: In step S41, the calculation formula for the corrected maximum allowable pipe section length is: In the above formula, L′ limit Indicates the maximum allowable pipe length after correction, L limit Indicates the maximum allowable pipe length before correction, E material represents the elastic modulus of the reference pipe, θ represents the terrain slope angle of the pipe laying area, S max Indicates the maximum slope allowed for the pipe.

7. The pipe network GIS geographic information system according to claim 4, characterized in that: In step S62, the traffic distribution weight W i,j The calculation formula is: in, In the above formula, P i,j represents the pressure gradient from node i to j, ΔH i，j represents the water head difference from node i to node j, L i，j represents the length of the pipe segment from node i to j, D i,j Represents the equivalent diameter of the pipe segment from node i to node j.

8. The pipe network GIS geographic information system according to claim 4, characterized in that: In step S63, the flow distribution weight update formula is as follows: In the above formula, and represents the flow distribution weight of the pipe section (i, j) at the t+1th and tth iterations respectively, ρ represents the history retention factor, 0<ρ<1, Q k represents the distribution flow of the kth path, is an indicator function. If the kth path contains the pipe segment (i, j), its value is 0, otherwise it is 1. path，k represents the comprehensive weight of the kth path, N path Indicates the number of candidate paths generated in each iteration, Path k It represents the kth candidate water supply path, which is a complete water supply route from the water inlet to the water outlet.

Images