Scheduling strategy determination method of drainage system, electronic equipment and storage medium

Abstract

The invention provides a scheduling strategy determination method of a drainage system, electronic equipment and a storage medium, and relates to the technical field of cloud intelligence, and the method comprises the steps: firstly, obtaining the water volume information of a plurality of pump stations in a pipe network of the drainage system and the water volume information of the paths of the plurality of pump stations; secondly, under the condition that constraint conditions and control targets are met, on the basis of the water volume information of the multiple pump stations and the water volume information of the paths of the multiple pump stations, water adjustable information and water storage information corresponding to the pump stations to be dispatched are determined; and finally, determining a scheduling strategy corresponding to the to-be-scheduled pump station based on the adjustable water information and the impoundable water information. In the embodiment of the invention, the scheduling strategy corresponding to the pump station to be scheduled is determined based on the water volume information of the plurality of pump stations and the water volume information of the paths of the plurality of pump stations by utilizing a mathematical planning method under the condition of meeting the constraint condition and the control target, and the calculation is short in time consumption, scientific and accurate.

Description

Technical Field

[0001] The present application relates to the field of cloud intelligence technology, and in particular to a method for determining a scheduling strategy for a drainage system, an electronic device, and a storage medium. Background Art

[0002] Integrated dispatching of plants, networks and rivers refers to the joint dispatching of drainage networks, sewage treatment plants and receiving water bodies (e.g., rivers) to achieve the best overall environmental benefits. Integrated dispatching of plants, networks and rivers is the core of the digital industry upgrade of the water industry. The maintenance dispatching of large-scale drainage systems is an important scenario in the integrated dispatching of plants, networks and rivers, especially for areas with drainage systems that include multi-stage lifting pump stations. In this scenario, there are many decision variables and high spatial complexity.

[0003] At present, for the maintenance and dispatching scenarios of large-scale urban drainage systems, the dispatching scheme commonly used by the main operators of urban drainage systems is: determine the water diversion path based on manual experience, monitor the liquid level of the water collection wells in front of the pumping stations on the water diversion path in real time, and adjust the corresponding pumping station flow based on experience to ensure that the liquid level of the water collection wells of each pumping station along the line does not exceed the warning level. This scheme relies heavily on manual experience and the decision-making is not scientific enough. Summary of the invention

[0004] The embodiments of the present application provide a method for determining a scheduling strategy for a drainage system, an electronic device, and a storage medium to solve the problem that the maintenance scheduling of the drainage system relies heavily on manual experience and the decision-making is not scientific enough.

[0005] In a first aspect, an embodiment of the present application provides a method for determining a scheduling strategy for a drainage system, the method comprising: obtaining water quantity information of multiple pumping stations in a pipeline network of the drainage system and water quantity information of paths of multiple pumping stations; determining adjustable water information and storable water information corresponding to the pumping station to be scheduled based on the water quantity information of the multiple pumping stations and the water quantity information of paths of the multiple pumping stations while satisfying constraints and control objectives; determining a scheduling strategy corresponding to the pumping station to be scheduled based on the adjustable water information and the storable water information.

[0006] In a second aspect, an embodiment of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory, wherein the processor implements any of the above methods when executing the computer program.

[0007] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, any of the above methods is implemented.

[0008] Compared with the prior art, this application has the following advantages:

[0009] The present application provides a method for determining a scheduling strategy for a drainage system, an electronic device, and a storage medium. First, the water volume information of multiple pumping stations in the pipe network of the drainage system and the water volume information of the paths of the multiple pumping stations are obtained; secondly, based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations, the adjustable water information and the water storage information corresponding to the pumping station to be scheduled are determined; finally, based on the adjustable water information and the water storage information, the scheduling strategy corresponding to the pumping station to be scheduled is determined. In this embodiment, a mathematical programming method is used to determine the scheduling strategy corresponding to the pumping station to be scheduled based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations, while satisfying the constraints and control objectives. The calculation is short in time and scientific and accurate.

[0010] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In the accompanying drawings, unless otherwise specified, the same reference numerals throughout the multiple drawings represent the same or similar parts or elements. These drawings are not necessarily drawn to scale. It should be understood that these drawings only depict some embodiments according to the present application and should not be regarded as limiting the scope of the present application.

[0012] Figure 1 A schematic diagram of an application scenario of the method for determining the scheduling strategy for a drainage system provided in this application.

[0013] Figure 2 This is a flow chart of a method for determining a scheduling strategy for a drainage system according to an embodiment of the present application.

[0014] Figure 3 This is a structural block diagram of a device for determining a scheduling strategy for a drainage system according to an embodiment of the present application.

[0015] Figure 4 A block diagram of an electronic device used to implement an embodiment of the present application. DETAILED DESCRIPTION

[0016] In the following, only some exemplary embodiments are briefly described. As those skilled in the art will appreciate, the described embodiments may be modified in various ways without departing from the concept or scope of the present application. Therefore, the drawings and descriptions are considered to be exemplary in nature and not restrictive.

[0017] To facilitate understanding of the technical solutions of the embodiments of the present application, the following describes the related technologies of the embodiments of the present application. The following related technologies can be combined with the technical solutions of the embodiments of the present application as optional solutions, and they all belong to the protection scope of the embodiments of the present application.

[0018] Figure 1 A schematic diagram of an application scenario of the method for determining the scheduling strategy of the drainage system provided in this application. In this embodiment, a specific pumping station in the pipe network of the urban drainage system must be suspended for a period of time due to maintenance needs. The sewage that originally needs to flow through this pumping station in daily status needs to be transferred to other sewage treatment plants through other pumping stations for treatment, and the excess water that cannot be transferred is stored in the pipe network space. First, the topological diagram of the pipe network is converted into a network flow data structure. For example, the corresponding direction is added to each edge of the topological diagram according to the direction of the water flow, and the weight corresponding to each edge is set according to specific needs to obtain a directed weighted graph. Then, the adjustable water path and the water storage area corresponding to the pump station to be repaired are calculated according to the directed weighted graph, and the network flow optimization algorithm is used to calculate the adjustable water volume of each adjustable water path and the water storage area that can be stored under the constraints. The adjustable water volume and the water storage volume are sampled under the constraints. According to the sampling data, the Storm Water Management Model (SWMM) is used to perform simulation and deduction. According to the simulation and deduction results, the corresponding control objective function value is calculated, and the control objective function values ​​under different scheduling strategies are compared. The optimal scheduling strategy or multiple scheduling strategies sorted by priority are returned.

[0019] The directed weighted graph of the drainage system network is as follows: Figure 1 As shown, where the node represents a pump station in the pipe network, the edge between the nodes represents the path between the pump stations, and the weight of each edge can be set according to specific needs. The pump station corresponding to node 5 is a pump station to be repaired. Under the condition of meeting the control target and optimization conditions, based on the upstream nodes (node ​​1, node 2, node 3 and node 4) of node 5 and the water volume information of the upstream path, for the sewage that is about to be treated by node 5, it is transferred to other sewage treatment plants through the upstream nodes and upstream paths of node 5 for treatment. When selecting an upstream node, select from the upstream nodes whose downstream paths are greater than or equal to the preset value, for example, the preset value is 2, that is, based on the water volume information of upstream nodes 1 (the number of downstream paths is 2), node 2 (the number of downstream paths is 2), and node 3 (the number of downstream paths is 2) and the water volume information of the upstream path, determine the adjustable water path and adjustable water volume corresponding to node 5. Wherein, the adjustable water path is composed of nodes and edges between nodes. If the adjustable water volume is less than the preset water volume, it means that after the water is adjusted, there is still residual water in the pump station to be repaired, and water is stored. Based on the storable water volumes corresponding to the upstream nodes 1, 2, 3 and 4 respectively, the storable water area and storable water volume corresponding to node 5 are determined.

[0020] Among them, the control objectives include at least one of the following: the water level in the pipeline network is lower than the preset water level value, and the load of multiple pumping stations is balanced; for any pumping station among the multiple pumping stations, the constraints include: the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is not greater than the maximum water delivery capacity of the pumping station; the sewage volume in the path of the pumping station is less than the maximum water delivery capacity of the path; and the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is equal to the sum of the sewage volume in the downstream path of the pumping station.

[0021] In this embodiment, the network flow optimization algorithm and the SWMM model are combined to realize the generation and optimization of water diversion paths under specific constraints and optimization objectives in the maintenance and scheduling scenarios. It has the characteristics of short calculation time and scientific accuracy. It provides a solution for the maintenance and scheduling of large-scale urban drainage systems, and can effectively support the implementation of the integrated scheduling scenario of plant, network and river and the construction of an integrated scheduling center.

[0022] The present application embodiment provides a method for determining a scheduling strategy for a drainage system. The method in the present embodiment can be applied to a computing device, which may include a server, a user terminal, etc. Figure 2 The flowchart of the method for determining the scheduling strategy of the drainage system according to an embodiment of the present application is shown, including:

[0023] Step S201, obtaining water volume information of multiple pumping stations in the pipe network of the drainage system and water volume information of the paths of the multiple pumping stations.

[0024] Step S202, under the condition of satisfying the constraint conditions and the control target, based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations, determine the adjustable water information and the storable water information corresponding to the pumping station to be scheduled.

[0025] Step S203, based on the adjustable water information and the storable water information, determine the dispatching strategy corresponding to the pump station to be dispatched.

[0026] Among them, the pump station to be dispatched is a pump station that needs water dispatching. Because the pump station needs to be repaired or has other needs, the water needs to be transferred and transported to other areas through other pump stations.

[0027] The water volume information of the pumping station includes but is not limited to at least one of the following: the amount of sewage generated in the area where the pumping station is located within a preset time period, the sewage treatment volume of the pumping station, the maximum water delivery capacity of the pumping station, and the storable water volume in the area where the pumping station is located, wherein the storable water volume in the area where the pumping station is located includes the water volume of a reservoir whose distance from the pumping station is less than a preset distance threshold.

[0028] The water volume information of the path of the pump station includes but is not limited to at least one of the following: the amount of sewage in the path within a preset time period, and the maximum water delivery capacity of the path.

[0029] The constraints and control targets can be set according to specific needs, and this embodiment does not limit them.

[0030] The method for determining the scheduling strategy of the drainage system provided in the embodiment of the present application first obtains the water volume information of multiple pumping stations in the pipe network of the drainage system and the water volume information of the paths of the multiple pumping stations; secondly, under the condition that the constraints and control objectives are met, the adjustable water information and the storable water information corresponding to the pumping station to be scheduled are determined based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations; finally, based on the adjustable water information and the storable water information, the scheduling strategy corresponding to the pumping station to be scheduled is determined. In this embodiment, a mathematical programming method is used to determine the scheduling strategy corresponding to the pumping station to be scheduled based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations under the condition that the constraints and control objectives are met. The calculation is short in time and scientific and accurate.

[0031] In one implementation, step S202, based on the water volume information of the plurality of pumping stations and the water volume information of the paths of the plurality of pumping stations, determines the adjustable water information and the storable water information corresponding to the pumping station to be scheduled, including:

[0032] Step S2021, determining a bidirectional pumping station and a path of the bidirectional pumping station among the upstream pumping stations of the pumping stations to be scheduled among the multiple pumping stations, wherein the bidirectional pumping station is a pumping station having a number of downstream paths greater than or equal to a preset value.

[0033] Step S2022: Determine the adjustable water information corresponding to the pump station to be scheduled based on the water volume information of the bidirectional pump station and the water volume information of the downstream path of the bidirectional pump station.

[0034] Step S2023, based on the adjustable water information corresponding to the pump station to be scheduled and the preset water adjustment information, determine the water storage information corresponding to the pump station to be scheduled.

[0035] Among them, the upstream pump station of the pump station to be scheduled is a pump station where the water needs to flow through the pump station to be scheduled or the area where the pump station to be scheduled is located when no scheduling is performed. The preset value may include an integer greater than or equal to 2. The preset water diversion information is the predetermined water volume information that needs to be diverted from the pump station to be scheduled. The difference between the adjustable water information and the preset water diversion information is the remaining water volume corresponding to the pump station to be scheduled after scheduling, and it is considered to be processed by water storage. In this embodiment, scheduling is performed based on the water volume information of the upstream bidirectional pump station. Since there are multiple downstream paths of the bidirectional pump station, other paths of water scheduling can be used, and thus will not flow through the pump station to be scheduled, thereby reducing the water volume of the pump station to be scheduled and achieving the scheduling purpose.

[0036] In one implementation, step S2021, determines a bidirectional pumping station and a path of a bidirectional pumping station in an upstream pumping station of a pumping station to be scheduled among multiple pumping stations, including: obtaining a directed weighted graph corresponding to the pipe network of the drainage system; the nodes in the directed weighted graph correspond to the pumping stations in the pipe network, and the edges between the nodes correspond to the paths between the pumping stations; based on the directed weighted graph, in the upstream nodes of the nodes corresponding to the pumping station to be scheduled, determines a target upstream node whose number of downstream edges is greater than or equal to a preset value, determines the pumping station corresponding to the target upstream node as a bidirectional pumping station, and determines the edge corresponding to the target upstream node as the path of the bidirectional pumping station.

[0037] In a specific example, the topological diagram of the drainage system pipe network is converted into a directed weighted graph G(V, E), where the points represent pumping stations, the edges represent the connection paths of the pumping stations, and the weights are the water flow rates. sewer , Q treatment , Q punp_max , R pump , E up , E down ), the point attributes include the daily average sewage volume Q in the area where the pump station is located (gravity area) sewer , daily average sewage treatment volume Q treatment , the maximum daily water delivery capacity of the pumping station Q pump_max , the redundancy (water storage capacity) of the area where the pump station is located is R pump , the set of edges upstream of the pump station E up , the downstream edge set E of the pump station down For the edge E(Q path , Q path_max , W path ), the attributes of the edge include the average daily sewage volume Q of the path path , the maximum daily water delivery capacity of the path Q path_max , the cost weight coefficient W of this edge when calculating the optimal path path In G(V, E), query the upstream node of the node corresponding to the pump station to be scheduled, and obtain the target upstream node whose number of downstream edges in the upstream node is greater than or equal to 2. The pump station corresponding to this node is a bidirectional pump station, and the edge of this node is the path of the bidirectional pump station.

[0038] In one implementation, step S2022 determines the adjustable water information corresponding to the pump station to be scheduled based on the water volume information of the bidirectional pump station and the water volume information of the downstream path of the bidirectional pump station, including: based on the water volume information of the bidirectional pump station, the water volume information of the downstream path of the bidirectional pump station and the cost information of the downstream path of the bidirectional pump station, determining the adjustable water path and adjustable water volume with the minimum cost as the adjustable water path and adjustable water volume corresponding to the pump station to be scheduled.

[0039] Among them, the adjustable water information includes the adjustable water path and the adjustable water volume; the cost information is determined based on the level difference between the bidirectional pumping station and the pumping station to be dispatched. Among them, the level difference represents the level difference between the bidirectional pumping station and the pumping station to be dispatched. For example, if the bidirectional pumping station is the upper level pumping station of the pumping station to be dispatched, the level difference is 1. The level difference between the bidirectional pumping station and the pumping station to be dispatched is inversely proportional to the cost. The larger the level difference, the lower the cost.

[0040] Optionally, when determining the water-adjustable path with the minimum cost, all downstream paths of the bidirectional pumping station are traversed, and the upstream bidirectional pumping station is preferentially traversed to calculate the water-adjustable path, and the cost coefficient W of each path in the path set of the bidirectional pumping station is configured. path , W path The specific value of is determined by the difference in the number of stages from the bidirectional pumping station to the node to be dispatched. The purpose is to ensure that the cost of the adjustable water path is minimized, and the sewage is preferentially transferred from the upstream of the node to be dispatched.

[0041] In one implementation, step S2023 determines the water storage information corresponding to the pump station to be scheduled based on the adjustable water information corresponding to the pump station to be scheduled and the preset water transfer information, including: when the adjustable water volume corresponding to the pump station to be scheduled is less than the preset water transfer volume, the water storage area of ​​each upstream pump station of the pump station to be scheduled is determined as the water storage area corresponding to the pump station to be scheduled; the sum of the water storage volumes of each upstream pump station of the pump station to be scheduled is determined as the water storage volume corresponding to the pump station to be scheduled.

[0042] Among them, the water storage information includes the water storage area and the water storage capacity; the adjustable water information includes the adjustable water capacity. The adjustable water capacity corresponding to the pump station to be dispatched is compared with the preset water transfer capacity. If the adjustable water capacity corresponding to the pump station to be dispatched is less than the preset water transfer capacity, it means that there is still residual water in the pump station to be dispatched after the water transfer, then water storage is carried out, and the sum of the water storage area of ​​the upstream pump station and the water storage capacity of each upstream pump station is used as the water storage area and water storage capacity corresponding to the pump station to be dispatched.

[0043] In one implementation, the control objectives include at least one of the following: the water level in the pipeline network is lower than a preset water level value and the load of multiple pumping stations is balanced; for any one of the multiple pumping stations, the constraints include: the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is not greater than the maximum water delivery capacity of the pumping station; the sewage volume in the path of the pumping station is less than the maximum water delivery capacity of the path; and the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is equal to the sum of the sewage volume in the downstream path of the pumping station.

[0044] Among them, the control objectives and constraints can be determined according to specific needs and are not limited in this application.

[0045] In one implementation, for any one of the multiple pumping stations, when the condition that the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is not equal to the sum of the sewage volume in the downstream path of the pumping station is not satisfied, the method further includes: determining the water storage time of the pumping station based on the storable water capacity corresponding to the pumping station, the sewage volume in the area where the pumping station is located, the sum of the sewage volume in the upstream path of the pumping station, and the sum of the sewage volume in the downstream path of the pumping station.

[0046] In one example, based on the points and edges in the directed weighted graph G(V, E), the constraints are as follows:

[0047] (1) Maximum water delivery capacity constraints of the pumping station:

[0048]

[0049] Among them, V(Q sewer ) represents the average daily sewage volume in the area where any pumping station in the network is located; It represents the sum of the daily average sewage volume transported to this pumping station from the upstream path of any pumping station; V(Q pump_max ) represents the maximum daily water delivery of any pumping station.

[0050] (2) Maximum water delivery capacity constraint of the path:

[0051]

[0052] Among them, E(Q path ) represents the average daily sewage volume of any pump station in the pipe network; E(Q path_max ) represents the maximum daily water delivery of any path.

[0053] (3) Pumping station water conservation constraints:

[0054]

[0055] Among them, V(Q sewer ) represents the average daily sewage volume in the area where any pumping station in the network is located; It represents the sum of the daily average sewage volume transported to this pumping station from the upstream path of any pumping station; It represents the sum of the average daily sewage volume in the downstream path of any pumping station.

[0056] During the calculation process, nodes with downstream edges greater than or equal to 2 can be dynamically modified|V(E down )|≥2, and ensure that the above three constraints are still met after modification. If the above three constraints cannot be met, it is necessary to output the maximum value Q that can be increased in the upstream path when constraints (1) and (2) are met respectively. max_1 , Q max_2, when constraint condition (3) is not met, the water conservation constraint of the pumping station can be temporarily broken. At this time, the water storage time of the pumping station needs to be output, which is calculated according to the following formula:

[0057]

[0058] Among them, T storage (V) represents the water storage time of the pump station; V(R pump ) represents the water storage capacity of the area where the pump station is located; V(Q sewer ) represents the average daily sewage volume in the area where the pump station is located in the pipe network; It represents the sum of the daily average sewage volume transported to this pumping station from the upstream path of the pumping station; Represents the sum of the average daily sewage volume in the downstream path of the pumping station.

[0059] In one implementation, the method further includes: determining a sewage treatment plant whose sewage treatment volume is reduced and a sewage treatment plant whose sewage treatment volume is increased after water is diverted from the scheduling node.

[0060] In actual applications, after determining the scheduling strategy corresponding to the pump station to be scheduled and transferring water, the sewage treatment plants with reduced sewage treatment volume and the sewage treatment plants with increased sewage treatment volume are determined, and then the sewage treatment volume of each sewage treatment plant is adjusted to meet actual needs.

[0061] In one implementation, step S203, based on the adjustable water information and the storable water information, determines the dispatching strategy corresponding to the pump station to be dispatched, including:

[0062] Step S2031, taking values ​​in the value ranges corresponding to the adjustable water information and the storable water information, and performing simulation deduction using the values ​​corresponding to the adjustable water information and the storable water information.

[0063] Step S2032, based on the simulation results and the corresponding control objectives, determine the final value from the values ​​corresponding to the adjustable water information and the storable water information respectively as the scheduling strategy corresponding to the pump station to be scheduled.

[0064] In practical applications, after determining the adjustable water information and the storable water information, the adjustable water volume and the storable water volume are sampled, and simulation is performed through the SWMM model based on the sampled data. According to the simulation results, the corresponding control objective function value is calculated, and the control objective function values ​​under different scheduling schemes are compared to return the optimal scheduling strategy or multiple scheduling strategies sorted by priority. Optionally, in addition to the adjustable water information and the storable water information, the scheduling strategy may also include the operation information of the pump station involved in the scheduling, such as the flow curve, the number of pumps on, etc. The flow curve is used to represent the relationship between the pump power and the water volume. According to the relationship between different water levels and the number of pumps on in the operating rules, the number of pumps to be turned on is determined as the water level changes.

[0065] In a specific example, based on the directed weighted graph G(V, E), the specific calculation process for determining the dispatching strategy corresponding to the pump station to be dispatched is as follows:

[0066] Step 1: Determine the upstream topological relationship of the node to be dispatched (corresponding to the pump station to be dispatched):

[0067] According to the topological relationship of the directed weighted graph G(V, E), calculate the node V to be scheduled dispatch The set of all upstream nodes V up (V dispatch ) and the upstream path set E up (V dispatch ), determine the set of bidirectional pumping stations in the upstream pumping station and upstream path:

[0068] V up_double (V dispatch )={V|V∈V up (V dispatch ),|V(E down )|≥2} (5)

[0069] Among them, V up_double (V dispatch ) represents a bidirectional pumping station, that is, a pumping station with a number of downstream paths greater than or equal to 2 in the upstream pumping station to be dispatched.

[0070] Step 2: Calculate the adjustment of the sewage treatment plant's treatment capacity caused by maintenance scheduling:

[0071] Calculate the nodes to be scheduled V dispatchThe corresponding reduction sewage plant and the corresponding incremental sewage plant after water transfer, among which the reduction sewage plant can be determined according to the daily water transfer direction. Specifically, the sewage treatment capacity of the sewage plant after scheduling is compared with the daily treatment capacity of the sewage plant. If the sewage treatment capacity of the sewage plant after scheduling is less than the daily treatment capacity of the sewage plant, it is a reduction sewage plant. For incremental sewage plants, if there are multiple, a unique plan can be determined according to user needs, or multiple plans can be determined by uniform sampling. According to the determined plan, adjust the average daily sewage treatment capacity Q of each sewage plant treatment .

[0072] Step 3: Calculate the maximum schedulable path and the corresponding water transfer volume:

[0073] Pre-set the node V to be scheduled dispatch The maximum water delivery capacity of the pump station V can be updated during the calculation process. up_double (V dispatch ) and traverse the upstream bidirectional pumping station first: connect the upstream edge E of the pumping station to be dispatched up (V dispatch ) is the cost coefficient W of the corresponding path set path The amount of upward adjustment is determined by the difference in the number of stages from the bidirectional pumping station to the pumping station to be dispatched. When calculating the maximum dispatchable path and the corresponding water transfer volume, the sewage is preferentially transferred from the upstream of the node to be dispatched while ensuring the minimum cost flow.

[0074] Update the vertex and edge attributes of the graph G(V, E); use the minimum cost flow algorithm based on the network simplex to calculate the water flow Q of each edge in the graph G(V, E) path ; If the minimum cost flow algorithm has a feasible solution: then the scheduling scheme calculation is completed, and all schemes are transferred to the SWMM model for optimization; If the minimum cost flow algorithm does not have a feasible solution: then reduce the water transfer volume Q corresponding to the node to be scheduled dispatch , recalculate whether there is a feasible solution until a feasible solution exists. At this time, the water transfer amount corresponding to the node to be dispatched is Q dispatch，capable , remaining water (Q dispatch -Q dispatch，capable ) adopts water storage solution.

[0075] Step 4: Calculate the maximum water storage area and the corresponding water storage capacity:

[0076] Traverse all upstream node sets V of the node to be scheduled up (V dispatch ): Determine the maximum water storage area of ​​the pump station to be dispatched based on the corresponding water storage area of ​​each upstream pump station; calculate the maximum water storage capacity of each upstream pump station Among them, V up (Rpump ) represents the water storage capacity of the area where each upstream pump station is located, T dispatch Indicates the preset water storage time corresponding to the pump station to be dispatched, for example, the maintenance time of the pump station to be repaired, T dispatch ≤T storage The solution is feasible, otherwise there is no solution. The daily average maximum water storage capacity of each upstream pump station is summed up to obtain the daily average total water storage capacity, that is, the water storage capacity corresponding to the pump station to be dispatched; if the total water storage capacity is greater than or equal to the remaining water capacity (Q dispatch -Q dispatch，capable ): The scheduling scheme calculation is completed and the SWMM model is entered for optimization; if the total storable water capacity is less than the remaining water capacity, the scheduling scheme calculation is completed and an abnormal calculation result is returned, indicating that there is no feasible scheduling scheme at present and other schemes are recommended.

[0077] Step 5: Use SWMM model to optimize the solution:

[0078] Use the hydrological and hydrodynamic model of the urban drainage system based on SWMM to simulate the adjustable water information and storable water information calculated in the above step 3 or step 4. According to the simulation results, calculate the corresponding control objective function value, compare the control objective function values ​​under different schemes, and return the optimal scheduling scheme or multiple scheduling schemes sorted by priority.

[0079] Corresponding to the application scenario and method of the method provided in the embodiment of the present application, the embodiment of the present application also provides a device for determining a scheduling strategy for a drainage system. Figure 3 The figure shows a structural block diagram of a device for determining a scheduling strategy for a drainage system according to an embodiment of the present application, the device comprising:

[0080] The information acquisition module 301 is used to acquire water volume information of multiple pumping stations in the pipe network of the drainage system and water volume information of the paths of the multiple pumping stations.

[0081] The first determination module 302 is used to determine the adjustable water information and storable water information corresponding to the pump station to be scheduled based on the water volume information of multiple pump stations and the water volume information of the paths of multiple pump stations while satisfying the constraint conditions and control objectives.

[0082] The second determination module 303 is used to determine the scheduling strategy corresponding to the pump station to be scheduled based on the adjustable water information and the storable water information.

[0083] The drainage system scheduling strategy determination device provided in the embodiment of the present application first obtains the water volume information of multiple pumping stations in the pipe network of the drainage system and the water volume information of the paths of the multiple pumping stations; secondly, under the condition that the constraints and control objectives are met, the adjustable water information and the storable water information corresponding to the pumping station to be scheduled are determined based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations; finally, based on the adjustable water information and the storable water information, the scheduling strategy corresponding to the pumping station to be scheduled is determined. In this embodiment, a mathematical programming method is used to determine the scheduling strategy corresponding to the pumping station to be scheduled based on the water volume information of the multiple pumping stations and the water volume information of the paths of the multiple pumping stations under the condition that the constraints and control objectives are met, and the calculation is short in time and scientific and accurate.

[0084] In one implementation, the first determination module 302 is used to: determine a bidirectional pumping station and a path of a bidirectional pumping station among multiple pumping stations that are upstream of a pumping station to be scheduled, where the bidirectional pumping station is a pumping station whose number of downstream paths is greater than or equal to a preset value; determine the adjustable water information corresponding to the pumping station to be scheduled based on the water volume information of the bidirectional pumping station and the water volume information of the downstream path of the bidirectional pumping station; determine the water storage information corresponding to the pumping station to be scheduled based on the adjustable water information corresponding to the pumping station to be scheduled and the preset water adjustment information.

[0085] In one implementation, when the first determination module 302 determines the bidirectional pumping station and the path of the bidirectional pumping station in the upstream pumping station of the pumping station to be scheduled among multiple pumping stations, it is used to: obtain a directed weighted graph corresponding to the pipe network of the drainage system; the nodes in the directed weighted graph correspond to the pumping stations in the pipe network, and the edges between the nodes correspond to the paths between the pumping stations; based on the directed weighted graph, in the upstream nodes corresponding to the nodes of the pumping station to be scheduled, determine a target upstream node whose number of downstream edges is greater than or equal to a preset value, determine the pumping station corresponding to the target upstream node as a bidirectional pumping station, and determine the edge corresponding to the target upstream node as the path of the bidirectional pumping station.

[0086] In one implementation, the adjustable water information includes an adjustable water path and an adjustable water volume; when the first determination module 302 determines the adjustable water information corresponding to the pump station to be scheduled based on the water volume information of the bidirectional pumping station and the water volume information of the downstream path of the bidirectional pumping station, it is used to: determine the adjustable water path and adjustable water volume with the minimum cost based on the water volume information of the bidirectional pumping station, the water volume information of the downstream path of the bidirectional pumping station and the cost information of the downstream path of the bidirectional pumping station, as the adjustable water path and adjustable water volume corresponding to the pump station to be scheduled; the cost information is determined based on the difference in the order of the bidirectional pumping station and the pump station to be scheduled.

[0087] In one implementation, the water storage information includes the water storage area and the water storage capacity; the adjustable water information includes the adjustable water capacity; when the first determination module 302 determines the water storage information corresponding to the pump station to be scheduled based on the adjustable water information corresponding to the pump station to be scheduled and the preset water adjustment information, it is used to: when the adjustable water capacity corresponding to the pump station to be scheduled is less than the preset water adjustment capacity, the water storage area of ​​each upstream pump station of the pump station to be scheduled is determined as the water storage area corresponding to the pump station to be scheduled; the sum of the water storage capacities of each upstream pump station of the pump station to be scheduled is determined as the water storage capacity corresponding to the pump station to be scheduled.

[0088] In one implementation, the control objectives include at least one of the following: the water level in the pipeline network is lower than a preset water level value and the load of multiple pumping stations is balanced; for any one of the multiple pumping stations, the constraints include: the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is not greater than the maximum water delivery capacity of the pumping station; the sewage volume in the path of the pumping station is less than the maximum water delivery capacity of the path; and the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is equal to the sum of the sewage volume in the downstream path of the pumping station.

[0089] In one implementation, for any one of the multiple pumping stations, when the condition that the sum of the sewage volume in the area where the pumping station is located and the sewage volume in the upstream path of the pumping station is not equal to the sum of the sewage volume in the downstream path of the pumping station is not satisfied, the device is also used to determine the water storage time of the pumping station based on the storable water capacity corresponding to the pumping station, the sewage volume in the area where the pumping station is located, the sum of the sewage volume in the upstream path of the pumping station, and the sum of the sewage volume in the downstream path of the pumping station.

[0090] In one implementation, the device is also used to: determine the sewage treatment plants whose sewage treatment volume decreases and the sewage treatment plants whose sewage treatment volume increases after water transfer at the scheduling node.

[0091] In one implementation, the second determination module 303 is used to: select values ​​within the value ranges corresponding to the adjustable water information and the storable water information, and perform simulation using the values ​​corresponding to the adjustable water information and the storable water information; based on the simulation results and the corresponding control objectives, determine the final value from the values ​​corresponding to the adjustable water information and the storable water information as the scheduling strategy corresponding to the pump station to be scheduled.

[0092] The functions of each module in each device in the embodiments of the present application can be found in the corresponding description in the above method, and have corresponding beneficial effects, which will not be repeated here.

[0093] Figure 4 FIG. 1 is a block diagram of an electronic device used to implement an embodiment of the present application. Figure 4As shown, the electronic device includes: a memory 410 and a processor 420. The memory 410 stores a computer program that can be run on the processor 420. When the processor 420 executes the computer program, the method in the above embodiment is implemented. The number of the memory 410 and the processor 420 can be one or more.

[0094] The electronic device also includes:

[0095] The communication interface 430 is used to communicate with external devices and perform data exchange transmission.

[0096] If the memory 410, the processor 420 and the communication interface 430 are implemented independently, the memory 410, the processor 420 and the communication interface 430 can be connected to each other through a bus and communicate with each other. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 4 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0097] Optionally, in a specific implementation, if the memory 410, the processor 420 and the communication interface 430 are integrated on a chip, the memory 410, the processor 420 and the communication interface 430 can communicate with each other through an internal interface.

[0098] An embodiment of the present application provides a computer-readable storage medium storing a computer program, which implements the method provided in the embodiment of the present application when the program is executed by a processor.

[0099] An embodiment of the present application also provides a chip, which includes a processor for calling and executing instructions stored in the memory from the memory, so that a communication device equipped with the chip executes the method provided by the embodiment of the present application.

[0100] An embodiment of the present application also provides a chip, including: an input interface, an output interface, a processor and a memory, wherein the input interface, the output interface, the processor and the memory are connected via an internal connection path, and the processor is used to execute the code in the memory. When the code is executed, the processor is used to execute the method provided in the embodiment of the application.

[0101] It should be understood that the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. It is worth noting that the processor may be a processor supporting the Advanced RISC Machines (ARM) architecture.

[0102] Further, optionally, the above-mentioned memory may include a read-only memory and a random access memory. The memory may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may include a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may include a random access memory (RAM), which is used as an external cache. By way of exemplary but not limiting description, many forms of RAM are available. For example, static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct memory bus random access memory (DR RAM).

[0103] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.

[0104] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine different embodiments or examples described in this specification and the features of different embodiments or examples, unless they are contradictory.

[0105] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0106] Any process or method described in the flow chart or otherwise described herein can be understood as a module, fragment or portion of a code representing one or more executable instructions for implementing the steps of a specific logical function or process. And the scope of the preferred embodiment of the present application includes other implementations, in which the functions may not be performed in the order shown or discussed, including in a substantially simultaneous manner or in a reverse order according to the functions involved.

[0107] The logic and / or steps described in the flowchart or otherwise described herein, for example, can be considered as an ordered list of executable instructions for implementing logical functions, which can be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or used in combination with these instruction execution systems, devices or apparatuses.

[0108] It should be understood that the various parts of the present application can be implemented with hardware, software, firmware or a combination thereof. In the above embodiments, multiple steps or methods can be implemented with software or firmware stored in a memory and executed by a suitable instruction execution system. All or part of the steps of the above embodiment method can be completed by instructing the relevant hardware through a program, which can be stored in a computer-readable storage medium, and when the program is executed, it includes one of the steps of the method embodiment or a combination thereof.

[0109] In addition, each functional unit in each embodiment of the present application can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into one module. The above-mentioned integrated module can be implemented in the form of hardware or in the form of a software functional module. If the above-mentioned integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. The storage medium can be a read-only memory, a disk or an optical disk, etc.

[0110] The above is only an exemplary embodiment of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of various changes or substitutions within the technical scope recorded in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for determining a scheduling strategy for a drainage system, characterized in that: The method comprises: Acquire water volume information of multiple pumping stations in a pipe network of a drainage system and water volume information of paths of the multiple pumping stations; Under the condition that the constraint conditions and the control target are met, based on the water volume information of the plurality of pumping stations and the water volume information of the paths of the plurality of pumping stations, the adjustable water information and the storable water information corresponding to the pumping station to be scheduled are determined; Based on the adjustable water information and the storable water information, a scheduling strategy corresponding to the pump station to be scheduled is determined.

2. The method according to claim 1, characterized in that Based on the water volume information of the plurality of pumping stations and the water volume information of the paths of the plurality of pumping stations, determining the adjustable water information and the storable water information corresponding to the pumping station to be scheduled, including: Determine a bidirectional pumping station and a path of the bidirectional pumping station in an upstream pumping station of the pumping station to be scheduled among the plurality of pumping stations, the bidirectional pumping station being a pumping station having a number of downstream paths greater than or equal to a preset value; Determine the adjustable water information corresponding to the pump station to be scheduled based on the water volume information of the bidirectional pump station and the water volume information of the downstream path of the bidirectional pump station; Based on the adjustable water information and preset water adjustment information corresponding to the pump station to be scheduled, the available water storage information corresponding to the pump station to be scheduled is determined.

3. The method according to claim 2, characterized in that The step of determining a bidirectional pumping station and a path of the bidirectional pumping station in an upstream pumping station of the pumping station to be scheduled among the plurality of pumping stations comprises: Obtain a directed weighted graph corresponding to the pipe network of the drainage system; the nodes in the directed weighted graph correspond to pumping stations in the pipe network, and the edges between the nodes correspond to paths between the pumping stations; Based on the directed weighted graph, among the upstream nodes of the node corresponding to the pump station to be scheduled, a target upstream node whose number of downstream edges is greater than or equal to a preset value is determined, the pump station corresponding to the target upstream node is determined as a bidirectional pump station, and the edge corresponding to the target upstream node is determined as the path of the bidirectional pump station.

4. The method according to claim 2, characterized in that: The adjustable water information includes an adjustable water path and an adjustable water volume; based on the water volume information of the bidirectional pumping station and the water volume information of the downstream path of the bidirectional pumping station, determining the adjustable water information corresponding to the pumping station to be scheduled includes: Based on the water volume information of the bidirectional pumping station, the water volume information of the downstream path of the bidirectional pumping station and the cost information of the downstream path of the bidirectional pumping station, the adjustable water path and adjustable water volume with the minimum cost are determined as the adjustable water path and adjustable water volume corresponding to the pumping station to be scheduled; the cost information is determined based on the difference in levels between the bidirectional pumping station and the pumping station to be scheduled.

5. The method according to claim 2, characterized in that: The water storage information includes a water storage area and a water storage amount; the adjustable water information includes an adjustable water amount; based on the adjustable water information corresponding to the pump station to be scheduled and the preset water adjustment information, determining the water storage information corresponding to the pump station to be scheduled includes: When the adjustable water volume corresponding to the pump station to be scheduled is less than the preset water volume, the water storage area of ​​each upstream pump station of the pump station to be scheduled is determined as the water storage area corresponding to the pump station to be scheduled; The sum of the water storage capacities of the upstream pumping stations of the pumping station to be scheduled is determined as the water storage capacity corresponding to the pumping station to be scheduled.

6. The method according to any one of claims 1 to 5, characterized in that: The control target includes at least one of the following: the water level in the pipe network is lower than a preset water level value, and the loads of the multiple pumping stations are balanced; For any pump station among the plurality of pump stations, the constraint conditions include: The sum of the sewage volume in the area where the pump station is located and the sewage volume in the upstream path of the pump station is not greater than the maximum water delivery capacity of the pump station; The sewage volume of the path of the pump station is less than the maximum water delivery volume of the path; and The sum of the sewage volume in the area where the pump station is located and the sewage volume in the upstream path of the pump station is equal to the sum of the sewage volume in the downstream path of the pump station.

7. The method according to claim 6, characterized in that For any pump station among the multiple pump stations, when the sum of the sewage volume in the area where the pump station is located and the sewage volume in the upstream path of the pump station is not equal to the sum of the sewage volume in the downstream path of the pump station, the method further includes: The water storage time of the pumping station is determined based on the water storage capacity corresponding to the pumping station, the sewage volume in the area where the pumping station is located, the sum of the sewage volume in the upstream path of the pumping station, and the sum of the sewage volume in the downstream path of the pumping station.

8. The method according to any one of claims 1 to 5, characterized in that: The method further comprises: Determine the sewage treatment plants whose sewage treatment volume is reduced and the sewage treatment plants whose sewage treatment volume is increased after water is diverted to the node to be scheduled.

9. The method according to any one of claims 1 to 5, characterized in that: The step of determining the dispatching strategy corresponding to the pump station to be dispatched based on the adjustable water information and the storable water information includes: Selecting values ​​in the value ranges corresponding to the adjustable water information and the storable water information, and performing simulation deduction using the values ​​corresponding to the adjustable water information and the storable water information; Based on the simulation results and the corresponding control objectives, a final value is determined from the values ​​corresponding to the adjustable water information and the storable water information, respectively, as a scheduling strategy corresponding to the pump station to be scheduled.

10. An electronic device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory, wherein the processor implements the method according to any one of claims 1 to 9 when executing the computer program.

11. A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Images