Intelligent scheduling method and system for hydraulic engineering

Abstract

The invention discloses a hydraulic engineering intelligent scheduling method and system, and belongs to the technical field of hydraulic engineering scheduling. The system comprises a data collection module, a supply and demand analysis module, a scheme design module and a scheduling control module. The data collection module is used for collecting water transfer records of a water delivery line and a reservoir; the supply and demand analysis module is used for calling a visual model to identify water demanders and water source parties and analyzing matching indexes between the water source parties and the water demanders; the scheme design module is used for establishing a scheme library for each water demand party according to the matching index, setting a water supply party and adding the water supply party into the scheme library; and the scheduling control module is used for planning an optimal path according to the scheme library, generating a scheduling plan, pushing the scheduling plan to each reservoir for execution and obtaining feedback. The system effectively improves the water resource management efficiency and reduces the energy consumption through real-time data analysis and dynamic optimization of the water source path, and ensures that the water supply amount meets the demand.

Description

Technical Field

[0001] The present invention relates to the technical field of water conservancy dispatching, and in particular to an intelligent dispatching method and system for water conservancy projects. Background Art

[0002] With the global population growth and economic development, the demand for water resources continues to increase, and the problem of water shortage has become more serious. Intelligent scheduling technology can help achieve the optimal allocation of water resources and improve water utilization.

[0003] At present, the scheduling of water conservancy projects usually adopts the principle of proximity scheduling, and the water in the water supply reservoir is dispatched to the nearest water demand reservoir through gates or pump pressure. This method has certain disadvantages. On the one hand, the actual situation is complex and changeable. In the case of general water shortage, it is usually necessary to pump water from multiple reservoirs to meet the requirements of a water demand reservoir. The scheduling method based on the principle of proximity lacks systematic planning and rational analysis, which may cause the abuse of pump pressure scheduling and lead to energy waste, which does not meet the requirements of low-carbon environmental protection. On the other hand, due to the differences in gate equipment and pump station equipment between different reservoirs, there are inconsistent energy consumption utilization rates in actual use. Under the same circumstances, the energy utilization rate of gate discharge is higher than that of pump pressure pumping. Or when the same unit of water resources is taken, the total energy consumption of pump pressure pumping in different reservoirs is also quite different. Therefore, at this stage, a more efficient and intelligent water conservancy scheduling technology solution is needed to solve the above problems. Summary of the invention

[0004] The purpose of the present invention is to provide a method and system for intelligent scheduling of water conservancy projects to solve the problems raised in the above background technology.

[0005] In order to solve the above technical problems, the present invention provides a water conservancy project intelligent scheduling method, comprising the following steps: S100. Collect water transfer routes and reservoir water transfer records.

[0006] S200: Calling a visualization model to identify water demanders and water sources, and analyzing matching indexes of water sources.

[0007] S300: Establish a solution library for each water demander according to the matching index, set the water supplier and add it to the solution library.

[0008] S400. Plan the best path according to the solution library, generate a dispatch plan, push it to each reservoir for execution and obtain feedback.

[0009] Further, in S100, the water transfer route includes a description of the transfer relationship of water resources between different reservoirs, the transfer relationship includes type and direction, and the type includes gate transfer and pump pressure transfer. Each water transfer record includes the transfer object, transfer method, transfer time, water transfer volume and power consumption.

[0010] Sluice gate transfer refers to transferring water from a reservoir to another reservoir at a lower altitude by opening the gate, while pumping transfer refers to extracting water from a reservoir and transferring it to another reservoir through a pumping station. Generally speaking, sluice gate transfer consumes less electricity than pumping transfer.

[0011] The visualization model refers to a three-dimensional model constructed using digital twin technology based on the topographic structure, location, altitude and hydrological characteristics of each reservoir. Sensors are used to collect changes in the hydrological characteristics of each reservoir in reality and map them to the visualization model in real time. Hydrological characteristics include water level and water storage capacity.

[0012] Further, S200 includes the following steps: S201. Set warning values ​​for each reservoir, and use the reservoirs with water levels below the warning values ​​in the visualization model as water demanders, and calculate the water demand based on the water storage capacity and the difference between the water level and the warning value. Analyze the location and water delivery direction of the water demander Q in the water delivery route, and use all reservoirs that can deliver water to the water demander Q and are not water demanders as their water sources.

[0013] Direct water delivery to the water demander Q refers to the water delivery method that is upstream of Q according to the water delivery direction, and there are no other reservoirs in between. Indirect water delivery to the water demander Q refers to the water delivery method that is upstream of Q according to the water delivery direction, and there are several other reservoirs in between.

[0014] S202, starting from the water source and ending at the water demand Q, plan all paths between a water demand and multiple water sources, analyze all reservoirs included in each path, and select the water transfer record with the largest water transfer volume between every two adjacent reservoirs as a reference record. Obtain the water transfer volume SL in each reference record e , Power consumption HD e and delivery time SC e , according to the formula: The conveying speed SG is calculated.

[0015] When there are adjacent reservoirs on the path and the water transfer direction is from reservoir C1 to reservoir C2, all water transfer records of C1 are obtained and the water transfer records whose transfer object is C2 are screened out. Among these water transfer records, the water transfer record with the largest water transfer volume is found as the reference record for the group of adjacent reservoirs from reservoir C1 to reservoir C2.

[0016] S203, set standard flow rate SG preand constant α, to obtain the minimum conveying speed SG among all reference records min , substitute into the formula to calculate the first coefficient X of each path; the highest first coefficient X among all paths belonging to a water demand party and the corresponding water source party max As the matching index of the water source, the first coefficient calculation formula is as follows: ; In the formula, r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path; and so on, the matching index of each water source under each water demander is calculated respectively.

[0017] The path corresponding to the highest first coefficient is selected as the default fixed path of the water source, and this fixed path is used by default for analysis and replanning in subsequent path planning.

[0018] Further, S300 includes the following steps: S301: Establish a solution library for the water demander Q, obtain the matching index and water storage capacity of the corresponding water source, calculate the water supply according to the water storage capacity and the difference between the water level and the warning value, and sort all water sources in descending order according to the matching index.

[0019] S302, according to the arrangement order, the water sources are added to the solution library one by one as water suppliers, and the sum of the water supply of all water suppliers in the solution library is calculated after each addition. If h is not less than d, no more water suppliers will be added. If h is less than d, water suppliers will continue to be added until h is not less than d. A solution library is established for each water demander and water suppliers are added according to the above method.

[0020] Ensure that the sum of the water supplies of all water suppliers in the solution library of each water source is not less than the water demand, and that there is at least one or more water suppliers in each solution library.

[0021] S303: Obtain the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyze the water transfer volume in each reference record under the path and power consumption , substitute into the formula to calculate the energy consumption coefficient of the corresponding path of the water supply m0 , and its calculation formula is: ; Where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d.

[0022] Calculate the energy consumption coefficient of the corresponding path of each water supplier and the energy consumption coefficient of the corresponding path of each water supplier under each water demander.

[0023] Further, S400 includes the following steps: S401. Mark all water suppliers in the water supply route and analyze the water supply direction; obtain the water supply volume GS1 of water supplier m1 and use m1 as a child node. The water supplier m2 that can supply water to m1 and whose water supply volume is greater than GS1 is used as the parent node of m1.

[0024] Each child node can be the parent node of multiple other nodes, or the child node of multiple other nodes. Child nodes and parent nodes are not fixed attributes of the water supplier, but the relative relationship status between them and other water suppliers.

[0025] S402. Establish a tree relationship diagram based on the parent-child node relationship between water suppliers. Obtain the water supply GS3 of the parent node m3 and the water supply of each child node under m3, and freely combine all child nodes under the condition that the total water supply is not greater than GS3. Take the parent node m3 as the starting point, and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points to plan the path, calculate the energy consumption coefficient of each path respectively, and select the lowest energy consumption coefficient as the second coefficient E2 of the corresponding combination.

[0026] S403, according to the formula: Calculate the third coefficient E3, select the combination with the highest third coefficient greater than zero as the optimal combination; take the path corresponding to the lowest energy consumption index of the optimal combination as the optimal path, and use the parent node m3 as the new water supplier for all water suppliers in the optimal combination corresponding to the water demander. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination; It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination.

[0027] The best path only represents the best choice of path between the parent node and all water suppliers in the optimal combination corresponding to the water demanders in the single-layer parent-child node relationship network. After the best path replacement is completed, the same method is used to continue to explore whether there is an optimal path in the node relationship network above the original parent node, and the path is continuously optimized through multiple iterations.

[0028] S404, and so on, continuously plan the best path for each water demander according to the tree relationship diagram. When all water demanders no longer have the optimal combination, a dispatch plan is generated according to the current path and pushed to the dispatch center. The dispatch center sends a water transfer instruction according to the path in the dispatch plan and the water supply of each water supplier, and each reservoir responds and executes and feeds back the water transfer record.

[0029] The present invention also provides a water conservancy project intelligent dispatching system, comprising a data collection module, a supply and demand analysis module, a scheme design module and a dispatching control module.

[0030] The data collection module is used to collect water transfer records of water delivery routes and reservoirs.

[0031] The supply and demand analysis module is used to call the visualization model to identify water demanders and their water sources, and to analyze the matching index between each water source and water demander.

[0032] The scheme design module is used to establish a scheme library for each water demander according to the matching index, set the water supplier and add it to the scheme library.

[0033] The dispatching control module is used to plan the best path according to the solution library, generate a dispatching plan, push it to each reservoir for execution and obtain feedback.

[0034] The data collection module includes a water diversion record collection unit, a route data collection unit and a hydrological information collection unit.

[0035] The water transfer record collection unit is used to collect the water transfer records of each reservoir each time the water resources are transferred out. The water transfer records include the delivery object, delivery method, delivery time, water transfer volume and power consumption.

[0036] The route data collection unit is used to collect water delivery routes. The water delivery routes include the relationship between water resources delivery between different reservoirs, the delivery relationship includes type and direction, and the types include gate delivery and pump pressure delivery.

[0037] The hydrological information acquisition unit is used to collect the topographic structure, location direction, altitude and hydrological characteristics of each reservoir. Hydrological characteristics include water level and water storage capacity. A visual model is constructed based on the collected data and mapped in real time.

[0038] Furthermore, the supply and demand analysis module includes a water use analysis unit and a supply and demand matching unit.

[0039] The water use analysis unit is used to identify water demanders and their water sources.

[0040] First, set a warning value for each reservoir, take the reservoir whose water level in the visualization model is lower than the warning value as the water demander, and calculate the water demand based on the water storage capacity and the difference between the water level and the warning value.

[0041] Then analyze the location and water delivery direction of the water demander Q in the water delivery route, and regard all reservoirs that can deliver water to the water demander Q and are not water demanders as water sources for the water demander Q.

[0042] The supply and demand matching unit is used to calculate the matching index of each water source.

[0043] Firstly, taking the water source as the starting point and the water demand Q as the end point, all paths between a water demand and multiple water sources are planned, all reservoirs included in each path are analyzed, and the water transfer record with the largest water transfer volume between every two adjacent reservoirs is selected as the reference record.

[0044] Secondly, obtain the water transfer volume SL in each reference record e , Power consumption HD eand delivery time SC e , according to the formula: The conveying speed SG is calculated.

[0045] Then, set the standard flow rate SG pre and constant α, to obtain the minimum conveying speed SG among all reference records min , according to the formula Calculate the first coefficient of each path. Where r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path.

[0046] Finally, the highest first coefficient X among all paths belonging to a water demand party and the corresponding water source party is max As the matching index of the water source, and so on, calculate the matching index of each water source under each water demand.

[0047] Furthermore, the solution design module includes a solution library establishment unit and an energy consumption calculation unit.

[0048] The solution library establishment unit is used to establish a solution library for each water demander.

[0049] First, a solution library is established for the water demand party Q to obtain the matching index and water storage capacity of the corresponding water source party.

[0050] Secondly, the water supply is calculated based on the water storage capacity and the difference between the water level and the warning value, and all water sources are ranked in descending order according to the matching index.

[0051] Then, the water sources are added to the solution library as water suppliers one by one according to the arrangement order, and the sum of the water supply h of all water suppliers in the solution library is calculated after each addition.

[0052] Finally, when h is not less than d, no more water suppliers will be added. If h is less than d, water suppliers will continue to be added until h is not less than d. A solution library is established for each water demander and water suppliers are added according to the above method.

[0053] The energy consumption calculation unit is used to calculate the energy consumption coefficient of the corresponding path of each water supplier under the water demand party.

[0054] First, obtain the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyze the water transfer volume SL in each reference record under the path z v and power consumption HD z v .

[0055] Secondly, according to the formula: Calculate the energy consumption coefficient of the path corresponding to the water supplier m0. Where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d.

[0056] Finally, the energy consumption coefficients of the corresponding paths of each water supplier and the energy consumption coefficients of the corresponding paths of each water supplier under each water demander are calculated respectively.

[0057] Furthermore, the dispatching control module includes a path planning unit and an operation management unit.

[0058] The path planning unit is used to plan the best path for each water demand party.

[0059] First, mark all water suppliers in the water supply route and analyze the water supply direction. Obtain the water supply volume GS1 of water supplier m1 and make m1 a child node. The water supplier m2 that can supply water to m1 and whose water supply volume is greater than GS1 is made the parent node of m1.

[0060] Secondly, a tree relationship diagram is established based on the parent-child node relationship between water suppliers; the water supply GS3 of the parent node m3 and the water supply of each child node under m3 are obtained, and all child nodes are freely combined under the condition that the total water supply is not greater than GS3.

[0061] Taking the parent node m3 as the starting point and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points to plan the path, the energy consumption coefficient of each path is calculated respectively, and the lowest energy consumption coefficient is selected as the second coefficient E2 of the corresponding combination.

[0062] Then, according to the formula: Calculate the third coefficient E3, and select the combination with the highest third coefficient greater than zero as the optimal combination; wherein, It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination.

[0063] Finally, the path corresponding to the lowest energy consumption index of the optimal combination is taken as the optimal path, and the parent node m3 is taken as the new water supplier corresponding to the water demander of all water suppliers in the optimal combination. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination.

[0064] The operation management unit is used to send water transfer instructions and record the water transfer records fed back by each reservoir.

[0065] When there is no optimal combination for all water demanders, a dispatch plan is generated based on the current path and pushed to the dispatch center.

[0066] The system saves the parameters in the scheduling plan, demonstrates the optimization plan in the visual model through the simulation engine, and displays the optimized values ​​of the plan on upstream water, gates, diversion gates and other facilities to facilitate decision-making and command.

[0067] Generate real-time control instructions for the gates, pump stations and diversion gates of each reservoir along the route, including the opening of the control gate, the opening of the siphon gate, the angle of the pump unit, the speed of the pump unit, etc., to maintain the water level and flow control of the gate station and pump station within the target range and realize intelligent control of the gate and pump. Specifically, it includes real-time control of gates and pump stations.

[0068] Real-time gate control: According to the gate control objectives, considering different gate constraints, and based on the real-time monitoring data of adjacent reservoirs, automatic control instructions for gate opening are generated.

[0069] Real-time control of pumping stations. According to the control objectives of the pumping stations, taking into account the characteristics of different pumping stations and units, and based on the real-time monitoring data of adjacent reservoirs, control instructions for adjusting the pumping station units are generated.

[0070] The dispatching center sends water diversion instructions based on the route in the dispatching plan and the water supply of each water supplier, and each reservoir responds and executes and feedbacks the water diversion records.

[0071] Compared with the prior art, the beneficial effects achieved by the present invention are: 1. Application of digital twin technology: By building a visualization model based on digital twin technology, the changes in the hydrological characteristics of each reservoir can be mapped in real time. This high-precision model can effectively improve the accuracy of water resources management and enhance the understanding of water resources transportation relationships.

[0072] 2. Optimize water supply path: This method can scientifically plan the best water supply path by analyzing the matching index between water suppliers and water demanders. The tree relationship diagram is used to continuously iterate and optimize the water supply path to ensure that the water supply plan is efficient and flexible in actual implementation.

[0073] 3. Reduce energy consumption: This solution not only optimizes the water supply scheduling process, but also significantly reduces energy consumption by selecting energy-saving water delivery methods, thereby improving the overall water supply efficiency.

[0074] 4. Dynamic adjustment and feedback mechanism: The routes and water supply in the scheduling plan are derived from real-time feedback records, making water supply scheduling more flexible and able to adapt to real-time changes in water demand and water source conditions.

[0075] 5. Decision-making process supported by algorithms: The use of matching index and water supply calculation can effectively evaluate the reliability and water supply capacity of the water source, and provide data support for the establishment of the solution library. This data-driven strategy can make decision-making more scientific and accurate.

[0076] In summary, this technical solution provides a solid foundation for improving the real-time, energy-saving and intelligent nature of water supply in terms of water resources management and water supply scheduling. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings: Figure 1 It is a flow chart of an intelligent dispatching method for water conservancy projects according to the present invention.

[0078] Figure 2 It is a schematic diagram of the supply and demand analysis process of a water conservancy project intelligent scheduling method of the present invention.

[0079] Figure 3 It is a schematic diagram of a path optimization process of a water conservancy project intelligent scheduling method of the present invention.

[0080] Figure 4 It is a structural schematic diagram of an intelligent dispatching system for water conservancy projects of the present invention. DETAILED DESCRIPTION

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

[0082] See also Figure 1 The present invention provides a method for intelligent scheduling of water conservancy projects, comprising the following steps: S100. Collect water transfer routes and reservoir water transfer records.

[0083] S200: Calling a visualization model to identify water demanders and water sources, and analyzing matching indexes of water sources.

[0084] S300: Establish a solution library for each water demander according to the matching index, set the water supplier and add it to the solution library.

[0085] S400. Plan the best path according to the solution library, generate a dispatch plan, push it to each reservoir for execution and obtain feedback.

[0086] In S100, the water transfer route includes a description of the water transfer relationship between different reservoirs, the transfer relationship includes type and direction, and the type includes gate transfer and pump pressure transfer. Each water transfer record includes the transfer object, transfer method, transfer time, water transfer volume and power consumption.

[0087] Sluice gate transfer refers to transferring water from a reservoir to another reservoir at a lower altitude by opening the gate, while pumping transfer refers to extracting water from a reservoir and transferring it to another reservoir through a pumping station. Generally speaking, sluice gate transfer consumes less electricity than pumping transfer.

[0088] The visualization model refers to a three-dimensional model constructed using digital twin technology based on the topographic structure, location, altitude and hydrological characteristics of each reservoir. Sensors are used to collect changes in the hydrological characteristics of each reservoir in reality and map them to the visualization model in real time. Hydrological characteristics include water level and water storage capacity.

[0089] See also Figure 2 , S200 includes the following steps: S201. Set warning values ​​for each reservoir, and use the reservoirs with water levels below the warning values ​​in the visualization model as water demanders, and calculate the water demand based on the water storage capacity and the difference between the water level and the warning value. Analyze the location and water delivery direction of the water demander Q in the water delivery route, and use all reservoirs that can deliver water to the water demander Q and are not water demanders as their water sources.

[0090] Direct water delivery to the water demander Q refers to the water delivery method that is upstream of Q according to the water delivery direction, and there are no other reservoirs in between. Indirect water delivery to the water demander Q refers to the water delivery method that is upstream of Q according to the water delivery direction, and there are several other reservoirs in between.

[0091] S202, starting from the water source and ending at the water demand Q, plan all paths between a water demand and multiple water sources, analyze all reservoirs included in each path, and select the water transfer record with the largest water transfer volume between every two adjacent reservoirs as a reference record. Obtain the water transfer volume SL in each reference record e , Power consumption HD e and delivery time SC e , according to the formula: The conveying speed SG is calculated.

[0092] When there are adjacent reservoirs on the path and the water transfer direction is from reservoir C1 to reservoir C2, all water transfer records of C1 are obtained and the water transfer records whose transfer object is C2 are screened out. Among these water transfer records, the water transfer record with the largest water transfer volume is found as the reference record for the group of adjacent reservoirs from reservoir C1 to reservoir C2.

[0093] S203, set standard flow rate SG pre and constant α , get the minimum conveying speed SG among all reference records min , substitute into the formula to calculate the first coefficient X of each path; the highest first coefficient X among all paths belonging to a water demand party and the corresponding water source party max As the matching index of the water source, the first coefficient calculation formula is as follows: ; In the formula, r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path; and so on, the matching index of each water source under each water demander is calculated respectively.

[0094] The path corresponding to the highest first coefficient is selected as the default fixed path of the water source, and this fixed path is used by default for analysis and replanning in subsequent path planning.

[0095] S300 includes the following steps: S301: Establish a solution library for the water demander Q, obtain the matching index and water storage capacity of the corresponding water source, calculate the water supply according to the water storage capacity and the difference between the water level and the warning value, and sort all water sources in descending order according to the matching index.

[0096] S302, adding the water sources as water suppliers one by one into the solution library according to the arrangement order, and calculating the sum h of the water supply of all water suppliers in the solution library after each addition.

[0097] When h is not less than d, no more water suppliers will be added. If h is less than d, water suppliers will continue to be added until h is not less than d. A solution library is established for each water demander and water suppliers are added according to the above method.

[0098] Ensure that the sum of the water supplies of all water suppliers in the solution library of each water source is not less than the water demand, and that there is at least one or more water suppliers in each solution library.

[0099] S303, obtaining the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyzing the water transfer volume SL in each reference record under the path z v and power consumption HD z v , substitute into the formula to calculate the energy consumption coefficient N of the corresponding path of the water supply m0 0 Q , and its calculation formula is: ; Where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d.

[0100] Calculate the energy consumption coefficient of the corresponding path of each water supplier and the energy consumption coefficient of the corresponding path of each water supplier under each water demander.

[0101] See also Figure 3 , S400 includes the following steps: S401. Mark all water suppliers in the water supply route and analyze the water supply direction; obtain the water supply volume GS1 of water supplier m1 and use m1 as a child node. The water supplier m2 that can supply water to m1 and whose water supply volume is greater than GS1 is used as the parent node of m1.

[0102] Each child node can be the parent node of multiple other nodes, or the child node of multiple other nodes. Child nodes and parent nodes are not fixed attributes of the water supplier, but the relative relationship status between them and other water suppliers.

[0103] S402. Establish a tree relationship diagram based on the parent-child node relationship between water suppliers. Obtain the water supply GS3 of the parent node m3 and the water supply of each child node under m3, and freely combine all child nodes under the condition that the total water supply is not greater than GS3. Plan the path with the parent node m3 as the starting point and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points, calculate the energy consumption coefficient of each path respectively, and select the lowest energy consumption coefficient as the second coefficient of the corresponding combination. .

[0104] S403, according to the formula: Calculate the third coefficient E3, select the combination with the highest third coefficient greater than zero as the optimal combination; take the path corresponding to the lowest energy consumption index of the optimal combination as the optimal path, and use the parent node m3 as the new water supplier for all water suppliers in the optimal combination corresponding to the water demander. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination; It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination.

[0105] The best path only represents the best choice of path between the parent node and all water suppliers in the optimal combination corresponding to the water demanders in the single-layer parent-child node relationship network. After the best path replacement is completed, the same method is used to continue to explore whether there is an optimal path in the node relationship network above the original parent node, and the path is continuously optimized through multiple iterations.

[0106] S404, and so on, continuously plan the best path for each water demander according to the tree relationship diagram. When all water demanders no longer have the optimal combination, a dispatch plan is generated according to the current path and pushed to the dispatch center. The dispatch center sends a water transfer instruction according to the path in the dispatch plan and the water supply of each water supplier, and each reservoir responds and executes and feeds back the water transfer record.

[0107] See also Figure 4 The present invention provides an intelligent scheduling system for water conservancy projects, including a data collection module, a supply and demand analysis module, a scheme design module and a scheduling control module.

[0108] The data collection module is used to collect water transfer records of water delivery routes and reservoirs.

[0109] The supply and demand analysis module is used to call the visualization model to identify water demanders and their water sources, and to analyze the matching index between each water source and water demander.

[0110] The scheme design module is used to establish a scheme library for each water demander according to the matching index, set the water supplier and add it to the scheme library.

[0111] The dispatching control module is used to plan the best path according to the solution library, generate a dispatching plan, push it to each reservoir for execution and obtain feedback.

[0112] The data collection module includes a water diversion record collection unit, a route data collection unit and a hydrological information collection unit.

[0113] The water transfer record collection unit is used to collect the water transfer records of each reservoir each time the water resources are transferred out. The water transfer records include the delivery object, delivery method, delivery time, water transfer volume and power consumption.

[0114] The route data collection unit is used to collect water delivery routes. The water delivery routes include the relationship between water resources delivery between different reservoirs, the delivery relationship includes type and direction, and the types include gate delivery and pump pressure delivery.

[0115] The hydrological information acquisition unit is used to collect the topographic structure, location direction, altitude and hydrological characteristics of each reservoir. Hydrological characteristics include water level and water storage capacity. A visual model is constructed based on the collected data and mapped in real time.

[0116] The supply and demand analysis module includes a water use analysis unit and a supply and demand matching unit.

[0117] The water use analysis unit is used to identify water demanders and their water sources.

[0118] First, set a warning value for each reservoir, take the reservoir whose water level in the visualization model is lower than the warning value as the water demander, and calculate the water demand based on the water storage capacity and the difference between the water level and the warning value.

[0119] Then analyze the location and water delivery direction of the water demander Q in the water delivery route, and regard all reservoirs that can deliver water to the water demander Q and are not water demanders as water sources for the water demander Q.

[0120] The supply and demand matching unit is used to calculate the matching index of each water source.

[0121] Firstly, taking the water source as the starting point and the water demand Q as the end point, all paths between a water demand and multiple water sources are planned, all reservoirs included in each path are analyzed, and the water transfer record with the largest water transfer volume between every two adjacent reservoirs is selected as the reference record.

[0122] Secondly, obtain the water transfer amount in each reference record ,power consumption and delivery time , adjust the water volume Divide by the delivery time Get the conveying speed.

[0123] Then, set the standard flow rate SG pre and constant α, to obtain the minimum conveying speed SG among all reference records min , according to the formula: Calculate the first coefficient of each path. Where r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path.

[0124] Finally, the highest first coefficient X among all paths belonging to a water demand party and the corresponding water source party is max As the matching index of the water source, and so on, calculate the matching index of each water source under each water demand.

[0125] The scheme design module includes a scheme library establishment unit and an energy consumption calculation unit.

[0126] The solution library establishment unit is used to establish a solution library for each water demander.

[0127] First, a solution library is established for the water demand party Q to obtain the matching index and water storage capacity of the corresponding water source party.

[0128] Secondly, the water supply is calculated based on the water storage capacity and the difference between the water level and the warning value, and all water sources are ranked in descending order according to the matching index.

[0129] Then, the water sources are added to the solution library as water suppliers one by one according to the arrangement order, and the sum of the water supply h of all water suppliers in the solution library is calculated after each addition.

[0130] Finally, when h is not less than d, no more water suppliers will be added. If h is less than d, water suppliers will continue to be added until h is not less than d. A solution library is established for each water demander and water suppliers are added according to the above method.

[0131] The energy consumption calculation unit is used to calculate the energy consumption coefficient of the corresponding path of each water supplier under the water demand party.

[0132] First, obtain the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyze the water transfer volume SL in each reference record under the path z v and power consumption HD z v .

[0133] Secondly, according to the formula: Calculate the energy consumption coefficient of the path corresponding to the water supplier m0. Where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d.

[0134] Finally, the energy consumption coefficients of the corresponding paths of each water supplier and the energy consumption coefficients of the corresponding paths of each water supplier under each water demander are calculated respectively.

[0135] The dispatching control module includes a path planning unit and an operation management unit.

[0136] The path planning unit is used to plan the best path for each water demand party.

[0137] First, mark all water suppliers in the water supply route and analyze the water supply direction. Obtain the water supply volume GS1 of water supplier m1 and make m1 a child node. The water supplier m2 that can supply water to m1 and whose water supply volume is greater than GS1 is made the parent node of m1.

[0138] Secondly, a tree relationship diagram is established based on the parent-child node relationship between water suppliers; the water supply GS3 of the parent node m3 and the water supply of each child node under m3 are obtained, and all child nodes are freely combined under the condition that the total water supply is not greater than GS3.

[0139] Taking the parent node m3 as the starting point and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points to plan the path, the energy consumption coefficient of each path is calculated respectively, and the lowest energy consumption coefficient is selected as the second coefficient E2 of the corresponding combination.

[0140] Then, according to the formula: Calculate the third coefficient E3, and select the combination with the highest third coefficient greater than zero as the optimal combination; wherein, It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination.

[0141] Finally, the path corresponding to the lowest energy consumption index of the optimal combination is taken as the optimal path, and the parent node m3 is taken as the new water supplier corresponding to the water demander of all water suppliers in the optimal combination. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination.

[0142] The operation management unit is used to send water transfer instructions and record the water transfer records fed back by each reservoir.

[0143] When there is no optimal combination for all water demanders, a dispatch plan is generated based on the current path and pushed to the dispatch center.

[0144] The system saves the parameters in the scheduling plan, demonstrates the optimization plan in the visual model through the simulation engine, and displays the optimized values ​​of the plan on upstream water, gates, diversion gates and other facilities to facilitate decision-making and command.

[0145] Generate real-time control instructions for the gates, pump stations and diversion gates of each reservoir along the route, including the opening of the control gate, the opening of the siphon gate, the angle of the pump unit, the speed of the pump unit, etc., to maintain the water level and flow control of the gate station and pump station within the target range and realize intelligent control of the gate and pump. Specifically, it includes real-time control of gates and pump stations.

[0146] Real-time gate control: According to the gate control objectives, considering different gate constraints, and based on the real-time monitoring data of adjacent reservoirs, automatic control instructions for gate opening are generated.

[0147] Real-time control of pumping stations. According to the control objectives of the pumping stations, taking into account the characteristics of different pumping stations and units, and based on the real-time monitoring data of adjacent reservoirs, control instructions for adjusting the pumping station units are generated.

[0148] The dispatching center sends water diversion instructions based on the route in the dispatching plan and the water supply of each water supplier, and each reservoir responds and executes and feedbacks the water diversion records.

[0149] Assume that there are four reservoirs C3, C4, C5 and C6 under path o1, and obtain reference records between every two adjacent reservoirs, where the water transfer volume and power consumption are as follows: C3-C4 reference records: water transfer volume: 3600m³; power consumption: 368kWh; C4-C5 reference records: water transfer volume: 2500m³; power consumption: 260kWh; C5-C6 reference record: water transfer volume: 1500m³; power consumption: 130kWh; When the water supply is 3000m³, substitute the formula to calculate the energy consumption coefficient of path o1: ; Then the energy consumption coefficient of path o1 is 878.67.

[0150] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0151] Finally, it should be noted that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art can still modify the technical solutions described in the aforementioned embodiments or replace some of the technical features therein by equivalents. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for intelligent dispatching of water conservancy projects, characterized in that: The method comprises the following steps: S100, collect water transfer routes and reservoir water transfer records; S200, calling a visualization model to identify a water demander and a water source, and analyzing a matching index of each water source; S300, establishing a solution library for each water demander according to the matching index, setting the water supplier and adding it to the solution library; S400. Plan the best path according to the solution library, generate a dispatch plan, push it to each reservoir for execution and obtain feedback.

2. The intelligent dispatching method for water conservancy projects according to claim 1 is characterized by: The water transfer route includes the description of the water resources transfer relationship between different reservoirs. The transfer relationship includes type and direction. The types include gate transfer and pump pressure transfer. Each water transfer record includes the transfer object, transfer method, transfer time, water transfer volume and power consumption.

3. The intelligent dispatching method for water conservancy projects according to claim 2 is characterized in that: S200 includes the following steps: S201. The reservoirs with water levels lower than the warning value in the visualization model are regarded as water demanders, and the water demand is calculated according to the water storage capacity and the difference between the water level and the warning value; the position and water delivery direction of the water demander Q in the water delivery route are analyzed, and all reservoirs that can deliver water to the water demander Q and are not water demanders are regarded as its water sources; S202, starting from the water source and ending at the water demand Q, plan all paths between a water demand and multiple water sources, analyze all reservoirs included in each path, and select the water transfer record with the largest water transfer volume between every two adjacent reservoirs as a reference record; obtain the water transfer volume SL in each reference record e , Power consumption HD e and delivery time SC e , and calculate the conveying speed; S203, set standard flow rate SG pre and constant α, to obtain the minimum conveying speed SG among all reference records min , substitute into the formula to calculate the first coefficient X of each path; The highest first coefficient X among all paths between a water demand party and the corresponding water source party max As the matching index of the water source, the first coefficient calculation formula is as follows: ； In the formula, r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path; and so on, the matching index of each water source under each water demander is calculated respectively.

4. A water conservancy project intelligent scheduling method according to claim 3, characterized in that: S300 includes the following steps: S301, establish a solution library for the water demand party Q, obtain the matching index and water storage capacity of the corresponding water source party; calculate the water supply according to the water storage capacity and the difference between the water level and the warning value, and sort all water sources in descending order according to the matching index; S302, add the water sources as water suppliers one by one in the scheme library according to the arrangement order, and calculate the sum of the water supply of all water suppliers in the scheme library after each addition; when h is not less than d, no more water suppliers will be added, and when h is less than d, continue to add water suppliers until h is not less than d; establish a scheme library for each water demander and add water suppliers according to the above method; S303, obtaining the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyzing the water transfer volume SL in each reference record under the path z v and power consumption HD z v , substitute into the formula to calculate the energy consumption coefficient N of the corresponding path of the water supply m0 0 Q , and its calculation formula is: ； Where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d. The energy consumption coefficients of the paths corresponding to each water supplier and the energy consumption coefficients of the paths corresponding to each water supplier under each water demand are calculated respectively.

5. The intelligent dispatching method for water conservancy projects according to claim 4 is characterized in that: S400 includes the following steps: S401, mark all water suppliers in the water delivery route and analyze the water delivery direction; obtain the water supply GS1 of water supplier m1 and take m1 as a child node, and the water supplier m2 that can deliver water to m1 and whose water supply is greater than GS1 is taken as the parent node of m1; S402, establish a tree relationship diagram based on the parent-child node relationship between water suppliers; obtain the water supply GS3 of the parent node m3 and the water supply of each child node under m3, and freely combine all child nodes under the condition that the total water supply is not greater than GS3; take the parent node m3 as the starting point, and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points to plan the path, calculate the energy consumption coefficient of each path respectively, and select the lowest energy consumption coefficient as the second coefficient E2 of the corresponding combination; S403, according to the formula: Calculate the third coefficient E3, select the combination with the highest third coefficient greater than zero as the optimal combination; take the path corresponding to the lowest energy consumption index of the optimal combination as the optimal path, and use the parent node m3 as the new water supplier for all water suppliers in the optimal combination corresponding to the water demander. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination; It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination; S404: When there is no optimal combination for all water demanders, a dispatch plan is generated based on the current path and pushed to the dispatch center; the dispatch center sends a water diversion instruction based on the path in the dispatch plan and the water supply of each water supplier, and each reservoir responds and executes and feeds back the water diversion record.

6. An intelligent dispatching system for water conservancy projects, characterized in that: The system includes: Data collection module, used to collect water transfer records of water delivery routes and reservoirs; The supply and demand analysis module is used to call the visualization model to identify the water demander and its water source, and analyze the matching index between each water source and the water demander; The scheme design module is used to establish a scheme library for each water demander according to the matching index, set the water supplier and add it to the scheme library; The dispatching control module is used to plan the best path according to the solution library, generate a dispatching plan, push it to each reservoir for execution and obtain feedback.

7. The intelligent dispatching system for water conservancy projects according to claim 6 is characterized by: The data collection module includes a water transfer record collection unit, a route data collection unit and a hydrological information collection unit; The water transfer record collection unit is used to collect the water transfer records of each reservoir's water resources transfer. The water transfer records include the transfer object, transfer method, transfer time, water transfer volume and power consumption; The route data collection unit is used to collect water delivery routes; the water delivery routes include the description of the delivery relationship between water resources in different reservoirs, the delivery relationship includes type and direction, and the types include gate delivery and pump pressure delivery; The hydrological information collection unit is used to collect the topographic structure, location direction, altitude and hydrological characteristics of each reservoir; Build visual models based on collected data and map them in real time.

8. The intelligent dispatching system for water conservancy projects according to claim 7 is characterized by: The supply and demand analysis module includes a water use analysis unit and a supply and demand matching unit; The water use analysis unit is used to identify the water demander and its water source; First, set a warning value for each reservoir, and take the reservoir with a water level lower than the warning value in the visualization model as the water demander, and calculate the water demand based on the water storage capacity and the difference between the water level and the warning value; Then analyze the location and water delivery direction of the water demander Q in the water delivery route, and regard all reservoirs that can deliver water to the water demander Q and are not water demanders as water sources for the water demander Q; The supply-demand matching unit is used to calculate the matching index of each water source; First, with the water source as the starting point and the water demand Q as the end point, all paths between a water demand and multiple water sources are planned, all reservoirs included in each path are analyzed, and the water transfer record with the largest water transfer volume between every two adjacent reservoirs is selected as the reference record; Secondly, obtain the water transfer volume SL in each reference record e , Power consumption HD e and delivery time SC e , and calculate the conveying speed; Then, set the standard flow rate SG pre and constant α, to obtain the minimum conveying speed SG among all reference records min , according to the formula: Calculate the first coefficient of each path; where r is the number of all reference records, d is the water demand of the water demander Q, and L is the length of the path; Finally, the highest first coefficient X among all paths belonging to a water demand party and the corresponding water source party is max As the matching index of the water source; and so on, calculate the matching index of each water source under each water demand party respectively.

9. The intelligent dispatching system for water conservancy projects according to claim 8 is characterized by: The scheme design module includes a scheme library establishment unit and an energy consumption calculation unit; The solution library establishment unit is used to establish a solution library for each water demander; First, a solution library is established for the water demand party Q to obtain the matching index and water storage capacity of the corresponding water source party; Secondly, the water supply is calculated based on the water storage capacity and the difference between the water level and the warning value, and all water sources are sorted in descending order according to the matching index; Then, the water sources are added to the solution library as water suppliers one by one according to the arrangement order, and the sum of the water supply of all water suppliers in the solution library is calculated after each addition; Finally, when h is not less than d, no more water suppliers will be added. If h is less than d, water suppliers will continue to be added until h is not less than d. A solution library is established for each water demander and water suppliers are added according to the above method. The energy consumption calculation unit is used to calculate the energy consumption coefficient of the corresponding path of each water supplier under the water demand side; First, obtain the path corresponding to the matching index of the water supplier m0 in the water demander Q solution library, and analyze the water transfer volume SL in each reference record under the path z v and power consumption HD z v ; Secondly, according to the formula: Calculate the energy consumption coefficient of the path corresponding to the water supplier m0; where p is the number of reference records, GS0 is the water supply, and GS0 takes the value d when it is greater than or equal to d; Finally, the energy consumption coefficients of the corresponding paths of each water supplier and the energy consumption coefficients of the corresponding paths of each water supplier under each water demander are calculated respectively.

10. The intelligent dispatching system for water conservancy projects according to claim 9, characterized in that: The dispatch control module includes a path planning unit and an operation management unit; The path planning unit is used to plan the best path for each water demander; First, mark all water suppliers in the water supply route and analyze the water supply direction; obtain the water supply volume GS1 of water supplier m1 and make m1 a child node, and the water supplier m2 that can supply water to m1 and whose water supply volume is greater than GS1 is made the parent node of m1; Secondly, a tree relationship diagram is established based on the parent-child node relationship between water suppliers; the water supply volume GS3 of the parent node m3 and the water supply volume of each child node under m3 are obtained, and all child nodes are freely combined under the condition that the total water supply volume is not greater than GS3; Taking the parent node m3 as the starting point and all water demand parties corresponding to the child nodes in each combination as the intermediate points or end points to plan the path, calculate the energy consumption coefficient of each path respectively, and select the lowest energy consumption coefficient as the second coefficient E2 of the corresponding combination; Then, according to the formula: Calculate the third coefficient E3, and select the combination with the highest third coefficient greater than zero as the optimal combination; wherein, It is the sum of the energy consumption coefficients of the corresponding paths of all water suppliers in the combination; Finally, the path corresponding to the lowest energy consumption index of the optimal combination is taken as the optimal path, and the parent node m3 is taken as the new water supplier corresponding to the water demander of all water suppliers in the optimal combination. The optimal path automatically replaces the paths between all water suppliers and water demanders in the combination. The operation management unit is used to send water transfer instructions and record the water transfer records fed back by each reservoir; When there is no optimal combination for all water demanders, a dispatch plan is generated based on the current path and pushed to the dispatch center; The dispatching center sends water diversion instructions based on the route in the dispatching plan and the water supply of each water supplier, and each reservoir responds and executes and feedbacks the water diversion records.

Images