Water quantity dispatching calculation method and related device based on basic configuration of water resources

Abstract

The present application discloses a water scheduling calculation method and related devices based on basic configuration of water resources, and relates to the technical field of water resource scheduling. The method includes: drawing a generalized graph model of the scheduling system, and configuring the node basic rules of the generalized graph model of the scheduling system to obtain the configured generalized graph model; the generalized graph model of the scheduling system includes: water inflow nodes, branch and confluence nodes, engineering nodes, user nodes and control sections; priority classification calculation is performed on the configured generalized graph model to obtain a generalized graph model calculation sequence; water balance calculation is performed according to the generalized graph model calculation sequence to obtain the inflow and discharge of each node. The present application can accurately calculate the calculation results of the basic scheduling of water resources, and can be adjusted and improved according to actual conditions, with greater flexibility.

Description

Technical Field

[0001] The present application relates to the technical field of water resource scheduling, and in particular to a water resource scheduling calculation method based on basic water resource configuration and related devices. Background Art

[0002] In recent years, with the continuous growth of the domestic population and the rapid development of the economy, the increasing water demand for production in various industries and residents' lives has made the contradiction between water supply and demand more obvious. In order to obtain better economic benefits, social benefits, ecological and environmental benefits and water resource conservation benefits, reasonable optimization and scheduling of water resources is one of the important means to ensure the above benefits. Water resources optimization scheduling is to optimize the allocation of water resources by combining hydrological data and the actual supply and use of water for residents' daily life, agriculture, industry, municipality and ecological environment, and establish a multi-objective scheduling model, set objective functions and constraints, and obtain the scheduling plan with the highest comprehensive benefits. Before optimizing scheduling, it is necessary to obtain the user's water demand, river water, project water demand and discharge, control section water and ecological discharge targets when water resources are first transported, and perform basic water resource configuration. Rapid and accurate basic water resource configuration and scheduling is an important guarantee for subsequent water resources optimization scheduling.

[0003] At present, researchers at home and abroad often rely on MIKE software when conducting basic water resource configuration. When the structure of the basin water resource scheduling network overview is relatively complex, the manual calculation workload is large and prone to errors. The collaboration of software can greatly reduce the calculation burden. MIKE software is a set of hydraulics and environmental simulation software, which is often used in river water resource management, hydrodynamic model research, water quality simulation, urban flood control planning and other fields. It can help users flexibly configure model parameters and has powerful simulation functions. When configuring water resources, first draw a water resource scheduling overview map according to the basin situation. The overview map consists of nodes and edges. The nodes include inflow, reservoir, user, section, diversion, confluence and other types. Then configure the inflow flow, diversion and confluence node parameters, reservoir initial water level, reservoir water level-area-storage capacity curve, reservoir dead water level and normal water storage level, user water demand and water withdrawal parameters, section ecological flow control constraints and other basic rules, and then perform water resource scheduling calculations. However, due to the software code encapsulation, the algorithm cannot be modified and optimized, and it can only be simulated under the scheduling rules supported by the software. Once new scheduling rules appear in actual needs, the software will not be able to calculate the correct results, so it has certain limitations. Summary of the invention

[0004] The purpose of this application is to provide a water scheduling calculation method and related devices based on the basic configuration of water resources, which can accurately calculate the calculation results of the basic scheduling of water resources, and can be adjusted and improved according to actual conditions, with greater flexibility.

[0005] To achieve the above objectives, this application provides the following solutions:

[0006] In a first aspect, the present application provides a water scheduling calculation method based on basic water resource configuration, and the water scheduling calculation method based on basic water resource configuration includes the following contents:

[0007] Draw a generalized graph model of the dispatching system, and configure the node basic rules of the generalized graph model of the dispatching system to obtain the configured generalized graph model; the generalized graph model of the dispatching system includes: water inlet nodes, branch and confluence nodes, project nodes, user nodes and control sections; the control section is used to monitor the flow of the section to determine whether the flow index is met so as to control the discharge of the corresponding project; the node basic rule configuration is drawn according to the tree structure.

[0008] Priority classification calculation is performed on the configured generalized graph model to obtain a generalized graph model calculation sequence.

[0009] According to the calculation sequence of the generalized graph model, water balance calculation is performed to obtain the incoming water volume and the downstream water volume of each node.

[0010] In a second aspect, the present application provides a computer device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement any of the above-mentioned water scheduling calculation methods based on basic water resource configuration.

[0011] In a third aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements any of the above-mentioned water resource basic configuration-based water scheduling calculation methods.

[0012] In a fourth aspect, the present application provides a computer program product, including a computer program, which, when executed by a processor, implements any of the above-mentioned water resource basic configuration-based water scheduling calculation methods.

[0013] According to the specific embodiments provided in this application, this application discloses the following technical effects:

[0014] The present application provides a method and related device for calculating water scheduling based on basic configuration of water resources. First, a generalized graph model of the scheduling system is drawn, and the node basic rule configuration of the generalized graph model of the scheduling system is performed to obtain the configured generalized graph model; the generalized graph model of the scheduling system includes: water inflow nodes, branch and confluence nodes, engineering nodes, user nodes and control sections; secondly, priority classification calculation is performed on the configured generalized graph model to obtain the calculation sequence of the generalized graph model; then, according to the calculation sequence of the generalized graph model, water balance calculation is performed to obtain the inflow and discharge of each node. The present application uses the basin water resources scheduling overview map and node attribute configuration information as the input of the algorithm, and then obtains the calculation order of each node and calculates according to the order and scheduling rules, so as to obtain the calculation result of the scheduling. The present application improves the operation speed under the premise of accurate calculation results, and provides basic support for the next step of optimizing scheduling; moreover, it can be adjusted and improved according to actual conditions, with greater flexibility. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0016] Figure 1 This is an application environment diagram of a water scheduling calculation method based on basic configuration of water resources in one embodiment of the present application.

[0017] Figure 2 A flow chart of a water quantity scheduling calculation method based on basic configuration of water resources provided in one embodiment of the present application.

[0018] Figure 3 A schematic diagram of the overall framework of a basic scheduling algorithm provided in one embodiment of the present application.

[0019] Figure 4 A schematic diagram of a special user provided for an embodiment of the present application.

[0020] Figure 5 A basic logic diagram of the calculation sequence algorithm provided in one embodiment of the present application.

[0021] Figure 6 A schematic diagram of a test model data sample provided in an embodiment of the present application.

[0022] Figure 7 A schematic diagram of the change in inflow flow of an important confluence node in a model provided in an embodiment of the present application.

[0023] Figure 8 A schematic diagram of actual traffic changes obtained by a user of a model provided in an embodiment of the present application.

[0024] Fig. 9 A schematic diagram of the water level changes in a reservoir in a model provided in an embodiment of the present application.

[0025] Fig.10 A schematic diagram of a second test model data sample provided for an embodiment of the present application.

[0026] Fig.11 A schematic diagram of the changes in the inflow flow rate of an important confluence node in Model 2 provided in an embodiment of the present application.

[0027] Fig.12 This is a schematic diagram of the actual traffic changes obtained by users of Model 2 provided in an embodiment of the present application.

[0028] Fig.13 A schematic diagram of water level changes in the Model 2 reservoir provided in an embodiment of the present application.

[0029] Fig.14 A comparison chart of computing time provided for an embodiment of the present application.

[0030] Fig.15 A schematic diagram of the structure of a computer device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0031] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0032] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0033] In response to the problem of water resource scheduling in domestic river basins, a water scheduling calculation method based on the basic configuration of water resources is proposed, under the premise of knowing the scheduling rules of various water inflows, projects, users, and nodes. This application uses the various scheduling rules of the nodes in the general model to formulate rules for obtaining the calculation order of nodes, and formulates a calculation method based on the calculation order based on the principle of water balance to obtain the inflow and discharge of water at each node. This application constructs a model containing basic scheduling rules for testing and simulation. The experimental results show that the proposed calculation method can accurately obtain water scheduling results, and the calculation efficiency is higher than that of the existing MIKE software (the calculation time of the test model is reduced by about 99.23%).

[0034] The water quantity scheduling calculation method based on water resource basic configuration provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The data storage system can store the data that the server 104 needs to process. The data storage system can be set up separately, integrated on the server 104, or placed on the cloud or other servers. The terminal 102 can send the scheduling system generalization graph model to the server 104. After the server 104 receives the scheduling system generalization graph model, the server 104 performs node basic rule configuration on the scheduling system generalization graph model for the scheduling system generalization graph model to obtain the configured generalization graph model; the scheduling system generalization graph model includes: water inlet nodes, branch flow nodes, engineering nodes, user nodes and control sections; the water inlet node is the water source flowing to each main and tributary stream; the branch flow node is a river node; the engineering node is a reservoir; the user node includes: special The nodes corresponding to the user and the nodes corresponding to the non-special user; the special user is a case where multiple water supply points correspond to one user; the non-special user is a case where one water supply point corresponds to one user; the control section is used to monitor the flow of the section to determine whether the flow index is met to control the discharge of the corresponding project; the node basic rule configuration is drawn according to the tree structure; the configured generalized graph model is subjected to priority classification calculation to obtain the generalized graph model calculation sequence; according to the generalized graph model calculation sequence, the water balance calculation is performed to obtain the incoming water volume and the downstream water volume of each node. The server 104 can feed back the obtained incoming water volume and the downstream water volume to the terminal 102. In addition, in some embodiments, the water scheduling calculation method based on the basic configuration of water resources can also be implemented by the server 104 or the terminal 102 alone, such as the terminal 102 can directly perform water scheduling calculation for the scheduling system generalized graph model, or the server 104 can obtain the scheduling system generalized graph model from the data storage system, and perform water scheduling calculation for the scheduling system generalized graph model.

[0035] The terminal 102 may be, but is not limited to, various desktop computers, laptop computers, smart phones, and tablet computers. The server 104 may be implemented as an independent server or a server cluster consisting of multiple servers, or may be a cloud server.

[0036] In an exemplary embodiment, Figure 2 As shown, a water quantity scheduling calculation method based on water resource basic configuration is provided. The method is executed by a computer device, and can be executed by a computer device such as a terminal or a server alone, or can be executed by a terminal and a server together. In the embodiment of the present application, the method is applied to Figure 1Taking the server 104 in the example as an example, the following steps are included:

[0037] S1: Draw a generalized graph model of the dispatching system, and configure the node basic rules of the generalized graph model of the dispatching system to obtain the configured generalized graph model; the generalized graph model of the dispatching system includes: water inlet nodes, branch and confluence nodes, project nodes, user nodes and control sections; the control section is used to monitor the flow of the section and determine whether the flow index is met to control the discharge of the corresponding project; the node basic rule configuration is drawn according to the tree structure.

[0038] S2: Perform priority classification calculation on the configured generalized graph model to obtain a generalized graph model calculation sequence.

[0039] S3: Perform water balance calculation according to the generalized graph model calculation sequence to obtain the incoming water volume and the downstream water volume of each node.

[0040] like Figure 3 As shown, the calculation method proposed in this application mainly includes three steps: (1) drawing an overview diagram of the scheduling system and configuring the basic rules of the nodes; (2) performing priority classification calculations according to the scheduling rules to obtain the calculation order of the nodes; (3) customizing the scheduling rules for each type of node and performing water balance calculations according to the calculation order.

[0041] As an optional implementation, the water quantity scheduling calculation method based on the basic configuration of water resources further includes the following steps:

[0042] S4: After the initial dispatch is completed, determine whether there is an ecological flow gap in the section according to the calculation order of the control section, and obtain the first judgment result.

[0043] S5: If the first judgment result is yes, the designated project is dispatched to increase the amount of water discharged while ensuring the dead storage capacity, and then a complete dispatch is performed, and the result is returned to "determine whether there is an ecological flow gap in the section in the calculation order of the control section, and obtain the first judgment result".

[0044] S6: If the first judgment result is no, the scheduling calculation is completed.

[0045] It should be noted that steps S4 to S6 are the calculation of a control section. If there are n control sections, each section is judged and calculated in turn according to the section priority. After one section is calculated and fully scheduled, the next section calculation is performed in turn.

[0046] To implement the above steps S1 to S6, first, it is necessary to draw the corresponding basin water resources dispatch overview map according to the actual project situation, and configure the parameters according to each node category. Then, a set of algorithms for obtaining the unit calculation order is proposed, and each node is calculated in turn according to the calculation order. After the initial dispatch calculation is completed, the cross-section ecological flow control is considered for iterative calculation. Finally, data is sorted according to the water volume information such as water inflow of each unit, reservoir water level change, reservoir discharge, reservoir water supply, actual water acquisition and withdrawal of users, and cross-section water inflow, so as to provide basic data support for the next step of water resources dispatch optimization.

[0047] The node basic rule configuration is as follows.

[0048] According to the characteristics of domestic river basin project distribution and water resources scheduling, the overview model is mainly composed of water inflow nodes, diversion and confluence nodes, project nodes, user nodes and control sections. Among them, the water inflow node is the water source flowing to each main and tributary; the diversion and confluence node is the river node; the project node mainly refers to the reservoir; the user node includes: nodes corresponding to special users and nodes corresponding to non-special users (domestic water, industrial and agricultural water, and ecological water, etc.); the control section is used to monitor the flow of the monitoring section to determine whether the flow index is met and thus control the discharge of the corresponding project. The configuration rules for each node are shown in Table 1.

[0049] Table 1 Configuration rules and contents of the general planning unit

[0050]

[0051] Configure each node according to the above rules and content and draw it in a tree structure, that is, take a main stream as the trunk and mark it as level 1, and spread outward in the form of branches. The level increases by 1 each time it spreads until all nodes are included. Each branch should be a one-way propagation except for users and diversion nodes.

[0052] As an optional implementation, in step S2, the following contents are specifically included.

[0053] S21: Initialize a sequential storage container, a temporary container and a branch level container; the branch level container is an initial seed point set.

[0054] S22: Obtain all water supply nodes, and store them in the branch level container in sequence according to the branch level.

[0055] S23: Calculate from the smallest branch of the tree structure to determine the current node type.

[0056] S24: completing the traversal of all nodes according to the current node type, the sequence storage container, the temporary container, and the branch level container.

[0057] S25: After all nodes are traversed, a new seed point set is obtained, and it is determined whether the new seed point set is empty to obtain a second determination result.

[0058] S26: If the second judgment result is yes, stop the overall cycle.

[0059] S27: If the second judgment result is no, traverse the nodes corresponding to each special user, and judge whether the nodes corresponding to each special user are in the temporary container to obtain a third judgment result.

[0060] S28: If the third judgment result is yes, the corresponding water supply point is added to the sequential storage container according to the user's water intake priority, and the users corresponding to the water supply point are also added to the sequential storage container according to the priority. The corresponding water intake point is removed from the new seed set, and the river node at the next level of the water intake point that is consistent with the water intake point is added to the new seed point set, and the new seed point set is used as the initial seed point set, and the return is "Get all water incoming nodes, and store them in the branch level container in sequence according to the branch level".

[0061] S29: If the third judgment result is no, the overall cycle is stopped.

[0062] S210: When all seed points are calculated and sorted or there are no seed points, a generalized graph model calculation sequence is obtained.

[0063] In an exemplary embodiment, if the current node is a water inlet node or a control section, all nodes are traversed according to the current node type, the sequence storage container, the temporary container and the branch level container, including the following contents.

[0064] A1: If the current node is a water supply node or a control section, the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain a fourth determination result.

[0065] A2: If the fourth judgment result is yes, the next non-user node is used as the current node, and "determine the current node type" is returned.

[0066] A3: If the fourth judgment result is no, stop the current sub-loop.

[0067] In an exemplary embodiment, if the current node is an ordinary node without diversion, and the current node is a water supply node corresponding to a non-special user, and all previous nodes have been traversed, the traversal of all nodes is completed according to the current node type, the sequential storage container, the temporary container and the branch level container, specifically including the following contents.

[0068] B1: If the current node is an ordinary node without diversion, and the current node is a water supply node corresponding to a non-special user, and the previous nodes have been traversed, then the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain the fifth judgment result.

[0069] B2: If the fifth judgment result is yes, the next non-user node is used as the current node, and "judging the current node type" is returned.

[0070] B3: If the fifth judgment result is no, stop the current sub-loop.

[0071] B4: If the current node is a water supply node corresponding to a non-special user and the previous nodes have not been completely traversed, the current node is added to the score level container of the corresponding level and the current sub-loop is stopped.

[0072] B5: If the current node is a water supply node corresponding to a special user, the current node is placed in a temporary container and added to the score level container of the corresponding level, and the current sub-cycle is stopped.

[0073] In an exemplary embodiment, if the current node is a branch node, traversal of all nodes is completed according to the current node type, the sequence storage container, the temporary container, and the branch level container, which specifically includes the following contents.

[0074] C1: If the current node is a diversion node, put the current node into a sequential storage container, calculate the diversion line nodes first, and add the diversion line nodes to the sequential storage container in sequence.

[0075] C2: If there is a water supply user at the current diversion line node, add it to the calculation order in sequence according to the water supply priority, and continuously update the water diversion node until there are multiple non-user nodes upstream of the current water diversion node, then stop the water diversion line calculation; and determine whether there is a next non-user node, and whether the level of the next non-user node is consistent with the current node level, to obtain the sixth judgment result.

[0076] C3: If the sixth judgment result is yes, the next non-user node is used as the current node, and the process returns to "judging the current node type".

[0077] C4: If the sixth judgment result is no, stop the current sub-cycle.

[0078] In an exemplary embodiment, if the current node is a reservoir and is not a reservoir corresponding to a special user, the traversal of all nodes is completed according to the current node type, the sequential storage container, the temporary container and the branch level container, which specifically includes the following contents.

[0079] D1: If the current node is a reservoir and is not a reservoir corresponding to a special user, the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain the seventh judgment result.

[0080] D2: If the seventh judgment result is yes, the next non-user node is used as the current node, and "judging the current node type" is returned.

[0081] D3: If the seventh judgment result is no, stop the current sub-cycle.

[0082] D4: If the current node is a reservoir and it is the reservoir corresponding to the special user, the current node is placed in a temporary container and added to the score level container of the corresponding level, and the current sub-loop is stopped.

[0083] Specifically, the method for obtaining the calculation order is as follows.

[0084] Rapidly and correctly obtaining the node calculation order is the most critical step of this application, which directly determines the accuracy of subsequent calculations. In view of the complexity and diversity of basin water resources scheduling, this application proposes a method for quickly obtaining the calculation order.

[0085] First, count the number of users corresponding to multiple water supply points and store the corresponding situations, such as Figure 4 shown.

[0086] Initialize the order storage container , Temporary Container And branch level container , extract all water supply nodes and store them in the branch level container in order according to the branch level :

[0087] (1);

[0088] in, Represents the current water inflow node.

[0089] With the above As the initial seed point, start traversal calculation. Start from the level number from large to small, that is, ensure that the calculation starts from the smallest branch of the tree structure. For example, for Container, start traversing from right to left, when traversing to When the elements in the collection are used as the starting point of the loop in order, the current water node Put in In, from Start the sub-loop (after the loop, the seed point is no longer the water node) and make a judgment based on the current node type.

[0090] (1) If the current node is a water inflow node or a control section, Put in Update The next non-user node of the current node. If the updated node level is inconsistent with the level of the current node or there is no next non-user node, the current sub-loop is stopped.

[0091] (2) If the current node is a common node and there is no diversion, it is further divided into the following cases. If the current node is a water supply node corresponding to a non-special user and the previous nodes have been calculated, the current node Put in Update The next non-user node of the current point. If there is no next non-user node, stop the current sub-loop; if the current node is a water supply node corresponding to a non-special user and the previous node has not been completely calculated, add the current node to the corresponding level In the container, stop the current sub-cycle; if the current node is the water supply node corresponding to a special user, put it into a temporary container and add it to the corresponding level In the container, stop the current sub-loop; if the level of the new current point updated by the above conditions is inconsistent with the previous one, stop the current sub-loop.

[0092] (3) If the current node is a diversion node, change the current water inflow node Put in In the example, the shunt line nodes are calculated first, and then the shunt line nodes are added to In the process, if there is a water supply user at the current diversion line node, it is added to the calculation order in sequence according to the water supply priority, and the diversion nodes are continuously updated until there are multiple non-user nodes upstream of the current diversion node, and the diversion line calculation is stopped. After calculating the diversion, the current node is updated to the next non-user node. If the next node level is inconsistent or does not exist, the current sub-loop is stopped.

[0093] (4) If the current node is a reservoir and is not the reservoir corresponding to a special user, add it to In the , add the corresponding users according to the priority In the process, update the next node. If there is no next node, stop the current sub-loop. If it is a reservoir corresponding to a special user, put it into a temporary container. and add it to the corresponding level In the container, stop the current sub-loop; if the level of the new current point updated by the above conditions is inconsistent with the previous one, stop the current sub-loop.

[0094] After completing the above steps, a new set of seed points will be obtained. ,if If it is empty, stop the total loop; if there is a seed point, first process the water supply node corresponding to the special user, traverse the nodes corresponding to each special user, and if all the corresponding nodes are in the temporary container In the case of water supply points, the corresponding water supply points will be added according to the user's water collection priority. At the same time, the users corresponding to the water supply points are also added according to the priority , change the water intake point from Remove it from the , and add the river node with the same level as the water intake point as the seed point ,Will As a new set of initial seed points, repeat the above steps until all seed points are calculated and sorted or there are no seed nodes. So far, the calculation sequence of the overview model is obtained. The above basic calculation logic is as follows Figure 5 shown.

[0095] The node unit calculation specifically includes the following contents.

[0096] Each node is calculated in sequence according to the node calculation order. The section is treated as an ordinary node in the first calculation, and then the corresponding control project is updated in sequence according to the ecological discharge of each section. The calculation categories mainly include incoming water nodes, ordinary nodes (without water diversion and users), control sections, water diversion nodes, water supply nodes, reservoirs, and users.

[0097] (1) Water inflow nodes, common nodes, and control sections.

[0098] The water inflow is the initial input of the model, expressed as a one-dimensional array input by year, month, and decade:

[0099] (2);

[0100] in, is the water inflow value of any water inflow node, is the water inflow value of the common node, To control the water inflow value of the section, is the current water inflow node, is the current common node, The current control section.

[0101] For the above node, the amount of water delivered to the next node is the same as the input:

[0102] (3);

[0103] in, is the water volume of the next water inflow node, is the water volume of the next common node, is the water volume of the next control section.

[0104] (2) Water diversion node.

[0105] The watershed node passes the obtained value to the watershed point and the next node in turn. It is known that the value passed to the watershed node is:

[0106] (4);

[0107] in, is the water inflow value of the water distribution node, The current water splitting node.

[0108] The relationship function between the water inflow value and the water diversion value of the water diversion node is:

[0109] (5);

[0110] The output water value is:

[0111] (6);

[0112] The amount of water transferred to the next node is:

[0113] (7);

[0114] (3) Water supply node.

[0115] The water supply node indicates that there are users downstream of the node. In principle, water is supplied to users according to the maximum water supply capacity of the node. The value obtained by the current node is known to be:

[0116] (8);

[0117] in, is the water supply value of the water supply node, It is the current water supply node.

[0118] The node needs to supply water to each user, and the total demand is:

[0119] (9);

[0120] in, is the total water demand, For the k The water supply demand of each user.

[0121] Water is supplied in sequence according to the user's water supply priority until all users or nodes are fully supplied:

[0122] (10);

[0123] After the water supply is completed, the user's water return is calculated to the corresponding node. If the user has already calculated the water return, the corresponding difference is added to the water return node according to the proportion. If there is still water left after supplying the user, it will be discharged normally:

[0124] (11);

[0125] in, The amount of water discharged.

[0126] (4) Reservoir scheduling.

[0127] The initial dispatching rule of the reservoir is to give priority to ensuring the dead water level of the reservoir, then to discharge water to the minimum level, and finally to supply water to users. The water inflow to the reservoir is known to be:

[0128] (12);

[0129] The initial reservoir water storage capacity is calculated based on the reservoir initial water level and water level storage capacity curve. If the total water volume after adding the incoming water is ,like Value is less than dead storage capacity , no discharge will be made and no water will be supplied to users; if the value is greater than the dead storage capacity , the water that meets the dead storage capacity will be discharged to the minimum If there is still water left, water will be supplied to users in order of priority. After all users are satisfied, the excess water will be put into the reservoir. If it exceeds the normal water storage capacity , the excess water is discharged, which can be expressed as:

[0130] (13);

[0131] (5) User calculation.

[0132] When other types of nodes are involved in supplying water to users, the corresponding water supply information is added to the user to obtain the actual amount of water obtained by the user. However, when performing single node calculations, each user may be calculated multiple times by other nodes. Therefore, for the user, the actual amount of water obtained by the user must be counted after all nodes have completed the calculation. Only the amount of water returned from the current water is calculated. The current amount of water obtained by the user is:

[0133] (14);

[0134] in, The current amount of water consumed by the user. The current user node.

[0135] The amount of water returned to multiple nodes is:

[0136] (15);

[0137] in, is the water withdrawal amount at the withdrawal target node, is the corresponding water receding coefficient, is the number of water withdrawal nodes.

[0138] (6) Section ecological flow control.

[0139] When the calculation is performed for the first time, the above five situations are considered to complete the initial dispatch of the model. After that, the section is judged in turn according to the calculation order of the control section to determine whether there is an ecological flow gap. If there is, the designated project is dispatched to increase the discharge volume under the premise of ensuring the dead storage capacity, and then a complete dispatch is performed. Then the next section is determined and calculated, and so on until all sections are calculated.

[0140] The ecological flow control calculation of a single control section only needs to be calculated once according to the ecological flow gap. It is known that the water inflow of a certain section is:

[0141] (16);

[0142] The water volume constraint of the ecological flow control of this section is:

[0143] (17);

[0144] The cross-section ecological flow gap is:

[0145] (18);

[0146] It represents the evaporation coefficient of the specified project to the section, and its value satisfies:

[0147] (19);

[0148] Update the minimum discharge for a specified dispatching project :

[0149] (20);

[0150] Finally, reschedule in node order until all sections are calculated.

[0151] This application constructs two sets of sample data, which include most of the domestic water resources dispatching situations, and sets the water flow rate to be 12 months, in units of During the calculation process, the unit of reservoir water volume is , area unit is , water level unit is . At the same time, configure the water distribution ratio curve of the water distribution point, the ecological control flow of the section, the evaporation coefficient, the reservoir water level-area-storage capacity curve, the initial water level of the reservoir and the minimum discharge, the dead water level of the reservoir and the normal water storage level, the reservoir water supply target and priority, the user water withdrawal target and priority, the user water withdrawal target and water withdrawal coefficient, etc. The calculation method of this application is implemented in Python language, and the two sets of data are simulated and calculated.

[0152] (1) Experiment 1.

[0153] The dendrogram of Experiment 1 is shown in Figure 6 As shown. The arrow lines in the figure contain the flow information of water at each node. The numbers next to the nodes are node numbers and do not represent the calculation order. Starting from the water node, flowing downstream along the arrow, the first level represents the trunk, that is, the main stream of the basin, the second level represents the first-level tributary of the main stream, and so on. The calculation order obtained by the algorithm of this model is:

[0154] (twenty one);

[0155] Table 2 shows the main initial configuration data of each project node, including initial water flow, ecological flow constraint of control section, dead water level of each reservoir, normal water storage level, initial water level, user water demand and water withdrawal ratio. Among them, the initial water level of node 3 is 143m, the initial water level of node 13 is 143m, the initial water level of node 19 is 84.5m, and the initial water level of node 25 is 105m.

[0156] Table 2 Main parameter configuration table of model 1

[0157]

[0158] The calculation results using the algorithm of this application are shown in Table 3. Figure 7 It shows the changes of the inflow flow of an important confluence node in the model. Figure 8 It shows the changes in the actual traffic obtained by users of model 1. Fig. 9 The changes in the water level of the model 1 reservoir are shown.

[0159] Table 3 Calculation results of model 1

[0160]

[0161] (2) Experiment 2.

[0162] like Fig.10As shown, the second test model of this embodiment increases the tributaries to the third-level tributaries. The water supply of the reservoir and the water withdrawal and withdrawal of users are more complicated. Without adjusting the algorithm code of this article, the correct calculation results can still be obtained. The initial water level of node 3 is 143m, the initial water level of node 10 is 101m, the initial water level of node 16 is 84.5m, and the initial water level of node 25 is 105m. The calculation order obtained by the algorithm of this model is:

[0163] (twenty two);

[0164] Table 4 shows the main initial configuration data of each engineering node of Model 2, and the calculation results are shown in Table 5.

[0165] Table 4 Main parameter configuration of model 2

[0166]

[0167] Table 5 Calculation results of model 2

[0168]

[0169] Fig.11 The changes in the inflow flow of important confluence nodes in model 2 are shown. Fig.12 It shows the changes in the actual traffic obtained by users in model 2. Fig.13 The changes in the water level of the model 2 reservoir are shown.

[0170] (3) Comparative experiment

[0171] This application uses MIKE software to simulate and calculate two sets of data, and compares the calculation accuracy and efficiency with the calculation method of this application. The experimental results show that the two sets of data calculated by this application are completely consistent with those of MIKE software, and the calculation speed is significantly higher than that of MIKE software. The calculation time comparison chart is as follows Fig.14 shown.

[0172] Through the verification of test results and experimental comparison, it is shown that the method proposed in this application has certain advantages. From the two groups of simulation experiments, the algorithm of this application can accurately calculate the calculation results of the basic scheduling of water resources. In addition, no calculation errors occurred for the two different groups of network structure diagrams, indicating that the algorithm has certain applicability. From the comparative experiments, in addition to the accurate calculation results, the calculation efficiency of the algorithm of this application has also been greatly improved. Taking two groups of test data as an example, the calculation speed is increased by about 99.23% compared with the MIKE software, and in more complex water resources scheduling network diagrams (such as thousands of computing nodes), the benefits of calculation efficiency will be more obvious. In addition, the algorithm of this application can be adjusted and improved according to actual conditions to make it more flexible.

[0173] The algorithm takes the basin water resources dispatch overview map and node attribute configuration information as the input of the algorithm, then obtains the calculation order of each node and calculates according to the order and dispatch rules to obtain the calculation results of the dispatch. The results show that the algorithm improves the calculation speed while providing accurate calculation results, providing basic support for the next step of optimized dispatch.

[0174] In an exemplary embodiment, a computer device is provided. The computer device may be a server or a terminal. The internal structure diagram thereof may be as follows: Fig.15 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store a generalized diagram model of the scheduling system. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a water scheduling calculation method based on the basic configuration of water resources is implemented.

[0175] Those skilled in the art will understand that Fig.15 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0176] In an exemplary embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the above-mentioned method embodiments are implemented when the processor executes the computer program.

[0177] In an exemplary embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by a processor, the above-mentioned method embodiments are implemented.

[0178] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the above-mentioned method embodiments are implemented.

[0179] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0180] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM may be in various forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM).

[0181] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but is not limited thereto.

[0182] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0183] This article uses specific examples to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application. At the same time, for those skilled in the art, according to the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.

Claims

1. A water quantity scheduling calculation method based on water resources basic configuration, characterized in that: The water quantity scheduling calculation method based on the basic configuration of water resources includes: Draw a generalized graph model of the dispatching system, and configure the node basic rules of the generalized graph model of the dispatching system to obtain the configured generalized graph model; the generalized graph model of the dispatching system includes: water inflow nodes, branch and confluence nodes, project nodes, user nodes and control sections; the control section is used to monitor the flow of the section to determine whether the flow index is met so as to control the discharge of the corresponding project; the node basic rule configuration is drawn according to the tree structure; Performing priority classification calculation on the configured generalized graph model to obtain a generalized graph model calculation sequence; According to the calculation sequence of the generalized graph model, water balance calculation is performed to obtain the water inflow and water discharge of each node; The configured generalized graph model is subjected to priority classification calculation to obtain a generalized graph model calculation sequence, which specifically includes: Initialize sequential storage containers, temporary containers and branch level containers; the branch level container is an initial seed point set; Get all water supply nodes and store them in the branch level container in order according to the branch level; Start calculating from the smallest branch of the tree structure and determine the current node type; Complete traversal of all nodes according to the current node type, the sequential storage container, the temporary container, and the branch level container; After all nodes are traversed, a new seed point set is obtained, and it is determined whether the new seed point set is empty to obtain a second determination result; If the second judgment result is yes, then stop the overall cycle; If the second judgment result is no, then traverse the nodes corresponding to each special user, and judge whether the nodes corresponding to each special user are in the temporary container, and obtain the third judgment result; the special user is a situation where multiple water supply points correspond to one user; If the third judgment result is yes, then the corresponding water supply point is added to the sequential storage container according to the user's water intake priority, and the user corresponding to the water supply point is also added to the sequential storage container according to the priority, the corresponding water intake point is removed from the new seed set, and the river node with the next level of the water intake point consistent with the water intake point is added to the new seed point set, and the new seed point set is used as the initial seed point set, and "obtain all water supply nodes, and store them in the branch level container in sequence according to the branch level" is returned; If the third judgment result is no, then the overall cycle is stopped; When all seed points are calculated and sorted or there are no seed points, a generalized graph model calculation sequence is obtained.

2. The water quantity dispatching calculation method based on water resources basic configuration according to claim 1 is characterized in that: The water quantity scheduling calculation method based on the basic configuration of water resources also includes: After the initial dispatch is completed, the calculation sequence of the control sections is used to determine whether there is an ecological flow gap in the section, and the first judgment result is obtained; If the first judgment result is yes, the designated project is dispatched to increase the discharge volume under the premise of ensuring the dead storage capacity, and a complete dispatch is performed again, and "according to the calculation order of the control section, it is judged whether there is an ecological flow gap in the section, and the first judgment result is obtained" is returned; If the first judgment result is no, the scheduling calculation is completed.

3. The water quantity dispatching calculation method based on water resources basic configuration according to claim 1 is characterized in that: According to the current node type, the sequential storage container, the temporary container, and the branch level container, traversing all nodes is completed, specifically including: If the current node is a water supply node or a control section, the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain a fourth determination result; If the fourth judgment result is yes, the next non-user node is used as the current node, and "determine the current node type" is returned; If the fourth determination result is no, the current sub-cycle is stopped.

4. The water quantity dispatching calculation method based on water resources basic configuration according to claim 1 is characterized in that: According to the current node type, the sequential storage container, the temporary container, and the branch level container, traversing all nodes is completed, specifically including: If the current node is a common node without diversion, and the current node is a water supply node corresponding to a non-special user, and the previous nodes have been traversed, the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain a fifth judgment result; the non-special user is a situation where one water supply point corresponds to one user; If the fifth judgment result is yes, the next non-user node is used as the current node, and "determine the current node type" is returned; If the fifth judgment result is no, then stop the current sub-loop; If the current node is a water supply node corresponding to a non-special user and the previous node has not been completely traversed, the current node is added to the branch level container of the corresponding level and the current sub-loop is stopped; If the current node is a water supply node corresponding to a special user, the current node is placed in a temporary container and added to the branch level container of the corresponding level, and the current sub-loop is stopped.

5. The water quantity dispatching calculation method based on water resources basic configuration according to claim 1 is characterized in that: According to the current node type, the sequential storage container, the temporary container, and the branch level container, traversing all nodes is completed, specifically including: If the current node is a shunt node, the current node is placed in a sequential storage container, the shunt line nodes are calculated first, and the shunt line nodes are added to the sequential storage container in sequence; If there is a water supply user at the current diversion line node, add it to the calculation order in sequence according to the water supply priority, and continuously update the diversion node until there are multiple non-user nodes upstream of the current diversion node, then stop the diversion line calculation; and determine whether there is a next non-user node, and whether the level of the next non-user node is consistent with the level of the current node, to obtain a sixth determination result; If the sixth judgment result is yes, the next non-user node is used as the current node, and "determine the current node type" is returned; If the sixth judgment result is no, the current sub-cycle is stopped.

6. The water quantity dispatching calculation method based on water resources basic configuration according to claim 1 is characterized in that: According to the current node type, the sequential storage container, the temporary container, and the branch level container, traversing all nodes is completed, specifically including: If the current node is a reservoir and is not a reservoir corresponding to a special user, the current node is placed in a sequential storage container, and it is determined whether there is a next non-user node and whether the level of the next non-user node is consistent with the level of the current node, to obtain a seventh determination result; If the seventh judgment result is yes, the next non-user node is used as the current node, and "determine the current node type" is returned; If the seventh judgment result is no, then stop the current sub-loop; If the current node is a reservoir, and it is the reservoir corresponding to the special user, the current node is placed in a temporary container, and added to the branch level container of the corresponding level, and the current sub-loop is stopped.

7. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the water scheduling calculation method based on the basic configuration of water resources as described in any one of claims 1 to 6.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the water quantity scheduling calculation method based on the basic configuration of water resources described in any one of claims 1 to 6 is implemented.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the water quantity scheduling calculation method based on the basic configuration of water resources described in any one of claims 1 to 6 is implemented.

Images