A water resource allocation method for interbedded rock engineering

Abstract

This application relates to the field of water resource scheduling, specifically disclosing a water resource scheduling method for interlocking rock engineering projects. The method includes: acquiring target data, which includes the water recipient, water demand, and water demand time; calculating at least one corresponding planned route based on the target data; calculating the corresponding operating cost based on each planned route; and selecting the planned route with the lowest operating cost as the target route for the water recipient. By employing the embodiments of this application, the water delivery situation is simulated before water delivery, taking into account the water recipient, water demand, and water demand time, to obtain the target route for water delivery to the water recipient. This shortens the preparation cycle for water resource scheduling and reduces labor and scheduling costs.

Description

Technical Field

[0001] This application relates to the field of water resource allocation, and more specifically, to a water resource allocation method for interlocking rock engineering. Background Technology

[0002] As a large-scale water supply project, the Jiaoyan Project has two major tasks: flood control and water supply. Its water supply area covers the Bijie-Dafang region (Bijie City and Dafang County), Zunyi City, and five counties / cities (Qianxi County, Jinsha County, Nayong County, Zhijin County, and Renhuai City), as well as 69 townships (25 in Qianxi County, 16 in Jinsha County, 3 in Zhijin County, 9 in Nayong County, 4 in Hezhang County, and 2 in Zunyi County), and 365 rural settlements. The total water supply population is 2.67 million. In addition, the project also considers power generation (the downstream power station has an installed capacity of 90 MW / 90,000 kW, with an average annual power generation of 219.8 million kWh), regional development, and ecological environment improvement.

[0003] Currently, water resource allocation is mainly carried out manually, with the allocation method and timing arranged manually. Given the large number of water transfer targets and the large volume of water to be used in the current Jiaoyan project, although manual allocation can ensure the normal operation of the allocation work, it results in a long preparation period, high manpower consumption, and high allocation costs, and fails to maximize benefits. Summary of the Invention

[0004] To address the aforementioned issues, this application provides a water resource scheduling method for interlocking rock engineering projects, which solves the problem of long preparation periods in the water resource scheduling process, thereby reducing labor and scheduling costs.

[0005] This application provides a water resource scheduling method for interlocking rock engineering, the method comprising:

[0006] 1. A water resource allocation method for interbedded rock engineering projects, the method comprising:

[0007] Acquire target data, which includes the water-receiving object, water demand, and water demand time;

[0008] At least one planned route is calculated based on the target data;

[0009] The corresponding operating costs are calculated based on each of the planned routes, and the planned route with the minimum operating cost is taken as the target route for the water receiving object.

[0010] The beneficial effects of the technical solutions provided in some embodiments of this application include at least the following:

[0011] Because the interlocking rock project requires water supply to 2.67 million cubic meters of land, and this water supply is carried out manually, manual water resource allocation requires extensive preparatory work beforehand, resulting in a long preparation period and high labor costs. The proposed solution, in the pre-allocation preparation stage, obtains target data including the water recipient, water demand, and water demand duration. Based on these factors, it plans at least one water transmission route and calculates the operating costs for each route. The route with the lowest operating cost is then selected as the target route for the water recipient. Water is then delivered to the recipient via this target route, satisfying the recipient's required water volume and duration.

[0012] By simulating the water transfer situation in conjunction with the water recipient, water demand, and water demand time before water transfer, the target route for water transfer to the water recipient can be obtained, which shortens the preparation cycle of water resource scheduling and reduces labor and scheduling costs.

[0013] Optionally, calculating at least one corresponding planned route based on the target data includes:

[0014] By combining the DFS algorithm and the greedy algorithm, at least one planned route corresponding to the water-receiving object is calculated.

[0015] By combining the Depth-First Search (DFS) algorithm with a greedy algorithm, all possible water transport routes to the receiving object are searched out and used as water transport routes for the receiving object, ensuring that all possible water transport routes can be used as water transport routes for the receiving object.

[0016] Optionally, after calculating at least one corresponding planned route based on the target data, the method further includes:

[0017] The number of planned routes is determined. When there is only one planned route, the corresponding operating cost is calculated based on each planned route, and the planned route with the lowest operating cost is taken as the target route of the water receiving object.

[0018] When there are two or more planned routes, the following steps are performed:

[0019] The target parameters of each of the planned routes are calculated using standard hydraulic calculation methods. The target parameters are then compared with preset parameters to determine whether the error is less than or equal to a preset threshold.

[0020] If the error is less than or equal to the preset threshold, the planned route will be temporarily saved as a provisional route.

[0021] If the error exceeds the preset threshold, the planned route will be discarded.

[0022] Each of the provisional routes is taken as the water transport route set for the water receiving object.

[0023] By calculating the parameters in the planned routes of the water-receiving objects, the target parameters of each planned route are obtained. The target parameters are then compared with the preset parameters to ensure that the error between the target parameters of the planned routes and the preset parameters does not exceed the preset threshold. The planned routes with errors not exceeding the preset threshold are used as the water conveyance route set. The final target route of the water-receiving objects is determined from the water conveyance route set to ensure that the errors generated in the water resource scheduling process are within an acceptable range.

[0024] Optionally, the calculation of the target parameters for each of the planned routes using standard hydraulic calculation methods includes:

[0025] Determine whether there are gate valves and / or pumping stations in the planned route;

[0026] If there are no gate valves and pumping stations in each of the planned routes, the corresponding planned route is marked as the first planned route. The first target parameters corresponding to each of the first planned routes are calculated using the first standard hydraulic calculation method. The first target parameters include at least head loss, leakage loss and water delivery time.

[0027] If there are gate valves and / or pumping stations in each of the planned routes, the corresponding planned routes are marked as second planned routes. Using the second standard hydraulic calculation method, the second target parameters corresponding to each second planned route are calculated. The second target parameters include at least head loss, leakage loss, water delivery time, gate valve flow rate and pumping station pressure.

[0028] The step of comparing the target parameters of each planned route with preset parameters and determining whether the error is less than or equal to 10 percent includes:

[0029] Each of the first target parameters and each of the second target parameters are compared with preset parameters to determine whether the error is less than or equal to 10%.

[0030] By determining whether there are gate valves and / or pumping stations in each planned route, the corresponding target parameters are calculated for planned routes with gate valves and / or pumping stations and routes without gate valves and pumping stations. Various possible situations for each planned route are simulated, and the corresponding target parameters are compared with preset parameters to ensure that the error in the water resource scheduling process is less than or equal to 10%, and that there will be no unacceptably high error.

[0031] Optionally, before comparing the target parameters of each planned route with preset parameters and determining whether the error is less than or equal to 10%, the method further includes:

[0032] By using a preset range of boundary conditions, the planned routes are initially screened to obtain usable paths.

[0033] By pre-setting the boundary conditions within a certain range, each planned route is initially screened, and routes that do not meet the requirements or contain obstacles that prevent water delivery are removed. This reduces the number of usable routes that are calculated when calculating the target parameters of the planned routes, thus improving the efficiency of calculating the target parameters of the planned routes.

[0034] Optionally, after setting each of the provisional routes as the water transport route set for the water receiving object, the method further includes:

[0035] Calculate the operating costs corresponding to each of the provisional routes in the water conveyance route set;

[0036] Based on the aforementioned operating costs, the minimum operating cost is obtained using the particle swarm optimization algorithm, and the planned route corresponding to the minimum operating cost is used as the target route for the water receiving object.

[0037] By calculating the operating costs of each provisional water transfer route and determining the minimum operating cost, the provisional route with the minimum operating cost is used as the target route for the water recipient. Water resources can be allocated to the water recipient through this target route, ensuring that the error is within 10% while reducing allocation costs. Attached Figure Description

[0038] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0039] Figure 1 A system architecture diagram of a water resource scheduling method for interlocking rock engineering provided in this application embodiment;

[0040] Figure 2 A schematic flowchart illustrating a water resource scheduling method for interlocking rock engineering provided in this application embodiment;

[0041] Figure 3 This is a schematic flowchart of a water resource scheduling method for interlocking rock engineering provided in an embodiment of this application. Detailed Implementation

[0042] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0043] In the following description, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance. The following description provides multiple embodiments of this application, which can be substituted or combined with each other. Therefore, this application can also be considered to include all possible combinations of the same and / or different embodiments described. Thus, if one embodiment includes features A, B, and C, and another embodiment includes features B and D, then this application should also be considered to include embodiments containing one or more other possible combinations of A, B, C, and D, even if such embodiments are not explicitly described in the following text.

[0044] The following description provides examples and does not limit the scope, applicability, or examples set forth in the claims. Changes may be made to the function and arrangement of the described elements without departing from the scope of this application. Various processes or components may be appropriately omitted, substituted, or added to the examples. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Furthermore, features described with respect to some examples may be combined into other examples.

[0045] Please see Figure 1 This is a schematic diagram of the system architecture of a water resource scheduling method for interlocking rock engineering provided in an embodiment of this application. The system includes terminal equipment, which may include, but is not limited to, smartphones, smart interactive flat panels, personal computers, desktop computers, tablet computers, handheld computers, laptops, all-in-one computers, etc.

[0046] When a user needs to allocate water resources to a specific recipient based on water demand and timing, during the preparation phase before allocation, the user inputs target data—including the recipient, water demand, and timing—on the terminal device. The terminal device then generates a target route for water resource allocation based on this user-input data and a pre-defined algorithm. By simulating the water transfer process before delivery, taking into account the recipient, demand, and timing, a target route for water resource allocation is obtained, shortening the pre-deployment cycle and reducing labor and allocation costs.

[0047] exist Figure 1 Based on the system architecture shown, the following will combine... Figures 2-3 This application provides a detailed description of the water resource scheduling method for interbedded rock engineering provided in the embodiments of this application.

[0048] Please see Figure 2 This document provides a flowchart illustrating a water resource allocation method for interbedded rock engineering, as illustrated in an embodiment of this application. Figure 2As shown, the water resource allocation method for interbedded rock engineering may include the following steps:

[0049] S101, Obtain target data, which includes the water receiving object, water demand, and water demand time.

[0050] In one embodiment, when a user needs to schedule water resources for a specific water recipient during the water resource scheduling process, the user inputs the target data into the terminal device, i.e., the water recipient, along with the water demand and the water demand time. The terminal device can then receive the information input by the user.

[0051] The objects to be cleaned can be from a list of objects that the user has pre-stored in the terminal device, which the user can search and fill in, or they can be newly added objects to be cleaned.

[0052] The water demand can be entered by the user when inputting the water recipient, or it can be preset as the water consumption required by the residents of the water recipient within a time interval, which can include, but is not limited to, 5 days, 7 days, 10 days, 15 days, etc. The water demand can be for domestic use, industrial use, or ecological use, etc.

[0053] Water demand time refers to the time it takes for water resources to be delivered.

[0054] Another feasible approach is to pre-store a list of water recipients in the terminal device, pre-setting the corresponding water demand for each recipient based on past water allocation data. If the water demand remains unchanged, the user only needs to input the water recipient and the required water time into the terminal device. Simultaneously, when the user inputs the water recipient on the terminal device, a corresponding first time is generated. The required water time can be a second time following the first time, which may include, but is not limited to, 24 hours, 48 ​​hours, 36 hours, etc. If the user determines that the required water time is the second time following the pre-set time interval when inputting the water recipient on the terminal device, then the user only needs to input the water recipient on the terminal device.

[0055] S102, calculate at least one corresponding planned route based on the target data.

[0056] In one embodiment, the terminal device generates at least one planned route that can deliver water resources to the location of the water recipient based on target data input by the user, including the water recipient object, water demand, and water demand time.

[0057] The planned routes generated by the terminal equipment must be able to deliver the required amount of water to the recipient's location during the water demand period.

[0058] S103, calculate the corresponding operating costs based on each planned route, and take the planned route with the minimum operating cost as the target route for the water receiving object.

[0059] In one embodiment, the operating cost of each planned route is calculated, and then the planned route corresponding to the minimum operating cost is determined as the target route for the water-receiving object.

[0060] Operating costs may include, but are not limited to, electricity costs, costs incurred due to head loss, costs incurred due to leakage loss, fuel costs, employee wages and benefits, etc.

[0061] Operating costs are the sum of all expenses.

[0062] Another feasible way to determine the target route is through other means, such as choosing the shortest route among all planned routes, the route that requires the least time to allocate water resources, the route with the least leakage during water resource allocation, or the route with the least head loss during water resource allocation, and so on.

[0063] In this embodiment, before implementing water resource scheduling, the user inputs target data, including the water recipient, water demand, and water demand time, into the terminal device. The terminal device generates at least one planned route that can deliver water resources to the location of the water recipient based on the target data, and then determines the target route for the water recipient from among the planned routes. By combining the water recipient, water demand, and water demand time to simulate the water resource scheduling process, the target route for water resource scheduling of the water recipient is obtained. When water resource scheduling is required for the water recipient, it can be implemented according to the target route, shortening the preparation cycle of water resource scheduling and reducing labor costs.

[0064] Please see Figure 3 This document provides a flowchart illustrating a water resource allocation method for interbedded rock engineering, as illustrated in an embodiment of this application. Figure 3 As shown, the water resource allocation method for interbedded rock engineering may include the following steps:

[0065] S201, Obtain target data, which includes the water receiving object, water demand, and water demand time.

[0066] For a detailed implementation of this step, please refer to step S101, which will not be repeated here.

[0067] S202, combining the DFS algorithm and the greedy algorithm, calculates at least one planned route corresponding to the water-receiving object.

[0068] In one embodiment, by combining the DFS algorithm and the greedy algorithm, all planned routes that can be dispatched to the location of the water-receiving object are obtained from the preset topology map.

[0069] The Depth-First Search (DFS) algorithm is an algorithm for traversing or searching a tree or graph. It traverses the tree's nodes along its depth, searching as deep as possible. When all edges containing a node v have been explored, the search backtracks to the starting node of the edge that found node v. This process continues until all nodes reachable from the source node have been found. If any undiscovered nodes exist, one of them is selected as the source node, and the above process is repeated until all nodes have been visited. It is a blind search.

[0070] Greedy algorithms, also known as greedy algorithms, are algorithms that always make the choice that seems best at the current moment when solving a problem. In other words, they do not consider the overall optimal solution, but rather a locally optimal solution in some sense. The basic idea of ​​a greedy algorithm is to start from an initial solution to the problem and proceed step by step, ensuring that each step, according to a certain optimization metric, leads to a locally optimal solution. Each step considers only one data point, and its selection should satisfy the condition of local optimization. If the next data point, when combined with the partially optimal solution, is no longer feasible, it is not added to the partial solution. This continues until all data points have been enumerated or no more data can be added, at which point the algorithm stops.

[0071] By combining the depth-first search algorithm and the greedy algorithm, the algorithm searches the preset topology map and finds all the water transport routes that can reach the water receiving object, thus ensuring that all feasible water transport routes can be used as the planned routes for the water receiving object.

[0072] The topology diagram is a water transmission route map constructed by the user in the terminal device before water transmission. The water transmission route in the topology diagram is not only the water transmission route of the current water receiving object, but also includes all water receiving objects in the interlocking rock project.

[0073] S203, determine whether there are gate valves and / or pumping stations in the planned route.

[0074] In one embodiment, a query is performed on each planned route to determine if a gate valve and / or pumping station exists.

[0075] Both gate valves and pumping stations have their own identification marks. When checking whether a gate valve or pumping station exists in the planned route, the corresponding mark for the gate valve or pumping station is checked in the planned route.

[0076] The markings for gate valves and pump stations are different, and each marking is unique, just like each person has their own ID number.

[0077] Before determining whether there are gate valves and / or pumping stations in the planned route, first determine the number of planned routes calculated in step S202 above. When there is only one planned route, calculate the operating cost of the planned route. This operating cost is the minimum operating cost that the water recipient will incur when carrying out water resource scheduling. The planned route corresponding to the minimum operating cost is then used as the water transmission route for the water recipient when carrying out water resource scheduling.

[0078] When there are two or more planned routes, it is necessary to calculate the operating cost of each planned route, and then determine the minimum operating cost from all operating costs. The planned route corresponding to the minimum operating cost is then used as the water transmission route for the water recipient when scheduling water resources.

[0079] S204 If there are no gate valves and pumping stations in each planned route, the corresponding planned route is marked as the first planned route. The first target parameters corresponding to each first planned route are calculated using the first standard hydraulic calculation method. The first target parameters include at least head loss, leakage loss and water delivery time.

[0080] In one embodiment, when no identifiers for gate valves and pumping stations are found in the planned route, the corresponding first target parameters are calculated using a first standard hydraulic calculation method.

[0081] The first standard hydraulic calculation method includes multiple standard hydraulic calculations, including at least valve standard hydraulic calculations, channel standard hydraulic calculations, and pipeline standard hydraulic calculations.

[0082] The head loss, leakage loss, and water delivery time for each planned route can be calculated using the standard hydraulic calculations in the first standard hydraulic calculation method.

[0083] Head loss is the loss of mechanical energy per unit weight of liquid during water flow.

[0084] Leakage loss is the amount of water that slowly leaks out of a cooling water system through cracks and pores in pipes, equipment, and cooling facilities.

[0085] Water transport time is the time required for water resources to travel from the source of the water supply to the location of the recipient.

[0086] There are many factors that can influence the calculation of the first target parameter, such as pipe type, pipe length, and flow rate.

[0087] Pipe types include, but are not limited to, pipes and channels. Pipe roughness, or the roughness of a pipe, is a comprehensive dimensionless number reflecting its impact on water flow resistance; the rougher the boundary surface, the greater the roughness; the smoother the boundary surface, the smaller the roughness. Pipe length is the total distance from the source of water resource allocation to the location of the water recipient. Flow rate is the product of the pipe's cross-sectional area and the flow velocity.

[0088] The calculation process utilizes Bernoulli's equation, Chezy's formula, Darcy-Weisbach's formula, and so on.

[0089] Bernoulli's equation, a fundamental principle used in hydraulics before the establishment of the continuous medium theory equations in fluid mechanics, is essentially the conservation of the mechanical energy of a fluid. That is: kinetic energy + gravitational potential energy + pressure potential energy = constant. Its most famous corollary is: for flow at constant height, a higher flow velocity results in lower pressure.

[0090] Bernoulli's principle is often stated as:

[0091]

[0092] This equation is known as Bernoulli's equation. In the equation, p is the pressure at a point in the fluid, v is the velocity of the fluid at that point, ρ is the fluid density, g is the acceleration due to gravity, h is the height of that point, and C is a constant.

[0093] The Xie Cai formula is the main formula for calculating the average flow velocity or head loss along the flow path in uniform flow in open channels and pipes.

[0094] The Chezy formula is in the form of:

[0095]

[0096]

[0097] In the formula, v is the average flow velocity across the cross section (m / s); R is the hydraulic radius (m); A is the cross-sectional area of ​​the flow path; Pw is the perimeter of the part of the flow path in contact with the solid boundary, called the wetted perimeter; J = hf / l is the hydraulic gradient; hf is the head loss along the flow path l; for steady uniform flow in an open channel, J = i (i is the bottom slope of the open channel); C is the Chezy coefficient.

[0098] The Darcy-Weisbach formula is a general formula for calculating head loss along the friction path.

[0099] The Darcy-Weisbach formula is expressed as follows:

[0100]

[0101] In the formula, l is the pipe length; d is the pipe diameter; l / d is called the geometric factor; V is the average velocity inside the pipe; V2 / 2g is the velocity head; λ is the friction coefficient along the flow path, and λ is not a fixed value.

[0102] S205, if there are gate valves and / or pumping stations in each planned route, then each planned route is marked as a second planned route. Using the second standard hydraulic calculation method, the second target parameters corresponding to each second planned route are calculated. The second target parameters include at least head loss, leakage loss, water delivery time, gate valve flow rate and pumping station pressure.

[0103] In one embodiment, when the identifiers of gate valves and / or pumping stations are found in the planned route, the corresponding second target parameters are calculated using a second standard hydraulic calculation method.

[0104] The second standard hydraulic calculation method includes multiple standard hydraulic calculations, including at least gate standard hydraulic calculations, pump station standard hydraulic calculations, valve standard hydraulic calculations, canal standard hydraulic calculations, and pipeline standard hydraulic calculations.

[0105] The head loss, leakage loss, water delivery time, gate valve flow rate, and pump station pressure in each route can be calculated using the standard hydraulic calculations in the second standard hydraulic calculation method.

[0106] The flow rate of a gate valve depends primarily on its diameter, as well as the resistance of its structure to the medium. It is also intrinsically linked to factors such as valve pressure, temperature, and the concentration of the medium.

[0107] Pump station pressure refers to the hydraulic and pneumatic power that a pump station can provide at a certain pressure and flow rate during the water resource allocation process.

[0108] The calculation process utilizes Bernoulli's equation, Chezy's formula, Darcy-Weisbach's formula, and so on.

[0109] S206, by using the range of preset boundary conditions, performs preliminary screening of each planned route to obtain usable paths.

[0110] In one embodiment, by setting the maximum and minimum ranges of the boundary conditions, all planned routes are initially screened to remove routes that do not meet the requirements or routes that contain obstacles that prevent water delivery. This reduces the number of usable routes that are calculated when calculating the target parameters of the planned routes, thereby improving the efficiency of calculating the target parameters of the planned routes.

[0111] Boundary conditions include the maximum and minimum ranges of head loss, leakage loss, water delivery time, gate valve flow rate, and pump station pressure, such as [minimum head loss, maximum head loss], [minimum leakage loss, maximum leakage loss], etc.

[0112] If one of the parameters in a planned route is outside the range of the boundary conditions, then that planned route is removed, and only planned routes in which all parameters are within the boundary conditions are retained.

[0113] S207, compare each first target parameter and each second target parameter with the preset parameters respectively, and determine whether the error is less than or equal to 10%.

[0114] In one embodiment, the first target parameter and the second target parameter calculated in steps S205 and S206 for the planned routes filtered out in step S207 are compared with preset parameters to determine whether the error between each parameter of each planned route and each preset parameter is less than or equal to 10%.

[0115] Each parameter in the first target parameter and the second target parameter is compared with the preset parameters. During the comparison, only parameters of the same type can be compared, and parameters of different types cannot be compared with each other.

[0116] For example, the preset gate valve flow rate is 100m³ / h. 3 That would mean an error of 10m. 3 The gate valve flow rate in the first and second target parameters is between 90 and 110 m³ / s. 3 That's all.

[0117] S208. If the error is less than or equal to 10%, the planned route will be temporarily saved as a provisional route.

[0118] In one embodiment, if each parameter in the first target parameter or the second target parameter of the route is compared with preset parameters, and the error of each parameter in the first target parameter or the second target parameter is less than or equal to 10% of the preset parameters, the planned route corresponding to the first target parameter or the second target parameter is temporarily stored as a provisional route.

[0119] For example, if a planned route lacks gate valves and pumping stations, the corresponding head loss, leakage loss, and water delivery time can be calculated using the standard hydraulic calculations in the first standard hydraulic calculation method. By comparing the head loss, leakage loss, and water delivery time of this planned route with preset values, if the errors in these parameters are all less than or equal to 10%, the route is temporarily designated as a provisional route. If, after comparing the head loss, leakage loss, and water delivery time, the error of one or more of these parameters is greater than 10%, then...

[0120] S209. If the error is greater than 10%, the planned route should be discarded.

[0121] In one embodiment, if each parameter in the first target parameter or the second target parameter of the route is compared with preset parameters, and the error of each parameter in the first target parameter or the second target parameter is greater than 10% of the preset parameters, the planned route corresponding to the first target parameter or the second target parameter is discarded.

[0122] For example, if a planned route does not contain gate valves and pumping stations, the corresponding head loss, leakage loss, and water delivery time can be calculated using the standard hydraulic calculations in the first standard hydraulic calculation method. By comparing the head loss of the planned route with the preset head loss, the leakage loss of the planned route with the preset leakage loss, and the water delivery time of the planned route with the preset water delivery time, the route is temporarily stored as a provisional route. If the error of one or more parameters after comparing the head loss, leakage loss, and water delivery time is greater than 10%, the route is discarded.

[0123] S210, each provisional route is taken as a set of water transport routes for the water receiving object.

[0124] In one embodiment, after comparing each parameter in the first or second target parameter corresponding to each planned route with preset parameters in step S208, the provisional route obtained is determined as the water conveyance route set for the water receiving object, and the error of each parameter corresponding to all provisional routes in the water conveyance route set is less than or equal to 10%.

[0125] The water transfer route plan includes at least one provisional route to ensure that water resources can be delivered to the recipient location.

[0126] S211, calculate the operating costs corresponding to each provisional route in the water conveyance route set.

[0127] In one embodiment, the operating cost corresponding to each provisional route in the water conveyance route set is calculated.

[0128] Operating costs may include, but are not limited to, electricity costs, costs incurred due to head loss, costs incurred due to leakage, etc.

[0129] S212, based on the operating costs of each, the minimum operating cost is obtained using the particle swarm optimization algorithm, and the planned route corresponding to the minimum operating cost is taken as the target route of the water receiving object.

[0130] In one embodiment, for the corresponding operating costs calculated for each provisional route in the water conveyance route set, the particle swarm optimization algorithm is used to iterate from the operating costs of each provisional route to find the minimum operating cost, and the provisional route corresponding to the minimum operating cost is informed to the user as the target route for the water recipient.

[0131] There are many ways for a terminal device to inform a user of the target route information, including but not limited to displaying it on the terminal device's screen, or sending the target route information to the user's personal terminal device in the form of an SMS message, etc.

[0132] Particle Swarm Optimization (PSO) is a group-based stochastic search algorithm developed by simulating the foraging behavior of flocks of birds. PSO initializes with a swarm of random particles (random solutions) and iteratively finds the optimal solution. In each iteration, particles update themselves by tracking two "extremes": the first is the optimal solution found by the particle itself (called the individual extreme value pBest), and the second is the optimal solution found by the entire swarm (called the global extreme value gBest). Alternatively, instead of the entire swarm, only the neighbors of a subset of the best particles can be used; in this case, the extreme value among all neighbors is the local extreme value.

[0133] The minimum operating cost is determined by iteratively from the operating costs of each provisional route, and the number of iterations is preset. After the preset number of iterations, the minimum value in the iteration process is determined, which is the provisional route corresponding to the minimum operating cost. This provisional route is then used as the target route for the water-receiving object.

[0134] In this embodiment, before implementing water resource scheduling, the user inputs target data, including the water recipient, water demand, and water demand time, into the terminal device. The terminal device uses a depth-first search algorithm (DFS) and a greedy algorithm to find a planned route in a preset topology map that can schedule water resources to the location of the water recipient. Then, it checks all planned routes for the presence of gate valves and / or pumping station identifiers. If no gate valve or pumping station identifier is found, the first target parameter corresponding to the planned route is calculated using a first standard hydraulic calculation method. If a gate valve or / or pumping station identifier is found, the second target parameter corresponding to the planned route is calculated using a second standard hydraulic calculation method. Finally, the calculated first and second target parameters are compared with the interval range values ​​of each parameter under preset boundary conditions. The process involves comparing and filtering out planned routes whose parameter values ​​do not meet the preset boundary conditions. Then, the first and second target parameters corresponding to the remaining planned routes are compared with the preset parameters. It is determined whether the error between each parameter of each planned route and the preset parameters is less than or equal to 10%. If the error of each parameter in the first or second target parameters of the route is less than or equal to 10% of the preset parameters, the route is discarded. All provisional routes with errors less than or equal to 10% are then used as a set of water conveyance routes. The operating cost of each provisional route is calculated, and the minimum operating cost is calculated using a particle swarm optimization algorithm. The provisional route with the minimum operating cost is then selected as the target route. When scheduling water resources for this water-receiving object, scheduling work can be carried out using the target routes provided by the terminal equipment, which can save scheduling and manpower costs.

[0135] Before implementing water resource scheduling, the water recipient, its water demand, and water demand time are input into the terminal equipment. The terminal equipment, combined with the algorithm, simulates the possible situations that may occur when scheduling water resources for the water recipient, and finally generates the target route with the least loss and the lowest operating cost. When scheduling water resources for the water recipient, scheduling can be carried out according to the target route, which shortens the cycle of the preliminary work of water resource scheduling and reduces labor costs and scheduling costs.

[0136] Those skilled in the art will clearly understand that the technical solutions of this application can be implemented using software and / or hardware. In this specification, "unit" and "module" refer to software and / or hardware capable of independently performing or cooperating with other components to perform specific functions. Hardware may include, for example, a Field-Programmable Gate Array (FPGA), an Integrated Circuit (IC), etc.

[0137] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0138] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0139] In the several embodiments provided in this application, it should be understood that the disclosed apparatus can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some service interface; the indirect coupling or communication connection between devices or units may be electrical or other forms.

[0140] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0141] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0142] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage device (CMD). Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions to cause an electronic device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned memory includes various media capable of storing program code, such as USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks.

[0143] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, etc.

[0144] The foregoing description is merely an exemplary embodiment of this disclosure and should not be construed as limiting the scope of this disclosure. Any equivalent changes and modifications made in accordance with the teachings of this disclosure shall still fall within the scope of this disclosure. Other embodiments of this disclosure will be readily apparent to those skilled in the art upon consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not described herein. The specification and embodiments are to be considered exemplary only, and the scope and spirit of this disclosure are defined by the claims.

Claims

1. A water resource allocation method for interbedded rock engineering, characterized in that, The method includes: Acquire target data, which includes the water-receiving object, water demand, and water demand time; At least one planned route is calculated based on the target data; The number of planned routes is determined. When there is only one planned route, the corresponding operating cost is calculated based on that planned route. This operating cost is the minimum operating cost, and the planned route corresponding to the minimum operating cost is taken as the target route of the water receiving object. When there are two or more planned routes, the following steps are performed: The target parameters of each of the planned routes are calculated using standard hydraulic calculation methods. The target parameters include head loss, leakage loss and water delivery time. Each of the target parameters is compared with preset parameters to determine whether the error is less than or equal to a preset threshold. If the error is less than or equal to the preset threshold, the planned route will be temporarily saved as a provisional route. If the error exceeds the preset threshold, the planned route will be discarded. Each of the provisional routes is taken as the water transport route set for the water receiving object; The corresponding operating costs are calculated based on each provisional route, and the provisional route with the lowest operating cost is taken as the target route for the water-receiving object.

2. The water resource allocation method for interbedded rock engineering according to claim 1, characterized in that, The calculation of at least one corresponding planned route based on the target data includes: By combining the DFS algorithm and the greedy algorithm, at least one planned route corresponding to the water-receiving object is calculated.

3. A water resource allocation method for interbedded rock engineering according to claim 1, characterized in that, The calculation of target parameters for each planned route using standard hydraulic calculation methods includes: Determine whether there are gate valves and / or pumping stations in the planned route; If there are no gate valves and pumping stations in each of the planned routes, then each of the planned routes is marked as a first planned route. Using the first standard hydraulic calculation method, the first target parameters corresponding to each of the first planned routes are calculated. The first target parameters include at least head loss, leakage loss and water delivery time. If there are gate valves and / or pumping stations in each of the planned routes, the corresponding planned routes are marked as second planned routes. Using the second standard hydraulic calculation method, the second target parameters corresponding to each second planned route are calculated. The second target parameters include at least head loss, leakage loss, water delivery time, gate valve flow rate and pumping station pressure. The step of comparing the target parameters of each planned route with preset parameters and determining whether the error is less than or equal to a preset threshold includes: Each of the first target parameters and each of the second target parameters are compared with preset parameters to determine whether the error is less than or equal to 10%.

4. A water resource allocation method for interbedded rock engineering according to claim 1, characterized in that, Before comparing each of the target parameters with preset parameters and determining whether the error is less than or equal to a preset threshold, the method further includes: By using a preset range of boundary conditions, the planned routes are initially screened to obtain usable paths.

5. A water resource allocation method for interbedded rock engineering according to claim 1, characterized in that, After establishing each of the provisional routes as a set of water transport routes for the water recipient, the method further includes: Calculate the operating costs corresponding to each of the provisional routes in the water conveyance route set; Based on the aforementioned operating costs, the minimum operating cost is obtained using the particle swarm optimization algorithm, and the provisional route corresponding to the minimum operating cost is taken as the target route for the water-receiving object.

Images