CN115907257A - Water resource scheduling method for rock-clamping engineering - Google Patents
Water resource scheduling method for rock-clamping engineering Download PDFInfo
- Publication number
- CN115907257A CN115907257A CN202211486143.9A CN202211486143A CN115907257A CN 115907257 A CN115907257 A CN 115907257A CN 202211486143 A CN202211486143 A CN 202211486143A CN 115907257 A CN115907257 A CN 115907257A
- Authority
- CN
- China
- Prior art keywords
- water
- route
- target
- planned route
- planned
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to the field of water resource scheduling, and particularly discloses a water resource scheduling method for a rock-clamping project, which comprises the following steps: acquiring target data, wherein the target data comprises a water receiving object, water demand and water demand time; calculating at least one corresponding planned route based on the target data; and calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as the target route of the water receiving object. By adopting the embodiment of the application, the water delivery condition is simulated by combining the water receiving object, the water demand and the water demand time before water delivery, the target route of water delivery of the water receiving object is obtained, the period of early-stage work preparation of water resource scheduling is shortened, and meanwhile, the labor cost and the scheduling cost are reduced.
Description
Technical Field
The application relates to the field of water resource scheduling, in particular to a water resource scheduling method for a rock clamping project.
Background
The rock-clamping project is a large-scale water supply project, flood control and water supply are two important tasks, and the water supply range of the project relates to graduate regions (graduation city and generous county), zuyi cities and 5 counties (Qianxy county, jinsha county, nayong county, chengjin county and Renhuai county) as well as 69 towns (25 Qianxy counties, 16 Jinsha counties, 3 Jinsha counties, 9 Nayong counties, 4 Huzhang counties and 2 Zuyi counties), and 365 centralized dwelling points. The general water supply population 267 ten thousand. In addition, the project can generate power (90 Mw/9 ten thousand Kw installed by a power station behind a dam, the average power generation amount for many years is 2.198 hundred million degrees), develop the region and improve the ecological environment.
At present, the scheduling of water resources is mainly realized through the manual work, and scheduling mode, scheduling time and the like are arranged through the manual work, and to the current rock clamping engineering water transfer object numerous, the condition that the water transfer amount is large, although the normal operation of scheduling work can be guaranteed by scheduling arrangement in the manual mode, the earlier preparation working cycle is long, the manpower is consumed, the scheduling cost is high, and the benefit maximization cannot be realized.
Disclosure of Invention
In order to solve the above problems, an embodiment of the application provides a water resource scheduling method for a rock-clamping project, which solves the problem of long early preparation working period in a water resource scheduling process, and further can achieve the purposes of reducing labor cost and scheduling cost.
The embodiment of the application provides a water resource scheduling method for a rock-clamping project, which comprises the following steps:
1. a method of water resource scheduling for a rock-clamping project, the method comprising:
acquiring target data, wherein the target data comprises a water receiving object, water demand and water demand time;
calculating at least one corresponding planned route based on the target data;
and calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as the target route of the water receiving object.
The beneficial effects brought by the technical scheme provided by some embodiments of the application at least comprise:
because the rock clamping project needs to supply water for 267 thousands of rock clamps, the water supply is carried out manually, and the scheduling of water resources needs to be best prepared before scheduling, so that the early preparation working period is long, and the labor cost is high. In the preparation stage before dispatching, the scheme of the application obtains target data comprising the water receiving object, the water demand and the water demand time, plans the water delivery route according to the water receiving object, the water demand and the water demand time to obtain at least one planned route, calculates the operation cost corresponding to each planned route, determines the planned route corresponding to the minimum operation cost as the target route of the water receiving object, delivers water to the water receiving object through the target route, and can meet the water demand and the water demand time required by the water receiving object.
The water delivery condition is simulated by combining the water receiving object, the water demand and the water demand time before water delivery, so that a target route for delivering water to the water receiving object is obtained, the period of early-stage work preparation of water resource scheduling is shortened, and meanwhile, the labor cost and the scheduling cost are reduced.
Optionally, the calculating at least one corresponding planned route based on the target data includes:
and calculating to obtain at least one planning route corresponding to the water-receiving object by combining the DFS algorithm and the greedy algorithm.
By combining a deep search optimization algorithm (DFS algorithm) with a greedy algorithm, all routes capable of realizing water delivery of the water-receiving object are searched out to be used as water delivery routes of the water-receiving object, and all the water delivery routes capable of being realized can be used as water delivery routes of the water-receiving object.
Optionally, after the calculating the corresponding at least one planned route based on the target data, the method further includes:
judging the number of the planned routes, when the planned route is one, calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as a target route of the water-receiving object;
when the planning route is two or more, the following steps are executed:
calculating target parameters of each planned route by using a standard hydraulic calculation method, comparing each target parameter with preset parameters, and judging whether an error is smaller than or equal to a preset threshold value;
if the error is less than or equal to a preset threshold value, temporarily storing the planned route as a temporary route;
if the error is larger than a preset threshold value, abandoning the planned route;
and taking each tentative route as a water delivery route set of the water receiving object.
Calculating parameters in the planned route of the water-receiving object to obtain target parameters of each planned route, comparing the target parameters with preset parameters to ensure that the error between the target parameters of the planned route and the preset parameters does not exceed a preset threshold value, taking the planned route with the error not exceeding the preset threshold value as a water delivery route set, determining the final target route of the water-receiving object from the water delivery route set, and ensuring that the error generated in the water resource scheduling process is within a receivable range.
Optionally, the calculating target parameters of each planned route by using a standard hydraulic calculation method includes:
judging whether a gate valve and/or a pump station exist in the planned route;
if gate valves and pump stations do not exist in the planned routes, marking the corresponding planned routes as first planned routes, and calculating to obtain first target parameters respectively corresponding to the first planned routes by using a first standard hydraulic calculation method, wherein the first target parameters at least comprise head loss, leakage loss and water delivery duration;
if a gate valve and/or a pump station exists in each planned route, marking the corresponding planned route as a second planned route, and calculating to obtain second target parameters respectively corresponding to each second planned route by using a second standard hydraulic calculation method, wherein the second target parameters at least comprise head loss, leakage loss, water delivery time, gate valve flow and pump station pressure;
the step of comparing the target parameters of each planned route with preset parameters and judging whether the error is less than or equal to ten percent comprises the following steps:
and comparing each first target parameter and each second target parameter with preset parameters respectively, and judging whether the error is less than or equal to ten percent.
By judging whether a gate valve and/or a pump station exists in each planned route or not, calculating corresponding target parameters of the planned route with the gate valve and/or the pump station and the route without the gate valve and the pump station, simulating various possible conditions of each planned route, and comparing the corresponding target parameters with preset parameters, the error in the water resource scheduling process is ensured to be less than or equal to 10%, and the error which is too high and unacceptable can not occur.
Optionally, the comparing the target parameter of each planned route with a preset parameter, and determining whether the error is less than or equal to ten percent further includes:
and preliminarily screening each planned route through the interval range of the preset boundary condition to obtain an available path.
The planned routes are preliminarily screened through the interval range of the preset boundary conditions, the non-conforming routes or the routes with obstacles which cannot realize water delivery are removed, the available routes calculated when the target parameters of the planned routes are calculated are reduced, and the calculation efficiency of the target parameters of the planned routes is improved.
Optionally, after the temporary routes are taken as the water delivery route sets of the water receiving objects, the method further includes:
calculating the running cost corresponding to each tentative route in the water delivery route set;
and obtaining the minimum running cost by utilizing a particle swarm algorithm based on the running costs, and taking a planned route corresponding to the minimum running cost as a target route of the water receiving object.
The operation cost of each temporary route in the water delivery route set is calculated, the minimum operation cost is determined, the temporary route with the minimum operation cost is used as the target route of the water receiving object, and the water resource scheduling is carried out on the water receiving object through the target route, so that the scheduling cost is reduced while the error is ensured to be within 10%.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a system architecture diagram of a water resource scheduling method for a rock-clamping project according to an embodiment of the present disclosure;
fig. 2 is a schematic flow chart of a water resource scheduling method for a rock-clamping project according to an embodiment of the present disclosure;
fig. 3 is a schematic flow chart of a water resource scheduling method for a rock-clamping project according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
In the following description, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. The following description provides embodiments of the present application, which may be combined or interchanged with one another, and therefore the present application is also to be construed as encompassing all possible combinations of the same and/or different embodiments described. Thus, if one embodiment includes features a, B, C and another embodiment includes features B, D, then this application should also be construed to include embodiments that include all other possible combinations of one or more of a, B, C, D, although such embodiments may not be explicitly recited in the following text.
The following description provides examples, and does not limit the scope, applicability, or examples set forth in the claims. Changes may be made in the function and arrangement of elements described without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For example, the described methods may be performed in an order different than the order described, and various steps may be added, omitted, or combined. Furthermore, features described with respect to some examples may be combined into other examples.
Referring to fig. 1, a schematic diagram of a system architecture of a water resource scheduling method for a rock-clamping project according to an embodiment of the present application is provided, where the system includes a terminal device, which may include but is not limited to a smart phone, an intelligent interactive tablet, a personal computer, a desktop computer, a tablet computer, a palm computer, a laptop computer, a personal computer, and the like.
When a user needs to carry out water resource scheduling on a certain water-receiving object according to water demand and water demand time, the user inputs target data at least comprising the water-receiving object, the water demand and the water demand time on terminal equipment in a preparation stage before carrying out the water resource scheduling, and the terminal equipment generates a target route capable of realizing the water resource scheduling on the water-receiving object through a preset algorithm according to the target data input by the user. The water delivery condition is simulated by combining the water receiving object, the water demand and the water demand time before water delivery, so that a target route for scheduling the water resource of the water receiving object is obtained, the period of early preparation work of water resource scheduling is shortened, and meanwhile, the labor cost and the scheduling cost are reduced.
On the basis of the system architecture shown in fig. 1, a water resource scheduling method for a rock-clamping project provided by the embodiment of the present application will be described in detail below with reference to fig. 2 to 3.
Referring to fig. 2, a schematic flow chart of a water resource scheduling method for a rock clamping project is provided according to an embodiment of the present application. As shown in fig. 2, the method for scheduling water resources for a rock clamping project may include the following steps:
s101, target data are obtained, and the target data comprise water receiving objects, water demand and water demand time.
In one embodiment, in the process of managing water resource scheduling, if a certain water-receiving object needs to be scheduled, target data is input into the terminal device, that is, the water-receiving object is input, and water demand time are input together, so that the terminal device can receive information input by a user.
The water-receiving object can be a list of picking objects pre-stored in the terminal device by the user in advance, and the user can search and fill the picking objects or can be a newly added water-receiving object.
The water demand may be input by the user when inputting the water-receiving object, or may be preset as the water consumption required by the resident population of the water-receiving object within a time interval, which may include, but is not limited to, 5 days, 7 days, 10 days, 15 days, and the like. The water demand may be that of domestic water, that of industrial water or that of ecological water, etc.
Water demand time, i.e., the time water resources are delivered.
Another way to implement this is that the list of water-receiving objects pre-stored in the terminal device may be pre-set with the water demand corresponding to the water-receiving object according to the previously scheduled water amount, and if the requirement of water demand is not changed, the user only needs to input the water-receiving object and the water demand time in the terminal device. Meanwhile, when the user inputs the water receiving object on the terminal device, a corresponding first time is generated, and the water requiring time may be a corresponding second time after the first time by a preset time interval, where the preset time interval may include, but is not limited to, 24 hours, 48 hours, 36 hours, and the like. If the first time that the user interprets the water-requiring time that the water-receiving object is input on the terminal equipment at present is the corresponding second time after the preset time interval, the user only needs to input the water-receiving object on the terminal equipment.
And S102, calculating to obtain at least one corresponding planning route based on the target data.
In one embodiment, the terminal equipment generates at least one planned route capable of conveying water resources to the position of the water receiving object according to target data which are input by a user and comprise the water receiving object, the water demand and the water demand time.
The planned route generated by the terminal device must be able to convey the amount of water needed by the water-receiving object to the location of the water-receiving object at the time of water demand.
And S103, calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as a target route of the water receiving object.
In one embodiment, the operation cost of each planned route is calculated, and then the planned route corresponding to the minimum operation cost is determined as the target route of the water receiving object.
Operating costs may include, but are not limited to, electricity costs, costs incurred by head loss, costs incurred by leakage loss, fuel costs, employee wages and benefits, and the like.
The operating costs are the sum of the various costs.
In another implementation manner, the manner of determining the target route may be other manners, such as the shortest distance in each planned route, the least time required for scheduling water resources in each planned route, the least leakage in the process of scheduling water resources, the least head loss in the process of scheduling water resources, and so on.
In the embodiment of the application, before water resource scheduling is implemented, target data including water receiving objects, water demand and water demand time are input into the terminal equipment by a user, the terminal equipment generates at least one planned route capable of conveying water resources to the positions of the water receiving objects according to the target data, and then the target route of the water receiving objects is determined from all the planned routes. Through combining the condition among the water receiving object, the water demand and the water demand time simulation water resource scheduling process, and then obtain the target route when carrying out water resource scheduling to this water receiving object, when needing to carry out water resource scheduling to this water receiving object, according to this target route implement can, shortened the cycle of the preliminary preparation work of water resource scheduling, reduced the cost of labor simultaneously.
Referring to fig. 3, a flow chart of a water resource scheduling method for a rock clamping project is provided for an embodiment of the present application. As shown in fig. 3, the method for scheduling water resources for a rock clamping project may include the following steps:
s201, target data are obtained, and the target data comprise water receiving objects, water demand and water demand time.
In the present embodiment, reference may be made to step S101, which is not described herein again.
And S202, calculating to obtain at least one planning route corresponding to the water-receiving object by combining the DFS algorithm and the greedy algorithm.
In one embodiment, by combining the DFS algorithm and the greedy algorithm, all planning routes which can realize the scheduling of water resources to the positions of the water-receiving objects are obtained in a preset topological graph.
The DFS algorithm, a Depth-First-Search (DFS), is an algorithm used to traverse or Search a tree or graph. When all the edges of the node v have been searched, the search will trace back to the starting node of the edge where the node v is found. This process continues until all nodes reachable from the source node have been discovered. If there are more undiscovered nodes, then one is selected as the source node and the process is repeated, with the entire process being repeated until all nodes have been accessed. Belongs to blind search.
Greedy algorithm, also called greedy algorithm, means that when solving a problem, always the best choice is made in the current view. That is, rather than being considered globally optimal, he makes a locally optimal solution in some sense. The basic idea of the greedy algorithm is to proceed step by step from a certain initial solution of the problem, and according to a certain optimization measure, each step is required to ensure that a local optimal solution can be obtained. Only one data is considered in each step, and the selection of the data should meet the condition of local optimization. If the next data and partial optimal solution are no longer feasible solutions to join, the data is not added to the partial solution until all the data is enumerated, or the algorithm can no longer be added.
Through the combination of the deep-swimming first search algorithm and the greedy algorithm, the water delivery routes of the water receiving objects are all searched out as the planned routes of the water receiving objects by searching in the preset topological graph, and the water delivery routes which can be realized can be ensured to be used as the planned routes of the water receiving objects.
The topological graph is a water delivery route graph constructed in terminal equipment before water delivery is carried out by a user, and the water delivery route in the topological graph is not only the water delivery route of the current water receiving object, but also comprises all the water receiving objects in the rock clamping project.
S203, judging whether a gate valve and/or a pump station exist in the planned route.
In one embodiment, a query is made in each planned route as to whether gate valves and/or pumping stations are present.
The gate valve and the pump station have own table identifiers, and when the gate valve or the pump station exists in the planned route or not, the planned route is inquired to determine whether the identifiers corresponding to the gate valve and the pump station exist or not.
The corresponding marks of the gate valve and the pump station are inconsistent and unique, and the identity is the same as that of each person with the corresponding identity card number.
Before judging whether a gate valve and/or a pump station exists in the planned route, the number of the planned routes calculated in the step S202 is judged, when only one planned route is calculated, the running cost of the planned route is calculated, the running cost is the minimum running cost generated when the water resource scheduling is carried out on the water-receiving object, and the planned route corresponding to the minimum running cost is used as the water delivery route when the water resource scheduling is carried out on the water-receiving object.
When two or more than two planned routes exist, the operation cost of each planned route needs to be calculated, then the minimum operation cost is determined from all the operation costs, and the planned route corresponding to the minimum operation cost is used as the water delivery route when the water receiving object is subjected to water resource scheduling.
And S204, if the gate valve and the pump station do not exist in each planned route, marking the corresponding planned route as a first planned route, and calculating to obtain first target parameters respectively corresponding to each first planned route by using a first standard hydraulic calculation method, wherein the first target parameters at least comprise head loss, leakage loss and water delivery duration.
In one embodiment, when no corresponding gate valve and pump station identification is queried in the planned route, a corresponding first target parameter is calculated using a first standard hydraulic calculation method.
The first standard hydraulic calculation method comprises a plurality of standard hydraulic calculations, at least comprising valve standard water level calculation, channel standard water level calculation, pipeline standard water level calculation and the like.
The head loss, the leakage loss, the water delivery duration and the like in each planned route can be calculated through each standard hydraulic calculation in the first standard hydraulic calculation method.
Head loss, loss of mechanical energy per unit weight of liquid in the water stream during movement.
The leakage loss is the amount of water in the cooling water system that slowly leaks through cracks and pores in pipes, equipment and cooling facilities.
The water delivery time is the time required by water resources from the scheduling source to the position of the water-receiving object.
In the calculation of the first target parameter, there are many factors that can affect, for example, the kind of pipe, the length of pipe, the flow rate, and the like.
The types of pipes include, but are not limited to, pipes and channels. The roughness of the pipeline, namely the roughness of the pipeline, reflects a comprehensive dimensionless number which influences the water flow resistance, and the roughness is larger when the boundary surface is rougher; the smoother the boundary surface, the less the roughness. The pipe length, i.e. the length of the pipeline or channel, is the total length of the distance from the source of the water resource scheduling to the location of the water-receiving object. Flow, i.e. the product of the cross-sectional area of the pipe and the flow velocity.
Bernoulli's equation, thanksia's equation, darcy-Weiji's Baha's equation, etc. are used in the calculation process.
Bernoulli's equation, the basic principle adopted by hydraulics before the establishment of the continuous medium theory equation of hydrodynamics, is essentially the conservation of mechanical energy of fluids. Namely: kinetic energy + gravitational potential energy + pressure potential energy = constant. Its best known reasoning is: when the flow is equal in height, the flow rate is high, and the pressure is low.
The bernoulli principle is often expressed as:
this equation is called bernoulli's equation. In the formula, p is the pressure of a certain point in the fluid, v is the flow velocity of the point in the fluid, ρ is the density of the fluid, g is the gravity acceleration, h is the height of the point, and C is a constant.
Thanks to the equation, the main equation for calculating the average flow velocity of the uniform flow of the open channel and the pipeline or the head loss along the way is calculated.
The form of the talent equation is:
wherein v is the average flow velocity (m/s) across the section; r is hydraulic radius (m), A is the area of a water passing section, and Pw is the perimeter of a contact part of water flow and a solid boundary, which is called wet perimeter; j = hf/l is the hydraulic slope, hf is the on-way head loss within flow section l, J = i (i is the open channel bottom slope) for constant uniform flow in the open channel; c is the metabolic coefficient
Darcy-weishibara formula, a general formula for calculating the head loss along the way.
The expression of the darcy-weishi baha formula is:
wherein l is the length of the tube; d is the pipe diameter; l/d is called the geometric factor; v is the average velocity in the tube; v 2 The/2 g is the velocity head; λ is the coefficient of in-path friction resistance, and λ is not a definite value.
S205, if the gate valve and/or the pump station exist in each planned route, marking each corresponding planned route as a second planned route, and calculating to obtain second target parameters respectively corresponding to each second planned route by using a second standard hydraulic calculation method, wherein the second target parameters at least comprise water head loss, leakage loss, water delivery time, gate valve flow and pump station pressure.
In one embodiment, when the gate valve and/or pump station identification is queried in the planned route, a corresponding second target parameter is calculated using a second standard hydro-calculation method.
The second standard hydraulic calculation method comprises a plurality of standard hydraulic calculations, at least comprising gate standard hydraulic calculation, pump station standard hydraulic calculation, valve standard underwater calculation, channel standard underwater calculation, pipeline standard underwater calculation and the like.
And the head loss, the leakage loss water delivery time, the gate valve flow, the pump station pressure and the like in each route can be calculated through each standard hydraulic calculation in the second standard hydraulic calculation method.
The flow rate of the gate valve, the flow rate of the valve and the flow velocity of the valve are mainly determined by the drift diameter of the valve, are related to the resistance of the structural type of the valve to a medium, and are internally related to various factors such as the pressure, the temperature and the concentration of the medium of the valve.
The pressure of the pump station, the hydraulic power and the pneumatic power of certain pressure and flow that the pump station can provide in the process of water resource scheduling.
Bernoulli's equation, thanksia's equation, darcy-Weiji's Baha's equation, etc. are used in the calculation process.
And S206, preliminarily screening each planned route through the interval range of the preset boundary condition to obtain an available path.
In one embodiment, all planned routes are preliminarily screened through presetting the maximum value range and the minimum value range of the boundary conditions, non-conforming routes or routes with obstacles which cannot realize water delivery in the routes are removed, the routes which are all available and calculated when the target parameters of the planned routes are calculated are reduced, and the calculation efficiency of the target parameters of the planned routes is improved.
The boundary conditions include head loss, leakage loss, water delivery duration, gate valve flow rate, and pump station pressure, etc. to maximum and minimum ranges, e.g., [ minimum head loss, maximum head loss ], [ minimum leakage loss, maximum leakage loss ], etc.
And if the numerical value of one parameter is not in the range of the boundary condition, the planned route is removed, and the planned route with all the parameters in the range of the boundary is reserved.
And S207, comparing each first target parameter and each second target parameter with preset parameters respectively, and judging whether the error is less than or equal to ten percent.
In one embodiment, the first target parameter and the second target parameter calculated in the steps S205 and S206 of the planned route filtered in the step S207 are compared with the preset parameters, and whether the error between each parameter of each planned route and each preset parameter is less than or equal to 10% is determined.
And comparing each parameter in the first target parameter and the second target parameter with each preset parameter correspondingly, wherein only the same parameter types can be compared during comparison, and different parameter types cannot be compared with each other.
For example, the preset gate valve flow rate is 100m 3 That error is 10m 3 The flow rate of the gate valve in the first target parameter and the second target parameter is between 90 and 110m 3 The method can be carried out in the middle.
S208, if the error is less than or equal to ten percent, temporarily storing the planned route as a tentative route.
In one embodiment, if each of the first target parameter or the second target parameter of the route is compared with a preset parameter, and an error of each of the first target parameter or the second target parameter in the preset parameter is less than or equal to 10%, the planned route corresponding to the first target parameter or the second target parameter is temporarily stored as a tentative route.
For example, if there is no gate valve or pump station in a planned route, the corresponding parameters such as head loss, leakage loss, and water delivery duration can be calculated by each standard hydraulic calculation in the first standard hydraulic calculation method, the head loss of the planned route is compared with the preset head loss, the leakage loss of the planned route is compared with the preset leakage loss, the water delivery duration of the planned route is compared with the preset water delivery duration, when the errors of the head loss, the leakage loss, and the water delivery duration are all less than or equal to 10% of the errors of the preset head loss, the leakage loss, and the water delivery duration, the route is temporarily stored as a temporary route, when the errors of one or more of the parameters are greater than 10% after the comparison of the head loss, the leakage loss, and the water delivery duration,
s209, if the error is greater than ten percent, the planned route is discarded.
In one embodiment, if each of the first target parameter or the second target parameter of the route is compared with each of the preset parameters, and the error of each of the first target parameter or the second target parameter in each of the preset parameters is greater than 10%, the planned route corresponding to the first target parameter or the second target parameter is discarded.
For example, if a gate valve and a pump station do not exist in a certain planned route, parameters such as corresponding head loss, leakage loss and water delivery duration can be calculated through each standard hydraulic calculation in the first standard hydraulic calculation method, the head loss of the planned route is compared with a preset head loss, the leakage loss of the planned route is compared with a preset leakage loss, the water delivery duration of the planned route is compared with a preset water delivery duration, the route is temporarily stored as a temporary route, and when the head loss, the leakage loss and the water delivery duration are compared, and the error of one or more of the parameters is larger than 10%, the route is discarded.
And S210, taking each temporary route as a water conveying route set of a water receiving object.
In one embodiment, after comparing each parameter of the first target parameter or the second target parameter corresponding to each planned route in step S208 with each preset parameter, the obtained tentative route is determined as the water delivery route set of the water receiving object, and the error of each parameter corresponding to all tentative routes in the water delivery route set is less than or equal to 10%.
The water delivery routes at least comprise one temporary route in a centralized way, and the water resources can be dispatched to the position of the water receiving object.
And S211, calculating the running cost corresponding to each tentative route in the water delivery route set.
In one embodiment, the operating cost for each tentative route in the set of water delivery routes is calculated.
Operating costs may include, but are not limited to, electricity costs, costs incurred by head loss, costs incurred by leakage loss, and the like.
And S212, obtaining the minimum running cost by utilizing a particle swarm algorithm based on the running costs, and taking a planned route corresponding to the minimum running cost as a target route of the water receiving object.
In one embodiment, for the respective running costs calculated for each tentative route in the water delivery route set, a particle swarm algorithm is used to iterate out the minimum running cost from the running costs of each tentative route, and the tentative route corresponding to the minimum running cost is used as the target route of the water receiving object to inform the user.
The way for the terminal device to inform the user of the information of the target route is many, and may include but not limited to displaying on a display screen of the terminal device, or sending the information of the target route to a personal terminal device of the user in the form of a short message, and the like.
Particle Swarm Optimization (PSO), in turn, translates into Particle Swarm optimization, or Particle Swarm optimization. The method is a random search algorithm based on group cooperation and developed by simulating foraging behavior of a bird group. The PSO is initialized to a population of random particles (a random solution), and then the optimal solution is found through iterations, where in each iteration the particles update themselves by tracking two "extrema". The first is the optimal solution found by the particle itself, this solution is called the individual extremum pBest, the other extremum is the optimal solution found by the whole population, this extremum is the global extremum gBest. Alternatively, instead of using the entire population, only the neighbors of a portion of the optimal particles may be used, and then the extremum in all neighbors is the local extremum.
And determining the minimum running cost from the running costs of each tentative route through iteration, wherein the iteration times are preset, after the iteration of the preset times, determining the minimum value in the iteration process to obtain the tentative route corresponding to the minimum running cost, and taking the tentative route as the target route of the water-receiving object.
In the embodiment of the application, before water resource scheduling is implemented, target data including a water receiving object, water demand and water demand time are input into terminal equipment by a user, the terminal equipment finds out a planned route capable of scheduling water resources to the position of the water receiving object in a preset topological graph by combining a depth-first search algorithm (DFS algorithm) and a greedy algorithm, then inquires whether identifiers of a gate valve and/or a pump station exist in all the planned routes, if the identifiers of the gate valve and the pump station cannot be inquired, a first target parameter corresponding to the planned route is calculated by using a first standard hydraulic calculation method, and if the identifiers of the gate valve and/or the pump station can be inquired, a second target parameter corresponding to the planned route is calculated by using a second standard hydraulic calculation method, then comparing each parameter value in the calculated first target parameter and second target parameter with the interval range value of the boundary condition preset by each parameter, screening out the planned route of which the parameter value does not conform to the interval range value of the boundary condition preset by each parameter, then comparing the first target parameter and second target parameter corresponding to the rest planned route with the preset parameters, judging whether the error between each parameter of each planned route and each preset parameter is less than or equal to 10%, if the error between each parameter in the first target parameter or the second target parameter of the route and each preset parameter is less than or equal to 10%, otherwise, discarding the route, then using all temporary routes with the error less than or equal to 10% as a water conveying route set, and calculating the running cost corresponding to each temporary route, and then calculating the minimum running cost by utilizing a particle swarm algorithm, and taking a temporary route corresponding to the minimum running cost as a target route. When the water resource scheduling is carried out on the water-receiving object, the scheduling work is carried out through the target route given by the terminal equipment, and the scheduling cost and the labor cost can be saved.
Before water resource scheduling is implemented, water-receiving objects and water demand time of the water-receiving objects are input into terminal equipment, the terminal equipment is combined with an algorithm to simulate conditions which possibly occur when the water-receiving objects are subjected to water resource scheduling, a target route with the minimum loss and the minimum running cost is finally generated, when the water-receiving objects are subjected to water resource scheduling, scheduling is carried out according to the target route, the period of early-stage preparation work of the water resource scheduling is shortened, and meanwhile labor cost and scheduling cost are reduced.
It is clear to a person skilled in the art that the solution of the present application can be implemented by means of software and/or hardware. The term "unit" and "module" in this specification refers to software and/or hardware capable of performing a specific function independently or in cooperation with other components, wherein the hardware may be, for example, a Field-ProgrammaBLE Gate Array (FPGA), an Integrated Circuit (IC), or the like.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to the related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some service interfaces, devices or units, and may be an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a memory and includes instructions for causing an electronic device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned memory comprises: various media capable of storing program codes, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program, which is stored in a computer-readable memory, and the memory may include: flash disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.
The above description is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure should not be limited thereby. It is intended that all equivalent variations and modifications made in accordance with the teachings of the present disclosure be covered thereby. Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (6)
1. A water resource scheduling method for a rock-clamping project, characterized by comprising the following steps:
acquiring target data, wherein the target data comprises a water receiving object, water demand and water demand time;
calculating at least one corresponding planned route based on the target data;
and calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as the target route of the water receiving object.
2. The method as claimed in claim 1, wherein the calculating at least one planned route based on the target data includes:
and calculating to obtain at least one planning route corresponding to the water-receiving object by combining the DFS algorithm and the greedy algorithm.
3. The method as claimed in claim 1, wherein after the calculating of the corresponding at least one planned route based on the target data, the method further comprises:
judging the number of the planned routes, when the planned route is one, calculating corresponding running cost based on each planned route, and taking the planned route corresponding to the minimum running cost as a target route of the water-receiving object;
when the planning route is two or more, the following steps are executed:
calculating target parameters of each planned route by using a standard hydraulic calculation method, comparing each target parameter with preset parameters, and judging whether an error is smaller than or equal to a preset threshold value;
if the error is less than or equal to a preset threshold value, temporarily storing the planned route as a temporary route;
if the error is larger than a preset threshold value, abandoning the planned route;
and taking each tentative route as a water delivery route set of the water receiving object.
4. The method as claimed in claim 3, wherein the calculating the target parameters of each planned route by using a standard hydraulic calculation method comprises:
judging whether a gate valve and/or a pump station exist in the planned route;
if gate valves and pump stations do not exist in the planned routes, marking the corresponding planned routes as first planned routes, and calculating to obtain first target parameters respectively corresponding to the first planned routes by using a first standard hydraulic calculation method, wherein the first target parameters at least comprise head loss, leakage loss and water delivery duration;
if a gate valve and/or a pump station exists in each planned route, marking each corresponding planned route as a second planned route, and calculating to obtain second target parameters respectively corresponding to each second planned route by using a second standard hydraulic calculation method, wherein the second target parameters at least comprise head loss, leakage loss, water delivery time, gate valve flow and pump station pressure;
the step of comparing the target parameter of each planned route with a preset parameter and judging whether the error is less than or equal to a preset threshold value comprises the following steps:
and comparing each first target parameter and each second target parameter with preset parameters respectively, and judging whether the error is less than or equal to ten percent.
5. The method as claimed in claim 3, wherein before comparing each of the target parameters with a preset parameter and determining whether an error is less than or equal to a preset threshold, the method further comprises:
and preliminarily screening each planned route through the interval range of the preset boundary condition to obtain an available path.
6. The method for scheduling water resources for tong-rock engineering according to claim 3, wherein after the temporary routes are collected as the water delivery routes of the water-receiving object, the method further comprises:
calculating the running cost corresponding to each tentative route in the water delivery route set;
and obtaining the minimum running cost by utilizing a particle swarm algorithm based on the running costs, and taking a planned route corresponding to the minimum running cost as a target route of the water receiving object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211486143.9A CN115907257A (en) | 2022-11-24 | 2022-11-24 | Water resource scheduling method for rock-clamping engineering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211486143.9A CN115907257A (en) | 2022-11-24 | 2022-11-24 | Water resource scheduling method for rock-clamping engineering |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115907257A true CN115907257A (en) | 2023-04-04 |
Family
ID=86474280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211486143.9A Pending CN115907257A (en) | 2022-11-24 | 2022-11-24 | Water resource scheduling method for rock-clamping engineering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115907257A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116629562A (en) * | 2023-05-30 | 2023-08-22 | 南京新高智联信息技术有限公司 | Gate pump station group water source joint scheduling method and system |
-
2022
- 2022-11-24 CN CN202211486143.9A patent/CN115907257A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116629562A (en) * | 2023-05-30 | 2023-08-22 | 南京新高智联信息技术有限公司 | Gate pump station group water source joint scheduling method and system |
| CN116629562B (en) * | 2023-05-30 | 2024-02-09 | 南京新高智联信息技术有限公司 | Gate pump station group water source joint scheduling method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jing et al. | Distributed or centralized? Designing district-level urban energy systems by a hierarchical approach considering demand uncertainties | |
| Zhang et al. | Automatic partitioning of water distribution networks using multiscale community detection and multiobjective optimization | |
| Shamir et al. | Optimal real-time operation of urban water distribution systems using reduced models | |
| CN103839190A (en) | Pipe network node flow measuring and dispatching method based on pressure monitoring | |
| CN102147830B (en) | Method and system for optimally designing water supply pipe network | |
| CN102414714A (en) | Energy management apparatus, method, and system | |
| Mehta et al. | Design of optimal water distribution systems using WaterGEMS: a case study of Surat city | |
| CN115907257A (en) | Water resource scheduling method for rock-clamping engineering | |
| CN101916313A (en) | Function optimization method for city water-supply pipe network | |
| Liu et al. | A systems dynamic model of a coal-based city with multiple adaptive scenarios: A case study of Ordos, China | |
| Ramesh et al. | Micro water distribution networks: A participatory method of sustainable water distribution in rural communities | |
| Mohammad Rezapour Tabari | Conjunctive use management under uncertainty conditions in aquifer parameters | |
| Castro-Gama et al. | A graph theoretical sectorization approach for energy reduction in water distribution networks | |
| Schlueter et al. | Analysis of georeferenced building data for the identification and evaluation of thermal microgrids | |
| CN105488612A (en) | Monte-Carlo method based reliability analysis method for buried vertical pipe of ground source heat pump | |
| CN115879652B (en) | Hierarchical collaborative planning method and device for energy network, electronic equipment and storage medium | |
| Gama et al. | Towards increased water and energy efficiencies in water distribution systems. | |
| Cilliers et al. | Benchmarking the electricity use of deep-level mine compressors | |
| CN112952814B (en) | Regional energy Internet evolution simulation method considering town growth characteristics | |
| CN115859808A (en) | Pump set work prediction method and device, electronic equipment and storage medium | |
| Deidda et al. | Finding economic optimality in leakage reduction: a cost-simulation approach for complex urban supply systems | |
| CN111369102B (en) | Method and device for extracting waterlogging risk points | |
| Ahmadullah et al. | Construction of hydraulically balanced water distribution network | |
| CN113807573A (en) | Construction prediction analysis method and system based on data management and three-dimensional search | |
| Utami et al. | Developing reference building for campus type buildings in Universitas Gadjah Mada |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |