CN111102212B - Method and device for scheduling cascade pump station and electronic equipment - Google Patents
Method and device for scheduling cascade pump station and electronic equipment Download PDFInfo
- Publication number
- CN111102212B CN111102212B CN201911424009.4A CN201911424009A CN111102212B CN 111102212 B CN111102212 B CN 111102212B CN 201911424009 A CN201911424009 A CN 201911424009A CN 111102212 B CN111102212 B CN 111102212B
- Authority
- CN
- China
- Prior art keywords
- flow
- water
- pump
- pump station
- water pump
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims abstract description 383
- 239000011159 matrix material Substances 0.000 claims description 55
- 238000003860 storage Methods 0.000 claims description 50
- 230000005611 electricity Effects 0.000 claims description 39
- 238000005086 pumping Methods 0.000 claims description 25
- 230000006870 function Effects 0.000 claims description 19
- 238000013461 design Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 8
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000004364 calculation method Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000012888 cubic function Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005498 polishing Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- F—MECHANICAL ENGINEERING; LIGHTING; HEATING; WEAPONS; BLASTING
- F04—POSITIVE - DISPLACEMENT MACHINES FOR LIQUIDS; PUMPS FOR LIQUIDS OR ELASTIC FLUIDS
- F04D—NON-POSITIVE-DISPLACEMENT PUMPS
- F04D15/00—Control, e.g. regulation, of pumps, pumping installations or systems
- F04D15/0072—Installation or systems with two or more pumps, wherein the flow path through the stages can be changed, e.g. series-parallel
-
- E—FIXED CONSTRUCTIONS
- E03—WATER SUPPLY; SEWERAGE
- E03B—INSTALLATIONS OR METHODS FOR OBTAINING, COLLECTING, OR DISTRIBUTING WATER
- E03B5/00—Use of pumping plants or installations; Layouts thereof
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Hydrology & Water Resources (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- Mechanical Engineering (AREA)
- General Engineering & Computer Science (AREA)
- Control Of Positive-Displacement Pumps (AREA)
Abstract
The invention provides a cascade pump station scheduling method and electronic equipment. Then, obtaining the power of the water pumps corresponding to different starting numbers respectively; then, determining the target starting number corresponding to the minimum operating power of the water pump; and finally, obtaining the target starting flow of each water pump in the pump station according to the water demand of the pump station and the target starting number. By the method, the starting flow of each full-angle-modulation water pump in the pump station can be reasonably scheduled on the premise of meeting the water demand of the pump station, and each water pump can run at lower power, so that the power consumption of the system is reduced. Compared with the complex calculation steps of the scheme for water resource scheduling in the related technology, the step pump station scheduling method provided by the invention has simple steps, so that the consumption of electronic equipment is low.
Description
Technical Field
The embodiment of the invention relates to the technical field of intelligent water conservancy, in particular to a cascade pump station scheduling method and electronic equipment.
Background
The intelligent water conservancy utilizes advanced technologies such as internet, cloud computing and GIS to improve the management efficiency and social service level of water conservancy departments, promote water conservancy information construction and gradually realize information technology standardization, information acquisition automation, information transmission networking, information management integration, service processing intellectualization and government affair office electronization.
Because water resources in China are not uniformly distributed, part of local water resources cannot meet the requirements of local basic life and production, and the problem of non-uniform water resource distribution becomes a subject of domestic and foreign research in recent years. A plurality of long-distance and cross-basin water transfer projects are built in China, water in regions with rich water resources is led to regions with poor water resources, the problem of water resource shortage in partial regions is solved to a great extent, and then the healthy development of local economy is promoted.
However, the cascade pump station has a large scale and is complex to operate, and an unreasonable decision may cause problems such as insufficient water supply, water waste or frequent startup. At present, in the actual operation process of a cascade pump station in China, the operation decision is often based on experience, the scheduling scheme is unreasonable, and the operation condition of the unit cannot be reasonably determined according to the actual flow demand, so that the operation flow is too small or too large, the flow is too small to meet the water supply demand, and the unit consumes too high energy due to the too large flow.
Disclosure of Invention
The embodiment of the invention provides a method for scheduling a cascade pump station and electronic equipment, which are used for solving the problem that the scheduling of the cascade pump station in the related technology cannot reasonably determine the operation working condition of a unit according to the actual flow demand, so that the operation flow is too small or too large.
In a first aspect, an embodiment of the present invention provides a method for scheduling a cascade pump station, including:
s1, obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump station of the cascade pump stationsα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow of the water pump is adopted, and alpha is the angle of a blade of the water pump;
s2, obtaining the corresponding relation between the power and the flow of the water pump based on the first relation and the second relation;
s3, determining the maximum flow and the minimum flow of the water pump capable of running;
s4, calculating the number of openable machines of the pump station according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of running, and obtaining the starting flow corresponding to different starting machines;
s5, obtaining water pump powers corresponding to different starting numbers according to the starting flows corresponding to the different starting numbers and the corresponding relation between the water pump powers and the flows;
s6, determining the target startup number corresponding to the minimum operating power of the water pump according to the water pump power corresponding to different startup numbers;
and S7, obtaining the target starting flow of each water pump according to the water demand of the pump station and the target starting number.
Further, in S2, the obtaining a corresponding relationship between power and flow rate of the water pump based on the first relationship and the second relationship specifically includes:
obtaining the flow and the power of the water pump at a given angle and the current head based on the first relation and the second relation;
and obtaining the corresponding relation between the power and the flow of the water pump based on the flow and the power of the water pump at the given angle and the current lift.
Further, in S4, calculating the number of openable stations of the pump station according to the water demand of the pump station, and the maximum flow rate and the minimum flow rate at which each water pump can operate, includes:
dividing the water demand of the pump station by the maximum flow to obtain a first result, and rounding the first result upwards to obtain the minimum starting number; dividing the water demand of the pump station by the minimum flow to obtain a second result, and rounding the second result upwards to obtain the maximum starting number;
and obtaining the number of the starting-up units of the pump stations according to the minimum starting-up number and the maximum starting-up number of the pump stations.
Further, before S4, the method further includes:
obtaining the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price; on the premise of meeting the water flow requirement of each channel, the minimum running cost of the cascade pump station is taken as a target, and a linprog function is used for solving to obtain the target flow of each stage of pump station.
Further, according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price, on the premise of meeting the water flow required by each channel, the target flow of each stage of pump station is solved by using a linprog function with the minimum running cost of the cascade pump station as the target, and the method comprises the following steps:
s100, when electricity prices are the same at different time periods in a day, on the premise that the water flow required by each channel in the cascade pump station is met, the minimum running cost of the cascade pump station is taken as a target, and a linprog function is used for solving according to the flow required by each channel, the current water storage capacity of each channel and the local electricity prices, so that the target flow of each stage of pump station is obtained; or,
and S200, when the electricity prices are different at different time intervals in a day, on the premise of meeting the water flow requirement of each channel according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the electricity prices of local time intervals, solving by using a linprog function with the minimum running cost of the cascade pump station as a target to obtain the target flow of each stage of pump station.
Further, the S100 specifically includes:
s101, acquiring water demand flow of each channel in the cascade pump station;
s102, obtaining the current water storage capacity of each channel in the cascade pump station;
s103, obtaining a first parameter Am and a second parameter Bm of the mth channel according to the water demand flow and the current water storage capacity of each channel; wherein, the first parameter Am is (the current water storage amount of the mth channel from the lower limit of the water storage amount of the mth channel)/3600/24 + the water demand flow of the mth channel; the second parameter Bm is (the upper limit of the water storage capacity of the mth channel-the current water storage capacity of the mth channel)/3600/24 + the water demand flow of the mth channel;
s104, obtaining a matrix f of each stage of pump station; wherein:
P1 is provided with～PM is provided withRespectively representing the design power of each stage of pump station; q1 is provided with～QM is provided withRespectively representing the design flow of each stage of pump station; m is the total stage number of the pump station; the first electricity price represents a local electricity price;
s105, obtaining a matrix A;
wherein a1 ═ (0.. 0-1), and "0.. 0" in a1 includes M-1 0 s; a2 ═ e (M), when M ═ 9, a2 is a ninth order identity matrix; a3 and a4 are the same and are a matrix of (M-1) xM;
s106, obtaining a matrix b based on the first parameter Am and the second parameter Bm; wherein:
a5 represents the design flow (-1) of the Mth stage pump station; a6 is a matrix of M × 1, and each row in a6 is the maximum flow of each stage of pumping station; a7 is a matrix of (M-1) × 1, each row in a7 is-Am; a8 is a matrix of (M-1) × 1, each row Bm;
s107, based on the matrixes f, A and b, solving by using a linprog function with the aim of minimizing the operating cost of the cascade pump station to obtain a matrix X; wherein, X is an MX 1 matrix, and each number in X corresponds to the target flow of each stage of pump station; wherein, the target flow of the pump station is the water demand of the pump station in S4.
Further, the method further comprises:
calculating the total operation cost of the cascade pump station in one day based on the matrix X;
the total running cost is as follows:
in the formula, i is any integer between 1 and M; xiThe target flow of the i-th stage pumping station.
In a second aspect, an embodiment of the present invention provides a cascade pump station scheduling apparatus, including:
the water pump parameter relation obtaining module is used for obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump station of the cascade pump stationsα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow of the water pump is adopted, and alpha is the angle of a blade of the water pump;
the power flow relation obtaining module is used for obtaining the corresponding relation between the power and the flow of the water pump based on the first relation and the second relation;
the flow threshold value determining module is used for determining the maximum flow and the minimum flow of the water pump which can run;
the starting-up machine number calculating module is used for calculating the starting-up machine number of the pump station according to the water requirement of the pump station and the maximum flow and the minimum flow of each water pump capable of running and obtaining the starting-up flow corresponding to different starting-up machine numbers;
the water pump power obtaining module is used for obtaining water pump powers respectively corresponding to different starting numbers according to the starting flows respectively corresponding to the different starting numbers and the corresponding relation between the water pump powers and the flows;
the target starting-up number determining module is used for determining the target starting-up number corresponding to the minimum operating power of the water pumps according to the water pump powers respectively corresponding to different starting-up numbers;
and the target starting-up flow obtaining module is used for obtaining the target starting-up flow of each water pump according to the water demand of the pump station and the target starting-up number.
In a third aspect, an embodiment of the present invention provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps of the cascade pump station scheduling method according to the embodiment of the first aspect of the present invention.
In a fourth aspect, an embodiment of the present invention provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the cascade pump station scheduling method according to an embodiment of the first aspect of the present invention.
According to the cascade pump station scheduling method, the cascade pump station scheduling device and the electronic equipment, the number of the started pump stations is determined according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of running. Then, obtaining the power of the water pumps corresponding to different starting numbers respectively; then, determining the target starting number corresponding to the minimum operating power of the water pump; and finally, obtaining the target starting flow of each water pump in the pump station according to the water demand of the pump station and the target starting number. By the method, the starting flow of each full-angle-modulation water pump in the pump station can be reasonably scheduled on the premise of meeting the water demand of the pump station, and each water pump can run at lower power, so that the power consumption of the system is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or technical solutions in related arts, the drawings used in the description of the embodiments or related arts will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a cascade pump station scheduling method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a system of a cascade pump station according to an embodiment of the present invention;
fig. 3 is a block diagram of a cascade pump station dispatching device according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
At present, the cascade pump station is large in scale and complex to operate, and unreasonable decision can cause the problems of insufficient water supply, water waste or frequent startup and the like. At present, in the actual operation process of the cascade pump station, the operation decision is often based on experience, the scheduling scheme is unreasonable, and the operation condition of the unit cannot be reasonably determined according to the actual flow demand, so that the operation flow is too small or too large, the flow is too small to meet the water supply demand, and the flow is too large to cause the unit to consume too high energy.
Therefore, the embodiment of the invention provides a method for dispatching a cascade pump station, which can reasonably dispatch the starting flow of each full-angle water pump in the pump station on the premise of meeting the water demand of the pump station, and enable each water pump to run at lower power, thereby reducing the power consumption of a system. The problem of in the correlation technique, the scheduling of step pump station can not be according to the flow demand of reality rationally confirm unit operating condition, lead to the operating flow undersize or too big is solved. The following description and description will proceed with reference being made to various embodiments.
It should be noted that "a × b", "a · b", or "a × b" in the embodiment of the present invention may represent a times b, or may represent a matrix of a rows and b columns, and the specific representation may be combined with the description of the relevant context in the embodiment of the present application, and the embodiment of the present invention is not described one by one. It should be noted that, unless otherwise specified, the electronic device may execute any of the following steps, and the processor of the electronic device may execute any of the following steps. In the embodiment of the present application, the term "obtaining" means that the electronic device may be obtained through calculation, obtained through electronic device generation, or obtained from other electronic devices, and is not limited herein.
Fig. 1 is a schematic flow chart of a cascade pump station scheduling method according to an embodiment of the present invention, where the method is applied to an electronic device, and as shown in fig. 1, the method includes:
s1, obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump station of the cascade pump stationsα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow rate of the water pump and alpha are the angle of the blades of the water pump.
Alternatively, the electronic device in the embodiment of the present invention may be any device with data processing capability, such as a visitor machine, a server, a mobile phone, a tablet computer, a notebook computer, a palm computer, a personal digital assistant, a portable media player, a smart speaker, a navigation device, a wearable device, a smart band, a pedometer, a digital TV, or a desktop computer.
Before introducing the method for scheduling the cascade pump station according to the embodiment of the present invention, the following description is first made on the relevant contents of the cascade pump station:
fig. 2 is a schematic diagram of a system structure of a step pump station according to an embodiment of the present invention, and referring to fig. 2, in the step pump station, each stage of the pump station is a control unit of a water delivery system of the step pump station, the pump stations are connected with each other through channels or pipelines, and water levels and flows of channels of the step pump station are mutually linked with a startup situation of a water pump unit in the pump station to jointly form a dynamically balanced step pump station water delivery system, wherein an installed capacity and a channel water storage capacity in each pump station also restrict the operation of the water delivery system of the step pump station.
In this embodiment, a nine-stage pump station shown in fig. 2 is taken as an example, and any one stage pump station of the cascade pump station is selected to describe a scheduling scheme of a full angle modulation water pump in the pump station. For the sake of simplicity, in the embodiment of the present invention, the "fully adjustable angle water pump" is also referred to as "water pump" for short.
In step S1 of this embodiment, each stage of the cascade pump station includes a plurality of fully-regulated water pumps. The fully-adjustable water pump means that the angle of the blades of the water pump can be adjusted, and the adjustment range of the angle is any value between the maximum angle and the minimum angle, such as values of-5.231 degrees, 0.004 degrees or 2.123 degrees.
In this embodiment, the pump station lift HαFlow Q of water pumpαAnd water pump power NαCan be acquired by a water delivery system device of the step pump station.
In one embodiment, the first relationship and the second relationship may both be cubic functions. In another embodiment, the first and second relationships may be quadratic, quartic, quintic, or the like. It will be appreciated that the higher the number of functions, the more the first and second relationships are obtained to suit the performance of the water pump.
The first relationship may be obtained by: obtaining the working performance curve of the full-angle-modulation water pump, and obtaining the working performance curve of the full-angle-modulation water pump at H when the blade angle is alpha under the condition of different blade angles from the performance curveα＝f(Qα) A plurality of first key points on the curve, which should include all or part of the values of the flow and the head obtained from the operating performance table of the water pump. It can be understood that the method for obtaining the first relationship and the second relationship can be obtained by an interpolation method, a polishing method or a least square method, and please refer to the related art for how to perform the fitting method, which is not described herein.
And S2, obtaining the corresponding relation between the power and the flow of the water pump based on the first relation and the second relation.
In an alternative embodiment, S2 may be implemented by: obtaining the flow and the power of the water pump at a given angle and the current head based on the first relation and the second relation; the number of the given angles is multiple, and the multiple given angles are obtained based on an operating performance table of the full-angle-adjusting water pump. Here, the given angle includes a plurality of set water pump blade angles. The current lift may be obtained based on a front water level and a rear water level of the pump station. When the current lift is determined, different angles of the water pump correspond to different flow rates.
It will be appreciated that in the case where the given angle is different but the current head is the same, for example, at given angles of-6, -4, -2, -0, +2 or +4, the flow and power of the water pump at the same head are both different, and that with a fixed head the flow and power of the water pump may both increase with increasing given angle. In the case where the current head is different, but the given angle is the same, the flow rate and the power of the water pump may both increase as the current head increases.
Based on the flow and the power of the water pump corresponding to the given angle under the current head, a first change relation curve of the flow along with the given angle and a second change relation curve of the power along with the given angle under the current head can be obtained. In this embodiment, the relationship between the given angle and the flow rate may be obtained according to the first variation relationship curve; the relationship between the given angle and the power can be obtained from the second variation curve.
Based on the flow and power of the water pump at a given angle and current head, a correspondence between the power and flow of the water pump is enabled.
And S3, determining the maximum flow and the minimum flow of the water pump capable of running.
In an alternative embodiment of the invention, the maximum flow and minimum flow of the water pump may be determined based on a performance curve or performance worksheet for a fully-tuned water pump. In another embodiment, the maximum flow rate and the minimum flow rate of the water pump may be obtained based on the relationship between the given angle and the flow rate obtained in S2 described above.
And S4, calculating the number of starting machines of the pump station according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of running, and obtaining the starting flow corresponding to different starting machines.
Before executing step S4, the water demand of the pump station can be obtained by the following steps: obtaining the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price; on the premise of meeting the water flow requirement of each channel, the minimum running cost of the cascade pump station is taken as a target, and a linprog function is used for solving to obtain the target flow of each stage of pump station. The target flow of the pump station is the water demand of the pump station.
After the water demand of the pump station is obtained, step S4 is executed to calculate the number of startable pump stations, which requires determining the minimum startup number and the maximum startup number of the pump station. The minimum boot-up number may be obtained by dividing the water demand by the maximum flow rate to obtain a first result, and rounding up the first result. The maximum boot-up number may be obtained by dividing the water demand by the minimum flow to obtain a second result, and rounding up the second result. For example, the minimum boot number is finally calculated to be four, and the maximum boot number is eight, so the number of bootable machines may be any integer between four and eight.
Furthermore, the starting-up flow rates corresponding to different starting-up numbers can be obtained by dividing the water demand by the starting-up numbers. Here, the startup flow refers to the flow of the full-angle water pump running at different angles. According to the starting flow rate and the relationship between the given angle and the flow rate obtained in the step S2, the operation angle corresponding to the starting flow rate of the water pump can be obtained.
And S5, obtaining the power of the water pump corresponding to the different starting numbers according to the starting flows corresponding to the different starting numbers and the corresponding relation between the power and the flow of the water pump.
In this embodiment, the number of different startup units is different from the corresponding startup flow, for example, the number of startup units is 4, 5, 6, 7, or 8, and the corresponding startup flow is the water demand of the pump station divided by the number of startup units. In this embodiment, according to the startup flow and the corresponding relationship between the power and the flow obtained in S2, the power of the water pump corresponding to different startup flows of the water pump can be obtained. Furthermore, the power of the water pumps corresponding to different starting numbers is obtained by combining the starting numbers corresponding to the starting flows of the water pumps.
And S6, determining the target startup number corresponding to the minimum operating power of the water pumps according to the water pump powers corresponding to different startup numbers respectively.
According to the embodiment, the target starting number of the pump stations can be obtained when the water pump power is minimum according to the water pump power respectively corresponding to different starting numbers.
And S7, obtaining the target starting flow of each water pump according to the water demand of the pump station and the target starting number.
In this embodiment, the target startup flow rate of each water pump is obtained by dividing the water demand of the pump station by the target startup number.
According to the cascade pump station scheduling method provided by the embodiment of the invention, the number of the power-on pump stations is determined according to the water demand of the pump stations and the maximum flow and the minimum flow of each water pump capable of running. Then, obtaining the power of the water pumps corresponding to different starting numbers respectively; then, determining the target starting number corresponding to the minimum operating power of the water pump; and finally, obtaining the target starting flow of each water pump in the pump station according to the water demand of the pump station and the target starting number. By the method, the starting flow of each full-angle-modulation water pump in the pump station can be reasonably scheduled on the premise of meeting the water demand of the pump station, and each water pump can run at lower power, so that the power consumption of the system is reduced.
On the basis of the foregoing embodiment, after obtaining the target startup flow rate of each water pump at S7, the cascade pump station scheduling method further includes:
and S8, obtaining the operating cost of the pump station according to the minimum operating power of the water pump and the number of the corresponding starting machines.
Specifically, in S6, the target number of the power-on units corresponding to the minimum operating power of the water pump is obtained. Under the premise, the running cost of the pump station can be calculated.
On the basis of the above embodiment, before S4, the water demand of each stage of the cascade pump station can be obtained by the following method:
obtaining the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price;
according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price, on the premise of meeting the water flow required by each channel, the aim of minimizing the operating cost of the cascade pump station is fulfilled, and the target flow of each stage of pump station is obtained by solving by using a linprog function. In this embodiment, the target flow of the pump station is the water demand of the pump station.
On the basis of the above embodiments, as an optional implementation manner of the present invention, on the premise of meeting the water flow demand of each channel, according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel, and the local electricity price, and on the premise of meeting the water flow demand of each channel, the target flow of each stage of pump station is solved by using a linprog function, including:
s100, when electricity prices are the same at different time periods in a day, on the premise that the water flow required by each channel in the cascade pump station is met, the minimum running cost of the cascade pump station is taken as a target, and a linprog function is used for solving according to the flow required by each channel, the current water storage capacity of each channel and the local electricity prices, so that the target flow of each stage of pump station is obtained; or,
and S200, when the electricity prices are different at different time intervals in a day, on the premise of meeting the water flow requirement of each channel according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the electricity prices of local time intervals, solving by using a linprog function with the minimum running cost of the cascade pump station as a target to obtain the target flow of each stage of pump station.
On the basis of the foregoing embodiments, the foregoing S100 specifically includes:
s101, acquiring water demand flow of each channel in the cascade pump station;
fig. 2 is a schematic diagram of a system structure of a step pump station according to an embodiment of the present invention, and referring to fig. 2, in the step pump station, each stage of the pump station is a control unit of a water delivery system of the step pump station, the pump stations are connected with each other through channels or pipelines, and water levels and flows of channels of the step pump station are mutually linked with a startup situation of a water pump unit in the pump station to jointly form a dynamically balanced step pump station water delivery system, wherein an installed capacity and a channel water storage capacity in each pump station also restrict the operation of the water delivery system of the step pump station.
Referring to fig. 2, the cascade pumping station water delivery system in this embodiment takes nine stages of pumping stations as an example, and each two adjacent stages of pumping stations have a channel therebetween, that is, the channel between the first stage pumping station and the second stage pumping station is a first channel, the channel between the second stage pumping station and the third stage pumping station is a second channel, and … …, and the channel between the eight stage pumping station and the nine stage pumping station is an eighth channel. The flow rate required to obtain each channel may be the flow rate required to obtain each of the first to eighth channels. In this embodiment, the average flow rate required by each channel in a day, that is, the water demand flow rate of each channel, is obtained in advance.
In fig. 2, the pumping station subsystem includes nine stages of pumping stations, and the water delivery subsystem includes "one main channel" to "eight main channels", i.e., the first channel to the eighth channel. And a check gate and a shunt gate are respectively arranged between each stage of pump stations, and a user can control the shunt gate.
In one embodiment, the water demand flow of each channel may be reported by the management department of each channel, that is, the pump station management center only needs to distribute the water demand flow according to the needs. In another embodiment, the water flow demand of each channel can be decided by the pump station management center, and the water flow demand does not need to be reported by the management department of each channel.
And S102, obtaining the current water storage capacity of each channel in the cascade pump station.
For example, the current water storage capacity of the first channel can be obtained by the following formula:
(the water depth of the rear water pool of the primary pump station + the water depth of the front water pool of the secondary pump station) channel length 0.5 channel cross-sectional area and water depth. In the embodiments of the present invention, the symbol denotes a multiplier.
S103, obtaining a first parameter Am and a second parameter Bm of the mth channel according to the water demand flow and the current water storage capacity of each channel; wherein, the first parameter Am is (the current water storage amount of the mth channel from the lower limit of the water storage amount of the mth channel)/3600/24 + the water demand flow of the mth channel; and the second parameter Bm is (the upper limit of the water storage capacity of the mth channel-the current water storage capacity of the mth channel)/3600/24 + the water demand flow of the mth channel. The water outlet channel of each stage of pump station is a channel corresponding to the stage of pump station, for example, the channel between the first stage pump station and the second stage pump station is a first channel, and the channel between the second stage pump station and the third stage pump station is a second channel. If the total number of the pumping stations is M, the mth channel is a channel between the mth pumping station and the (M + 1) th pumping station. The total number of channels may be M-1.
Then, based on the flow rate required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price, the following matrixes f, A and b are respectively obtained by taking the minimum running cost of the cascade pump station as a target.
S104, obtaining a matrix f of each stage of pump station; wherein:
P1 is provided with～PM is provided withRespectively representing the design power of each stage of pump station; q1 is provided with～QM is provided withRespectively representing the design flow of each stage of pump station; m is the total stage number of the pump station; the first electricity price represents a local electricity price; here "·" and "·" both represent multiplication signs.
S105, obtaining a matrix A;
wherein a1 ═ (0.. 0-1), and "0.. 0" in a1 includes M-1 0 s; a2 ═ e (M), when M ═ 9, a2 is a ninth order identity matrix; a3 and a4 are the same and are a matrix of (M-1) xM;
it can be understood that a1 is a 1-row M-column vector with the first M-1 values all being 0 and the Mth value being-1.
S106, obtaining a matrix b based on the first parameter Am and the second parameter Bm; wherein:
a5 represents the design flow (-1) of the Mth stage pump station; a6 is a matrix of M × 1, and each row in a6 is the maximum flow of each stage of pumping station; a7 is a matrix of (M-1) × 1, each row in a7 is-Am; a8 is a matrix of (M-1) × 1, per row Bm.
Here, a7 is a matrix of (M-1) × 1, which can be understood as a matrix of (M-1) rows and 1 columns.
S107, based on the matrixes f, A and b, solving by using a linprog function with the aim of minimizing the operating cost of the cascade pump station to obtain a matrix X; wherein, X is an MX 1 matrix, and each number in X corresponds to the target flow of each stage of pump station; wherein, the target flow of the pump station is the water demand of the pump station in S4.
On the basis of the above embodiments, the method further includes:
and S108, calculating the total operation cost of the cascade pump station in one day based on the matrix X.
The total running cost is as follows:
in the formula, i is any integer between 1 and M; xiThe target flow of the i-th stage pumping station.
In this embodiment, through the steps S101 to S108, the target flow of each stage of pump station obtained by solving the target when the operation cost of the cascade pump station is the lowest at the same electricity price in different time periods within a day can be obtained, and the each stage of pump station is scheduled, so that the operation cost of the cascade pump station is reduced.
On the basis of the foregoing embodiments, as an optional implementation manner of the present invention, in order to obtain optimal startup flow rates of each stage of pump station when electricity prices are different at different time intervals within a day and water demand of each pump station meets requirements, the present embodiment provides S200, where when electricity prices are different at different time intervals within a day, according to a flow rate required by each channel in a stepped pump station, a current water storage amount of each channel, and an electricity price at each local time interval, on the premise that water demand of each channel is met, a link function is used to perform solution to obtain a target flow rate of each stage of pump station with a minimum operation cost of the stepped pump station as a target. S200 specifically comprises the following steps:
s201, acquiring water demand flow of each channel in the cascade pump station;
s202, obtaining the current water storage capacity of each channel in the cascade pump station.
For example, the current water storage capacity of the first channel can be obtained by the following formula:
(the water depth of the rear water pool of the primary pump station + the water depth of the front water pool of the secondary pump station) channel length 0.5 channel cross-sectional area and water depth. In the embodiments of the present invention, the symbol denotes a multiplier.
S203, obtaining a first parameter Am and a second parameter Bm of the mth channel according to the water demand flow and the current water storage capacity of each channel; wherein, the first parameter Am is (the current water storage amount of the mth channel from the lower limit of the water storage amount of the mth channel)/3600/24 + the water demand flow of the mth channel; and the second parameter Bm is (the upper limit of the water storage capacity of the mth channel-the current water storage capacity of the mth channel)/3600/24 + the water demand flow of the mth channel.
The steps of S201 to S203 are the same as S101 to S103 in the above embodiment, and are not described again here.
Then, based on the flow rate required by each channel in the cascade pump station, the current water storage capacity of each channel and the electricity price of each local time interval, the following matrixes f ', A ' and b ' are respectively obtained by taking the minimum running cost of the cascade pump station as a target.
S204, obtaining a matrix f' of each stage of pump station; wherein:
the matrix f' is a 2M x 1 matrix P1 is provided with～PM is provided withRespectively representing the design power of each stage of pump station; q1 is provided with～QM is provided withRespectively representing the design flow of each stage of pump station; m is the total stage number of the pump station; the second electricity rate is the electricity rate of the first time period in the day at the local place. The third electricity rate is the electricity rate of the local day for a second period of time. The first period and the second period constitute one day.
S205, obtaining a matrix A';
where a9 is a matrix of 1 × 2M, a9 ═ 0(M-1), -1, 0(M) ]. a10 is a matrix of 1 × 2M, a10 ═ 0(2M-1), -1. a11 is a unit matrix, a11 is E (2M). a12 is the same as a13 and is a matrix of (M-1). times.2M.
Here, a matrix of 1 × 2M may be understood as a matrix of 1 row and 2M columns, where M is the total number of pumping stations of the cascade pumping station.
S206, obtaining a matrix b' based on the first parameter Am and the second parameter Bm; wherein:
wherein a14 is a matrix of 2 × 1(2 rows and 1 columns), and each row of a14 is the water demand (-1) of the mth stage pump station.
a15 is a matrix of 2M × 1, the first M rows are equal to the last M rows, and are all the same as a 6.
a16 is a matrix of (M-1) × 1, each row-2 × Am (-2 times Am).
a17 is a matrix of (M-1) × 1, 2 × Bm per row.
S207, based on the matrix f ', A' and b ', the minimum running cost of the cascade pump station is taken as a target, a linprog function is used for solving, and a matrix X' is obtained; x' is a 2M 1 matrix. The front M rows of X 'are the target flow of each stage of pump station in the first period, and the rear M rows of X' are the target flow of each stage of pump station in the second period. Wherein, the target flow of the pump station is the water demand of the pump station in S4.
On the basis of the above embodiments, the method further includes:
and S208, calculating the total running cost of the cascade pump station when the electricity prices are different at different time intervals in one day based on the matrix X. The total running cost' of the step pump station is as follows:
in the formula, q is any integer between 1 and M; pq sets the design power of a q-th pump station; and Xq is the target flow of the q-th stage pump station.
In this embodiment, through the above S201 to S208, the optimal startup flow (i.e., target flow) of each stage of pump station can be obtained when the electricity prices are different at different time intervals in one day and the water demand of each stage of pump station meets the requirement, and each stage of pump station is scheduled, so that the operation cost of the cascade pump station is reduced.
Fig. 3 is a block diagram of a cascade pump station scheduling device according to an embodiment of the present invention, and referring to fig. 1 to 3, an embodiment of the present invention provides a cascade pump station scheduling device, including:
a water pump parameter relation obtaining module 301, configured to obtain a first relation H between a lift of each water pump and a flow of the water pump in any stage of the cascade pump station under the condition that each water pump has different blade anglesα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow of the water pump is adopted, and alpha is the angle of a blade of the water pump;
a power flow relation obtaining module 302, configured to obtain a corresponding relation between power and flow of the water pump based on the first relation and the second relation;
a flow threshold determination module 303, configured to determine a maximum flow and a minimum flow at which the water pump can operate;
the openable platform number calculating module 304 is configured to calculate the openable platform number of the pump station according to the water demand of the pump station and the maximum flow rate and the minimum flow rate at which each water pump can operate, and obtain startup flow rates corresponding to different startup platform numbers;
a water pump power obtaining module 305, configured to obtain water pump powers corresponding to different numbers of started water pumps according to the starting flows corresponding to the different numbers of started water pumps and the corresponding relationship between the water pump powers and the flows;
a target starting-up number determining module 306, configured to determine a target starting-up number corresponding to the minimum operating power of the water pumps according to the water pump powers corresponding to different starting-up numbers respectively;
and a target startup flow obtaining module 307, configured to obtain a target startup flow of each water pump according to the water demand of the pump station and the target startup number.
Specifically, the cascade pump station scheduling device provided in the embodiment of the present invention is specifically configured to execute the steps of the cascade pump station scheduling method in the foregoing method embodiment, and since the cascade pump station scheduling method has been described in detail in the foregoing embodiment, no detailed description is given to functional modules of the cascade pump station scheduling device here.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 4, the electronic device may include: a processor (processor)401, a communication Interface (communication Interface)402, a memory (memory)403 and a communication bus 404, wherein the processor 401, the communication Interface 402 and the memory 403 complete communication with each other through the communication bus 404. Processor 401 may call logic instructions in memory 403 to perform the following method: obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump stationα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein, the water pump is a full angle-adjusting water pump. Obtaining a corresponding relation between the power and the flow of the water pump based on the first relation and the second relation; determining the maximum flow and the minimum flow of the water pump capable of running; calculating the number of openable machines of the pump station according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of running, and obtaining the starting flow corresponding to different starting machines; obtaining the power of the water pump corresponding to different starting numbers according to the starting flows corresponding to the different starting numbers and the corresponding relation between the power and the flow of the water pump; determining the target starting-up number corresponding to the minimum operating power of the water pumps according to the water pump powers respectively corresponding to different starting-up numbers; and obtaining the target starting flow of each water pump according to the water demand of the pump station and the target starting number. It is understood that the processor 401 of the electronic device may also perform the other steps mentioned above in the embodiments of the present invention, and therefore, the detailed description is omitted here.
The present embodiment also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method as described in the embodiments above. Examples include: obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump stationα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein, the water pump is a full angle-adjusting water pump. Obtaining a corresponding relation between the power and the flow of the water pump based on the first relation and the second relation; determining the maximum flow and the minimum flow of the water pump capable of running; calculating the number of the started pump stations according to the water demand of the pump stations and the maximum flow and the minimum flow of each water pump capable of running; and obtaining the starting-up flow rates respectively corresponding to different starting-up numbers; obtaining the power of the water pump corresponding to different starting numbers according to the starting flows corresponding to the different starting numbers and the corresponding relation between the power and the flow of the water pump; determining the most corresponding water pump power according to different starting numbersThe number of target startup units corresponding to the small running power; and obtaining the target starting flow of each water pump according to the water demand of the pump station and the target starting number.
In summary, according to the method, the device and the electronic device for scheduling the cascade pump stations provided by the embodiments of the present invention, the number of the startable pump stations is determined according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of operating. Then, obtaining the power of the water pumps corresponding to different starting numbers respectively; then, determining the target starting number corresponding to the minimum operating power of the water pump; and finally, obtaining the target starting flow of each water pump in the pump station according to the water demand of the pump station and the target starting number. By the method, the starting flow of each full-angle-modulation water pump in the pump station can be reasonably scheduled on the premise of meeting the water demand of the pump station, and each water pump can run at lower power, so that the power consumption of the system is reduced.
In all the above embodiments provided by the present invention, non-conflicting ones may be combined with each other.
The above-described method embodiments are merely illustrative, wherein the units described as separate parts may or may not be physically separate, and the 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 modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on such understanding, the above technical solutions substantially or contributing to the related art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for scheduling a cascade pump station is characterized by comprising the following steps:
s1, obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump station of the cascade pump stationsα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow of the water pump is adopted, and alpha is the angle of a blade of the water pump;
s2, obtaining the corresponding relation between the power and the flow of the water pump based on the first relation and the second relation;
s3, determining the maximum flow and the minimum flow of the water pump capable of running;
s4, calculating the number of openable machines of the pump station according to the water demand of the pump station and the maximum flow and the minimum flow of each water pump capable of running, and obtaining the starting flow corresponding to different starting machines;
s5, obtaining water pump powers corresponding to different starting numbers according to the starting flows corresponding to the different starting numbers and the corresponding relation between the water pump powers and the flows;
s6, determining the target startup number corresponding to the minimum operating power of the water pump according to the water pump power corresponding to different startup numbers;
and S7, obtaining the target starting flow of each water pump according to the water demand of the pump station and the target starting number.
2. The method according to claim 1, wherein in S2, the obtaining a corresponding relationship between power and flow rate of the water pump based on the first relationship and the second relationship specifically includes:
obtaining the flow and the power of the water pump at a given angle and the current head based on the first relation and the second relation;
and obtaining the corresponding relation between the power and the flow of the water pump based on the flow and the power of the water pump at the given angle and the current lift.
3. The method according to claim 1, wherein in the step S4, calculating the number of openable stations of a pump station according to the water demand of the pump station and the maximum flow rate and the minimum flow rate of each water pump, comprises:
dividing the water demand of a pump station by the maximum flow of the water pump capable of running to obtain a first result, and rounding the first result upwards to obtain the minimum starting number; dividing the water demand of the pump station by the minimum flow rate at which the water pump can operate to obtain a second result, and rounding the second result upwards to obtain the maximum starting number;
and obtaining the number of the starting-up units of the pump stations according to the minimum starting-up number and the maximum starting-up number of the pump stations.
4. The method of claim 1, wherein prior to S4, the method further comprises:
obtaining the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price;
and solving by using a linprog function to obtain the target flow of each stage of pump station on the premise of meeting the water flow requirement of each channel by taking the minimum running cost of the cascade pump station as a target according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the local electricity price.
5. The method according to claim 4, wherein according to the flow rate required by each channel in the cascade pumping station, the current water storage capacity of each channel and the local electricity price, on the premise of meeting the water flow rate required by each channel, the target flow rate of each stage of pumping station is obtained by solving with a linprog function with the aim of minimizing the operating cost of the cascade pumping station, comprising the following steps:
s100, when electricity prices are the same at different time periods in a day, on the premise that the water flow required by each channel in the cascade pump station is met, the minimum running cost of the cascade pump station is taken as a target, and a linprog function is used for solving according to the flow required by each channel, the current water storage capacity of each channel and the local electricity prices, so that the target flow of each stage of pump station is obtained; or,
and S200, when the electricity prices are different at different time intervals in a day, on the premise of meeting the water flow requirement of each channel according to the flow required by each channel in the cascade pump station, the current water storage capacity of each channel and the electricity prices of local time intervals, solving by using a linprog function with the minimum running cost of the cascade pump station as a target to obtain the target flow of each stage of pump station.
6. The method according to claim 5, wherein the S100 specifically comprises:
s101, acquiring water demand flow of each channel in the cascade pump station;
s102, obtaining the current water storage capacity of each channel in the cascade pump station;
s103, obtaining a first parameter Am and a second parameter Bm of the mth channel according to the water demand flow and the current water storage capacity of each channel; wherein, the first parameter Am is (the current water storage amount of the mth channel from the lower limit of the water storage amount of the mth channel)/3600/24 + the water demand flow of the mth channel; the second parameter Bm is (the upper limit of the water storage capacity of the mth channel-the current water storage capacity of the mth channel)/3600/24 + the water demand flow of the mth channel;
s104, obtaining a matrix f of each stage of pump station; wherein:
P1 is provided with～PM is provided withRespectively representing the design power of each stage of pump station in the M stages of pump stations; q1 is provided with～QM is provided withRespectively representing the design flow of each stage of pump station in the M stages of pump stations; m is the total stage number of the pump station; the first electricity price represents a local electricity price;
s105, obtaining a matrix A;
wherein a1 ═ (0.. 0-1), and "0.. 0" in a1 includes M-1 0 s, and a1 is a matrix of 1 row and M-column; a2 ═ e (M), when M ═ 9, a2 is a ninth order identity matrix; a3 and a4 are the same and are both (M-1) xM matrices;
s106, obtaining a matrix b based on the first parameter Am and the second parameter Bm; wherein:
a5 represents the design flow (-1) of the Mth stage pump station; a6 is a matrix of M × 1, and each row in a6 is the maximum flow of each stage of pumping station; a7 is a matrix of (M-1) × 1, each row in a7 is-Am; a8 is a matrix of (M-1) × 1, each row Bm;
s107, based on the matrixes f, A and b, solving by using a linprog function with the aim of minimizing the operating cost of the cascade pump station to obtain a matrix X; wherein, X is an MX 1 matrix, and each number in X corresponds to the target flow of each stage of pump station; wherein, the target flow of the pump station is the water demand of the pump station in S4.
7. The method of claim 6, further comprising:
calculating the total operation cost of the cascade pump station in one day based on the matrix X;
the total running cost is as follows:
in the formula, i is any integer between 1 and M; xiThe target flow of the i-th stage pumping station.
8. A cascade pump station dispatching device, comprising:
the water pump parameter relation obtaining module is used for obtaining a first relation H between the lift of each water pump and the flow of the water pump under the condition that each water pump is at different blade angles in any stage of pump station of the cascade pump stationsα＝f(Qα) And a second relation N between blade angle, power and flow of the water pumpα＝g(Qα) (ii) a Wherein the water pump is a fully angle-adjustable water pump; qαThe flow of the water pump is adopted, and alpha is the angle of a blade of the water pump;
the power flow relation obtaining module is used for obtaining the corresponding relation between the power and the flow of the water pump based on the first relation and the second relation;
the flow threshold value determining module is used for determining the maximum flow and the minimum flow of the water pump which can run;
the starting-up machine number calculating module is used for calculating the starting-up machine number of the pump station according to the water requirement of the pump station and the maximum flow and the minimum flow of each water pump capable of running and obtaining the starting-up flow corresponding to different starting-up machine numbers;
the water pump power obtaining module is used for obtaining water pump powers respectively corresponding to different starting numbers according to the starting flows respectively corresponding to the different starting numbers and the corresponding relation between the water pump powers and the flows;
the target starting-up number determining module is used for determining the target starting-up number corresponding to the minimum operating power of the water pumps according to the water pump powers respectively corresponding to different starting-up numbers;
and the target starting-up flow obtaining module is used for obtaining the target starting-up flow of each water pump according to the water demand of the pump station and the target starting-up number.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program performs the steps of the cascade pump station scheduling method according to any of claims 1 to 7.
10. A non-transitory computer readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the cascade pump station scheduling method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911424009.4A CN111102212B (en) | 2019-12-31 | 2019-12-31 | Method and device for scheduling cascade pump station and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911424009.4A CN111102212B (en) | 2019-12-31 | 2019-12-31 | Method and device for scheduling cascade pump station and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111102212A CN111102212A (en) | 2020-05-05 |
| CN111102212B true CN111102212B (en) | 2021-09-24 |
Family
ID=70426588
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911424009.4A Active CN111102212B (en) | 2019-12-31 | 2019-12-31 | Method and device for scheduling cascade pump station and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111102212B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111738626B (en) * | 2020-07-22 | 2023-07-14 | 云南大唐国际李仙江流域水电开发有限公司 | Starting method and system for radial hydropower station |
| CN113586422A (en) * | 2021-08-25 | 2021-11-02 | 安徽智引力智慧水务有限公司 | Energy-saving method for power of step flow regulating pump |
| CN114320866B (en) * | 2022-03-08 | 2022-06-24 | 湖南易净环保科技有限公司 | Centralized management control system for distributed integrated pump station |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102852782A (en) * | 2012-09-25 | 2013-01-02 | 扬州大学 | Large-scale water pump unit and working condition adjusting mode accurate quantitative model-selection method |
| CN102902202A (en) * | 2012-09-25 | 2013-01-30 | 扬州大学 | Operation optimization method of complex parallel cascaded pump station system |
| CN103807184A (en) * | 2014-02-17 | 2014-05-21 | 扬州大学 | Method for determining blade adjustment frequency of variable-angle optimized operation of large fully-adjustable water pump station |
| CN104154005A (en) * | 2014-07-08 | 2014-11-19 | 扬州大学 | Diesel engine pump station speed governing optimizing operation method based on lowest unit flow fuel consumption |
| CN106368959A (en) * | 2015-07-24 | 2017-02-01 | 天津农学院 | Computer control technology based energy-saving method for water transfer pumping station with full-modulation axial-flow pump |
| CN106502220A (en) * | 2016-09-21 | 2017-03-15 | 济南大学 | Cascade pumping station water-carriage system optimization operation control coupling coordination approach and system |
-
2019
- 2019-12-31 CN CN201911424009.4A patent/CN111102212B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102852782A (en) * | 2012-09-25 | 2013-01-02 | 扬州大学 | Large-scale water pump unit and working condition adjusting mode accurate quantitative model-selection method |
| CN102902202A (en) * | 2012-09-25 | 2013-01-30 | 扬州大学 | Operation optimization method of complex parallel cascaded pump station system |
| CN103807184A (en) * | 2014-02-17 | 2014-05-21 | 扬州大学 | Method for determining blade adjustment frequency of variable-angle optimized operation of large fully-adjustable water pump station |
| CN104154005A (en) * | 2014-07-08 | 2014-11-19 | 扬州大学 | Diesel engine pump station speed governing optimizing operation method based on lowest unit flow fuel consumption |
| CN106368959A (en) * | 2015-07-24 | 2017-02-01 | 天津农学院 | Computer control technology based energy-saving method for water transfer pumping station with full-modulation axial-flow pump |
| CN106502220A (en) * | 2016-09-21 | 2017-03-15 | 济南大学 | Cascade pumping station water-carriage system optimization operation control coupling coordination approach and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111102212A (en) | 2020-05-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111102212B (en) | Method and device for scheduling cascade pump station and electronic equipment | |
| Zhang et al. | Efficient computing resource sharing for mobile edge-cloud computing networks | |
| Fang et al. | A stochastic control approach to maximize profit on service provisioning for mobile cloudlet platforms | |
| Tseng et al. | Dynamic resource prediction and allocation for cloud data center using the multiobjective genetic algorithm | |
| CN110557769A (en) | C-RAN calculation unloading and resource allocation method based on deep reinforcement learning | |
| CN110968366B (en) | Task unloading method, device and equipment based on limited MEC resources | |
| CN106598727B (en) | A kind of computational resource allocation method and system of communication system | |
| Zhang et al. | Service pricing and selection for IoT applications offloading in the multi-mobile edge computing systems | |
| CN111043052B (en) | Semi-angle-modulation water pump scheduling method and device for step pump station | |
| Dou et al. | Mobile edge computing based task offloading and resource allocation in smart grid | |
| CN111140486B (en) | Speed-regulating water pump scheduling method of step pump station and electronic equipment | |
| CN114817985A (en) | Privacy protection method, device, equipment and storage medium for electricity consumption data | |
| CN112727743A (en) | Control method and device of multi-water pump system, control terminal and storage medium | |
| CN110570136B (en) | Distribution range determining method, distribution range determining device, electronic equipment and storage medium | |
| CN110968947A (en) | Virtual power plant scheduling method, device and system | |
| Du et al. | Distributionally robust optimization based chance-constrained energy management for hybrid energy powered cellular networks | |
| CN117057538A (en) | Store maintenance personnel scheduling method and system based on model | |
| CN114936793A (en) | Optimal scheduling method, device, equipment and storage medium for power system | |
| CN115269176A (en) | Task allocation method, device, computer equipment, storage medium and product | |
| CN109377380A (en) | A kind of method, apparatus and communication equipment of the continuation of insurance prompting based on big data processing | |
| CN111490889B (en) | Method and device for estimating wireless service growth | |
| CN112929837B (en) | Dynamic control method and device for radio remote unit | |
| CN116207772A (en) | Energy scheduling method and device, electronic equipment and storage medium | |
| CN114547981A (en) | Method and system for realizing mobile edge computing task unloading | |
| CN106786523A (en) | Consider that new electricity changes distributed power source and micro-capacitance sensor the operation interactive approach of policy implication |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 430070 Room 03, Floor 6A, Gate 1, Zhongshi Building A, No. 10, Wenxiu Street, Hongshan Street, Hongshan District, Wuhan City, Hubei Province Patentee after: Wuhan Ruishan Zhishui Science and Technology Research Co.,Ltd. Address before: 430000 room 1501, block a, Yinghua building, No. 2, Luoshi North Road, Hongshan District, Wuhan City, Hubei Province Patentee before: Wuhan Ruishan Intelligent Water Technology Development Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230109 Address after: 430070 Room 03, Floor 6A, Gate 1, Zhongshi Building A, No. 10, Wenxiu Street, Hongshan Street, Hongshan District, Wuhan City, Hubei Province Patentee after: Wuhan Ruishan Zhishui Science and Technology Research Co.,Ltd. Patentee after: WUHAN University Address before: 430070 Room 03, Floor 6A, Gate 1, Zhongshi Building A, No. 10, Wenxiu Street, Hongshan Street, Hongshan District, Wuhan City, Hubei Province Patentee before: Wuhan Ruishan Zhishui Science and Technology Research Co.,Ltd. |
|
| TR01 | Transfer of patent right |