RU2667745C1 - Method of optimization of the wastewater streams - Google Patents

Abstract

FIELD: water supply systems.SUBSTANCE: invention relates to the field of water supply and wastewater systems and can be used to optimize their operation in dry weather and rainy periods. Method comprises the following stages: a) receive data parameters values of the system streams, transmit them to the control block and write it into the computer's main memory; b) solve on a computer the problem of mathematical programming, using as initial data of the parameters values of the system streams, and obtain as a solution the values of the optimal parameters of the streams; c) transmit to the automated control blocks the values of their position settings ensuring the redistribution of the optimum parameters of the sewage streams in accordance with the solution of the mathematical programming problem. Prior to step a), the entire sewage disposal system is divided into a finite number of n independent drainage basins, each contains at least the surface runoff networks connected to the transport main, which, with the help of the main pumping station, is connected to the treatment facilities with the release of treated sewage into the environment, at least one discharge of wastewater into the environment connected with the main transport route and configured to discharge untreated sewage into the environment when the main transport route is full. As the parameters of the flows of the surface runoff system, the surface runoff volumes are accepted ν, i = 1, 2, ..., n, for each i-th independent surface runoff basin for a period of time Δt. As automated control bodies, inter-basin pumping stations and / or inter-basin transport routes with shut-off and regulating bodies connecting the transport routes of independent basins are adopted. Determine the maximum system flow parameters ν=ν(t)+ν(t)+ν(t)+q*Δt for each i-th independent surface runoff basin for a period of time Δt without emissions of untreated sewage into the environment, where ν(t), ν(t), ν(t) – free volumes of collectors and wells,main transport route and surface runoff networks at the moment of tsolving the problem of mathematical programming, q– the maximum supply of the MPS of the i-th independent surface runoff basin. Form the maximum productivity matrix ofautomated controls that characterizes the limits of possible surface runoff inflows from the i-th independent surface runoff basin into the j-th independent surface runoff basin, where the values for the principal diagonal and non-existent elements are zero. Experimentally determine for each i-th independent surface runoff basin for a period of time Δt the experimental dependence v=f(H) of the flow parameters of the system vat least from the predicted values of precipitation volumes H. Receive data on the forecast values of precipitation volumes H, i = 1, 2, ..., n, for each i-th independent surface runoff basin for a period of time Δt. Receive parameters values data of the system streams by calculating the value of the parameters of the streams of the system vfor each i-th independent surface runoff basin for the forecast period Δt from the experimental dependence v=f(H). In step b) the mathematical programming problem is solved by the criterion of minimum payments for pumping water, i.e. as a solution, they form a matrix of optimal productivity ofautomated management bodies, in the implementation of which the total payment for the power consumption of independent water drainage basins and inter-basin pumping stations will be minimal and ν–v+Σq–Σq≥0, i=1, 2, …, n, i≠k,. In the absence of such a result, a decision is taken to solve the problem of mathematical programming by the criterion of minimum discharges of sewage into the environment, i.e. as a solution, a matrix of optimal productivity ofautomated control bodies is formed, in the implementation of which the total discharge of sewage into the environment will be minimal, i.e. Σ(ν–ν+Σq–Σq)→min for i = 1, 2, …, n, i≠k,.EFFECT: provides a reduction in capital costs and expansion of functionality.1 cl, 3 dwg

Description

The invention relates to the field of alloy transport systems for water disposal and can be used to optimize their work in dry weather and rainy periods.

A known method of generating optimized flow plans for the region (patent RU No. 2314561 from 01/10/2008, G06F 17/00).

It allows you to optimize movement in a dynamically changing environment. In the method, the plan monitor generates a first planning boundary for the flow based on the flow conditions of the region. The plan generator uses the first planning boundary and repeatedly generates the first flow plans for the flow. The plan generator selects one of the first flow plans as the first optimized flow plan and issues it to control the flow.

This method is characterized by a narrow scope, since it is applicable only with one optimization criterion, for example, maximum economic efficiency. For this reason, it cannot be used to optimize general-purpose transport water disposal systems, since they need to be optimized for two criteria: minimum operating costs in dry weather and rated rain and a minimum of wastewater discharges into the environment during periods of over-calculated rain for which the drainage system does not calculated.

The closest analogue to the claimed method is the "Algorithm for optimal operational control of the wastewater transportation process", described in the work of MI Alekseev, Yu.A. Ermolin Optimization of the water disposal process in large cities: Monograph. M .: DIA Publishing House, 2013, p. 102-103. In accordance with the description in this monograph, the algorithm includes the following four stages:

a) receive data on the values of water flow at the inputs of the wastewater system, transmit them to the control point and write to the RAM of the computer;

b) solve the problem of mathematical programming on a computer, using the values of water flow rates at the system inputs as initial data, and obtain the cost values for each wastewater transportation route q _i as a solution;

c) determine the flow rate of water through each structure of the network, summing the values of q _i along all routes passing through this structure;

d) transmit to the automated governing bodies (gate valves, gates) located on the network at the branch points of the transport lines, the values of the settings of their position, ensuring the redistribution of wastewater flows in accordance with the solution of the mathematical programming problem.

The indicated method is characterized by:

1. High capital costs, because in order to be able to “receive data on the values of water flow rates at the entrances of the sewage system” in conditions of “large cities”, it is necessary to install several hundred or thousands of flow meters on pressureless networks.

2. Limited functionality, since the cost decision for each wastewater transportation route q _{i is} accepted as the optimal solution, which is possible only in pressure head drainage systems, for example, Moscow. In non-pressure systems, on each wastewater transportation route, the flow rate cannot be constant, because it:

- increases along the length of the route due to the connection of sections of the tree diagram of the drainage network;

- varies along the length of the route due to the arrangement of control tanks on them or the presence of conditional (virtual) control tanks on pressureless networks and collectors in the form of free volumes.

The objective of the present invention is to reduce capital costs and expand the functionality of the known method.

The problem is solved in that in the known method, comprising stages in which:

a) receive data on the values of the parameters of the system flows, transmit them to the control point and write to the RAM of the computer;

b) solve the problem of mathematical programming on a computer, using the values of the system flow parameters as initial data, and obtain the values of the optimal flow parameters as a solution;

b) transmit to the automated controls the values of the settings of their position, ensuring the redistribution of the optimal parameters of wastewater flows in accordance with the solution of the mathematical programming problem, in accordance with the present invention:

- before step a), the entire drainage system is divided into a finite number n of independent drainage basins, each of which contains at least drainage networks connected to a transport line, which is connected to the sewage treatment plant with the main pumping station and discharges treated wastewater into the surrounding medium, at least one discharge of wastewater into the environment, connected to a transport highway and configured to discharge untreated wastewater into the environment at repolnenii transport route,

- as the parameters of the flows of the wastewater system, take the wastewater volumes v _i , i = 1, 2, ..., n, for each i-th independent wastewater basin over a period of time Δt;

- as the automated governing bodies accept inter-basin pumping stations and / or inter-basin transport highways with shut-off and regulating bodies connecting the transport highways of independent pools;

для каждого i-го независимого бассейна водоотведения за период времени Δt без выбросов неочищенных сточных вод в окружающую среду, где

свободные объемы коллекторов и колодцев, транспортной магистрали и сетей водоотведения в момент t₀ решения задачи математического программирования,

максимальная подача ГНС i-го независимого бассейна водоотведения;- determine the maximum parameters of the system flows

for each i-th independent drainage basin for the time period Δt without emissions of untreated wastewater into the environment, where

free volumes of collectors and wells, a highway and drainage networks at the moment t _{0 of} solving a mathematical programming problem,

the maximum supply of GNS of the i-th independent drainage basin;

автоматизированных органов управления, характеризующую пределы возможных подач сточных вод из i-го независимого бассейна водоотведения в j-й независимый бассейн водоотведения, в которой значения для главных диагональных и несуществующих элементов равны нулю;- form a matrix of maximum productivity

automated governing bodies, characterizing the limits of possible wastewater supply from the i-th independent drainage basin to the jth independent drainage basin, in which the values for the main diagonal and nonexistent elements are zero;

- experimentally determine for each i-th independent drainage basin over a period of time Δt the experimental dependence v _i = f (H _i ) of the system flow parameters v _i at least from the predicted values of the precipitation volumes H _i ;

- receive data on the predicted values of precipitation volumes H _i , i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt;

- receive data on the values of the parameters of the system flows by calculating the values of the parameters of the system flows v _i for each i-th independent drainage basin for the forecast time period Δt from the experimental dependence v _i = f (H _i );

автоматизированных органов управления, при реализации которых суммарная оплата электропотребления независимых бассейнов водоотведения и межбассейновых насосных станций будет минимальной и

i = 1, 2, …, n, i≠k,

, а в случае отсутствия такого результата принимают решение задачу математического программирования решать по критерию минимальных сбросов сточных вод в окружающую среду, т.е. в качестве решения формируют матрицу оптимальных производительностей

автоматизированных органов управления, при реализации которых суммарный сброс сточных вод в окружающую среду будет минимальным, т.е.

при i = 1, 2, …, n, i≠k,

- at step b) the mathematical programming problem is solved by the criterion of minimum payments for pumping water, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total payment of electricity consumption of independent drainage basins and inter-basin pumping stations will be minimal and

i = 1, 2, ..., n, i ≠ k,

, and in the absence of such a result, they decide the mathematical programming problem to be solved by the criterion of minimum discharges of wastewater into the environment, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total discharge of wastewater into the environment will be minimal, i.e.

for i = 1, 2, ..., n, i ≠ k,

Distinctive features of the proposed method is:

1. Separation of the entire drainage system into a finite number n of independent drainage basins, each of which contains at least drainage networks connected to a transport line, which is connected to the sewage treatment plant with the help of the main pumping station and releases at least at least one discharge of wastewater into the environment.

2. Connection of the issue to the highway.

3. Implementation of the release with the possibility of discharge of untreated wastewater into the environment when the transport line is full.

4. The adoption as parameters of the flows of the wastewater system of the wastewater volumes v _i , i = 1, 2, ..., n, for each i-th independent wastewater basin over a period of time Δt.

5. Adoption of interbasin pumping stations and / or interbasin transport highways with shut-off and regulating bodies as automated governing bodies that connect the transport lines of independent pools;

для каждого i-го независимого бассейна водоотведения за период времени Δt без выбросов неочищенных сточных вод в окружающую среду по формуле

для каждого i-го независимого бассейна водоотведения за период времени Δt без выбросов неочищенных сточных вод в окружающую среду, где

свободные объемы коллекторов и колодцев, транспортной магистрали и сетей водоотведения в момент t₀ решения задачи математического программирования,

максимальная подача ГНС i-го независимого бассейна водоотведения.6. Additional determination of the maximum parameters of system flows

for each i-th independent drainage basin for a period of time Δt without emissions of untreated wastewater into the environment according to the formula

for each i-th independent drainage basin for the time period Δt without emissions of untreated wastewater into the environment, where

free volumes of collectors and wells, a highway and drainage networks at the moment t _{0 of} solving a mathematical programming problem,

maximum supply of gas pumping station of the i-th independent drainage basin.

автоматизированных органов управления, характеризующей пределы возможных подач сточных вод из i-го независимого бассейна водоотведения в j-й независимый бассейн водоотведения в которой значения для главных диагональных и несуществующих элементов равны нулю.7. The formation of the matrix of maximum performance

automated controls describing the limits of possible wastewater supplies from the i-th independent drainage basin to the jth independent drainage basin in which the values for the main diagonal and nonexistent elements are zero.

8. The experimental determination for each i-th independent drainage basin over a period of time Δt of the experimental dependence v _i = f (H _i ) of the system flow parameters v _i at least from the predicted values of precipitation volumes H _i.

9. Obtaining data on forecast values of precipitation volumes H _i , i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt.

10. Obtaining data on the values of the parameters of the system flows by calculating the values of the parameters of the system flows v _i for each i-th independent drainage basin for the forecast time period Δt from the experimental dependence v _i = f (H _i ).

автоматизированных органов управления, при реализации которых суммарная оплата электропотребления независимых бассейнах водоотведения и межбассейновых насосных станций будет минимальной и

-

i = 1, 2, …, n, i≠k

;11. The solution in stage b) of the mathematical programming problem by the criterion of minimum payments for pumping water, i.e. formation of a matrix of optimal performance as a solution

automated controls, the implementation of which the total payment of electricity consumption in independent drainage basins and inter-basin pumping stations will be minimal and

-

i = 1, 2, ..., n, i ≠ k

;

автоматизированных органов управления, при реализации которых суммарный сброс сточных вод в окружающую среду будет минимальным, т.е.

при i = 1, 2, …, n,

.12. Solving the problem of mathematical programming according to the criterion of minimum discharges of wastewater into the environment, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total discharge of wastewater into the environment will be minimal, i.e.

for i = 1, 2, ..., n,

.

According to the information available to the authors, all the distinguishing features are not known. Their combined use allows you to:

1. Reduce capital costs, because to implement the method does not require mass installation of flowmeters on pressureless networks. This is achieved due to the presence of distinctive features 4, 6, 8-10;

2. To expand the functional capabilities of the method, since its use in non-pressure drainage systems, in which the flow rate on the routes is not constant, but increases due to the connection of sections of the tree diagram of the drainage network and the installation of control tanks on them or the presence of conditional (virtual) networks regulating tanks in the form of free volumes in pressureless networks and collectors. This became possible due to the combined use of distinctive features No. 1-5, 7 12.

A brief description of the drawings.

In FIG. 1 is a plan view of a pumping station; FIG. 2, the results of an experimental assessment of the dependence v _i = f (H _i ) of the flow parameters of the system v _i on the forecast values of the precipitation volumes H _i for an independent drainage basin 1, in FIG. 3 the results of the assessment of similar dependencies for drainage basins 2 and 3.

The implementation of the invention.

To illustrate features of the embodiment of the invention in FIG. 1 is a diagram of a drainage system, including n = 3 independent drainage basins, designated 1, 2 and 3, respectively. Each of the independent drainage basins 1, 2 and 3 contains at least:

- transport line 4 in the independent drainage basin 1;

- transport highway 5 in the independent drainage basin 2;

- transport highway 6 in the independent drainage basin 3;

- treatment facilities 7 with the release of 8 treated wastewater into the environment (a reservoir, not shown in Fig. 1) in an independent basin 1;

- treatment facilities 9 with the release of 10 treated wastewater into the environment (a reservoir, not shown in Fig. 1) in an independent basin 2;

- treatment facilities 11 with the release of 12 treated wastewater into the environment (a reservoir, not shown in Fig. 1) in an independent basin 3;

- the main pumping station (HPS) 13 in an independent drainage basin 1. The invention does not exclude the presence of a shut-off and regulating device, for example, a gate 14 installed on the transport highway 4;

- the main pumping station (HPS) 15 in an independent drainage basin 2. The invention does not exclude the presence of a shut-off and control device, for example, a gate 16 installed on the transport highway 5;

- the main pumping station (HPS) 17 in an independent drainage basin 3. The invention does not exclude the presence of a shut-off and regulating device, for example, a gate 18 installed on the transport highway 6;

- Issue 19 (emergency release, rainfall, etc.), connected in an independent basin 1 with a transport highway 4 with the possibility of discharge of untreated sewage into the environment when the transport highway 4 is full;

- Issue 20 (emergency release, storm drain, etc.) connected in an independent basin 2 with a transport highway 5 with the possibility of discharge of untreated wastewater into the environment when the transport highway 5 is full;

- Issue 21 (emergency release, stormwater drainage, etc.) connected in an independent basin 3 with a transport highway 6 with the possibility of discharge of untreated wastewater into the environment when the transport highway 6 is full.

In addition, the additional presence of the following elements in the drainage system is not excluded:

- an inter-basin pumping station 22, connecting, for example, a transport line 4 in an independent drainage basin 1 with a transport highway 5 in an independent drainage basin 2;

- inter-basin collector 23 with a shut-off and regulating body 24, connecting, for example, the transport highway 5 in an independent basin 2 with the transport highway 6 in an independent drainage basin 3.

The drainage system also contains:

- drainage networks 25 connected in an independent drainage basin 1 with a highway 4;

- drainage networks 26 connected in an independent drainage basin 2 with a transport highway 5;

- drainage networks 27 connected in an independent drainage basin 3 with a highway 6.

During the operation of such a drainage system during periods of dry weather and calculated rains, wastewater (surface runoff and / or domestic wastewater) using a transport line 4 (usually gravity) in an independent drainage basin 1, a transport highway 5 in an independent drainage basin 2 and transport line 6 in an independent drainage basin 3 supply water to the STS 13, 15 and 17, respectively, independent drainage basins 1, 2 and 3. The main pumping stations 13, 15 and 17 supply water for treatment, respectively but to wastewater treatment plants 7, 9 and 11, followed by the discharge of treated wastewater into the environment at releases 8, 10 and 12.

At the same time, the difference in the cost of pumping a unit of wastewater volume (the product of specific electricity consumption by the tariff) between different STPs can be significant, since STPs 13, 15 and 17 can differ significantly:

- by specific energy consumption, depending on the depth of the location of the receiving tanks and the efficiency of the pumps;

- according to the electricity tariff.

In addition, in a megalopolis, the intensity of precipitation in independent drainage basins 1, 2, and 3 can vary significantly.

For these reasons, the operating mode of the wastewater system during periods of dry weather and calculated rains, when wastewater flows are discharged into the environment only through releases of treated wastewater from the independent wastewater pools in which they were formed, can be significantly different from the optimal cost for paying for electricity providing for the redistribution of wastewater between independent drainage basins.

During operation of the drainage system during periods of intense or over-calculated rains, when the influx of wastewater to one or more main pumping stations 13, 15 or 17 exceeds their capacity (supply), water begins to accumulate (accumulate) in the free capacities of the gravity parts of the transport lines 4, 5 or 6, as well as in drainage networks 25, 25 and 27. As a result, the water level in them rises to the level of outlets 19, 20 or 21 and the wastewater is discharged into the environment without treatment (usually in water bodies). If GNSs 13, 15 or 17 are made with submersible pumps, then in order to prevent the engine rooms of these pumping stations from being heated up and the water level in the transport lines 4, 5 or 6 to be increased, partial closure of shut-off and control devices, for example, gate valves 14, 16 or 18, is preceded.

Moreover, the difference in volumes discharged without wastewater treatment into the environment between different outlets can be significant, since in independent drainage basins 1, 2 and 3 can differ significantly:

- volumes of storage capacities in transport highways 4, 5 and 6 and drainage networks 25, 25 and 27;

- the difference between wastewater inflows to the STS and their productivity (supply).

For these reasons, the mode of operation of the sewage system in periods of intense or over-calculated rains, when the total volume discharged without wastewater treatment into the environment only through the releases of those independent drainage basins in which they were formed, can significantly differ from the optimal one, providing for the redistribution of wastewater between independent drainage basins.

To eliminate or minimize the likelihood of such situations when during periods of dry weather and estimated rains, the cost of electricity is significantly different from optimal, and during periods of intense or over-calculated rains, the total volumes of untreated wastewater are discharged into the environment more than the minimum possible, this method is used sewage system management.

For this:

1. Carry out the separation of the entire drainage system into a finite number n of independent drainage basins, each of which contains at least drainage networks connected to a transport line, which is connected to the sewage treatment plant with the main pump station to release the treated wastewater into the environment, according to at least one discharge of wastewater into the environment, connected to the transport line and configured to discharge untreated wastewater into the environment during overflow and the highway. As an example in FIG. 1 shows an example of the implementation of this stage, where the wastewater system is divided into n = 3 independent wastewater basins, respectively designated 1, 2 and 3. Each of them contains at least the following, respectively:

- drainage networks 25, 25 and 27;

- transport routes 4, 5 or 6;

- main pumping stations 13, 15 or 17;

- treatment facilities 7, 9 or 11 with discharges 8, 10 or 12 of treated wastewater into the environment (a reservoir, not shown in Fig. 1).

2. As the parameters of the flows of the sewage system, take the volumes of sewage v _i , i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt.

3. As the automated controls (in the example shown in Fig. 1), an inter-basin pump station 22 is taken that connects the transport line 4 in the independent drainage basin 1 to the transport line 5 in the independent basin 2, and the inter-basin collector 23 with a shut-off and regulating body 24, connecting the transport highway 5 in the independent basin with the transport highway 2 with the transport highway 6 in the independent basin 3.

для каждого i-го независимого бассейна водоотведения за период времени Δt без выбросов неочищенных сточных вод в окружающую среду. В качестве примера реализации этого этапа предположим, что:4. Determine the maximum system flow parameters

for each i-th independent drainage basin for a period of time Δt without emissions of untreated wastewater into the environment. As an example of the implementation of this step, suppose that:

- maximum feed GNS 13

- maximum feed GNS 15

- maximum feed GNS 17

В соответствии с настоящим изобретением свободные объемы в момент t₀ могут определяться различными способами. Например, по уровню воды в транспортной магистрали;- free volumes of collectors and wells, transport line 4 at time t ₀ solving mathematical programming problems

In accordance with the present invention, the free volumes at time t ₀ can be determined in various ways. For example, according to the water level in the transport line;

- free volumes of collectors and wells, transport line 5 at the time t _{0 of} solving the mathematical programming problem

- free volumes of collectors and wells, highway 6 at the time t _{0 of} solving the mathematical programming problem

В соответствии с настоящим изобретением свободные объемы могут определяться различными способами. Например, по уровню воды в сетях водоотведения;- free volumes of drainage networks 25 at the time t _{0 of} solving the mathematical programming problem

In accordance with the present invention, free volumes can be determined in various ways. For example, according to the water level in drainage networks;

- free volumes of water disposal networks 26 at the time t _{0 of} solving the mathematical programming problem

- free volumes of drainage networks 27 at the time t _{0 of} solving the mathematical programming problem

Then, for example, for a period of time Δt = 10 hours:

- maximum system flow parameters for the 1st independent drainage basin

- maximum system flow parameters for the 2nd independent drainage basin

- maximum system flow parameters for the 3rd independent drainage basin

автоматизированных органов управления, характеризующую пределы возможных подач сточных вод из i-го независимого бассейна водоотведения в j-й независимый бассейн водоотведения, в которой значения для главных диагональных и несуществующих элементов равны нулю. В качестве примера выполнения этого этапа составляют матрицу

- таблицу из n=3 строк и n=3 столбцов5. Form a matrix of maximum productivity

automated controls, characterizing the limits of possible wastewater supplies from the i-th independent drainage basin to the jth independent drainage basin, in which the values for the main diagonal and nonexistent elements are zero. As an example of this stage, a matrix

- a table of n = 3 rows and n = 3 columns

значения главных диагональных

,

,

и несуществующих

элементов равны нулю. При этом:In the matrix for the example under consideration

values of the main diagonal

,

,

and nonexistent

elements are equal to zero. Wherein:

автоматизированного органа управления - межбассейновой насосной станции 22, соединяющего транспортную магистраль 4 в независимом бассейне водоотведения 1 с транспортной магистралью 5 в независимом бассейне 2 равна 70000 м3/ч;- maximum performance

an automated governing body - an inter-basin pumping station 22 connecting the transport line 4 in the independent drainage basin 1 with the transport line 5 in the independent basin 2 is 70,000 m3 / h;

автоматизированного органа управления - межбассейнового коллектора 23 с запорно-регулирующим органом 24, соединяющим транспортную магистраль 5 в независимом бассейне 2 с транспортной магистралью 6 в независимом бассейне 3, равна 20000 м3/ч.- maximum performance

an automated governing body - an inter-basin collector 23 with a shut-off-regulating body 24 connecting the transport highway 5 in the independent basin 2 with the transport highway 6 in the independent basin 3, is equal to 20,000 m3 / h.

6. Experimentally determine for each i-th independent drainage basin over a period of time Δt the experimental dependence v _i = f (H _i ) of the system flow parameters v _i at least on the predicted values of precipitation volumes H _i . As an example of performing this step in FIG. Figure 2 shows the form of such a dependence for an independent drainage basin 1. In this case, the experimental data are indicated by 28 and the experimental dependence v ₁ = f (H ₁ ) by 29. In addition to it in FIG. Figure 3 shows the experimental dependences v _i = f (H _i ) for independent drainage basins 2 and 3. Here, 30 denotes the experimental dependence v ₂ = f (H ₂ ), and 31 denotes the experimental dependence v ₃ = f (H ₃ ).

7. Receive data on the predicted values of precipitation volumes H _i , i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt. As an example of the implementation of this stage, suppose that the following forecast was received for the volume of precipitation for a time period of two periods Δt:

- the first period Δt = 10 h: H ₁ = 0 mm; H ₂ = 2 mm; H ₃ = 5 mm;

- the subsequent period Δt = 10 h: H ₁ = 15 mm; H ₂ = 9 mm; H ₃ = 20 mm.

8. Data is obtained on the values of the system flow parameters by calculating the values of the system flow parameters v _i for each i-th independent drainage basin for the forecast time period Δt from the experimental dependence v _i = f (H _i ). At this stage, for example , from the graphs in FIG. 2 and 3 determine:

- the first period in time Δt = 10 hours: v ₁ = 365 thousand m ³ ; v ₂ = 350 thousand m ³ ; v ₃ = 85 thousand m ³ ;

- the subsequent period for the time Δt = 10 hours: v ₁ = 470 thousand m ³ ; v ₂ = 400 thousand m ³ ; v ₃ = 105 thousand m ³ ;

9. They are looking for a solution to the problem of mathematical programming by the criterion of minimum payments for pumping water. The present invention does not exclude various search options for this solution. As an example, one of them can be cited when first they determine:

- specific power consumption of all GNS Wi, kW * h / m ³ ;

- specific power consumption of the inter-basin pumping station 22 W _1.2 , kW * h / m ³ ;

- the cost of the electricity tariff of all GNS C _i , rubles / kW * h;

- the cost of the electricity tariff of the inter-basin pumping station 22 C _1.2 , rubles / kW * h.

Suppose, as a result of this stage, it was found that W ₁ = 0.22 kW * h / m ³ , W ₂ = 0.17 kW * h / m ³ , W ₃ = 0.14 kW * h / m ₃ , W _1-2 = 0.074 kW * h / m ₃ , C ₁ = 3.1 rubles / kW * h, C ₂ = 3.72 rubles / kW * h, C ₃ = 3.73 rubles / kW * h , C _1-2 = 4.82 rubles / kW * h.

-

i = 1, 2, …, n, i≠k,

Then check the conditions

-

i = 1, 2, ..., n, i ≠ k,

The first period, for i = 1

365000+q_1,2-0≥0

365000 + q _1.2 -0≥0

at q _1.2 ≥88000 m ³ / h,

for i = 2

350000+q_2,3 q_1,2≥0

350,000 + q _2,3 q _1,2 ≥0

at q _2.3 q _1.2 ≥82000 m ³ / h,

for i = 3

85000+0 q_2,3≥0

85000 + 0 q _2.3 ≥0

at q _2.3 ≤17000 m ³ / h.

The second period, for i = 1

470000+q_1,2-0≥0

470000 + q _1.2 -0≥0

at q _1.2 ≥17000 m ³ / h,

for i = 2

400000+q_2,3 q_1,2≥0

400000 + q _2.3 q _1.2 ≥0

at q _2.3 q _1.2 ≥ -32000 m ³ / h,

for i = 3

105000+0 q_2,3≥0

105000 + 0 q _2.3 ≥0

there is no solution, i.e. q _2,3 = 0.

-

i = 1, 2, …, n, i≠k

выполняется при 0≤q_1,2≤99 и 0≤q_2,3≤17. Следовательно, решение задачи математического программирования по критерию минимальных платежей за перекачку воды существует. Им является вариант транспортировки воды, когда максимально нагружен бассейн водоотведения 3, в котором стоимость перекачки воды W₃*С₃=0,14*3,73=0,522 руб./м³ является минимальной по сравнению с другими. Таким образом,

При этом q_1,2=0, т.к. W₁*C₁=0,22*3,1=0,682<W₂*C₂+W_1-2*C_1-2=0,17*3,72+0,074*3,73=0,908.From the transformation of these inequalities it follows that there is no solution for the second period, and during the first period, the condition

-

i = 1, 2, ..., n, i ≠ k

performed at 0≤q _1.2 ≤99 and 0≤q _2.3 ≤17. Therefore, there is a solution to the problem of mathematical programming according to the criterion of minimum payments for pumping water. It is the option of transporting water when the maximum wastewater disposal basin 3, in which the cost of pumping water W ₃ * C ₃ = 0.14 * 3.73 = 0.522 rubles / m ^3, is minimal in comparison with others. In this way,

Moreover, q _1,2 = 0, because W ₁ * C ₁ = 0.22 * 3.1 = 0.682 <W ₂ * C ₂ + W _1-2 * C _1-2 = 0.17 * 3.72 + 0.074 * 3.73 = 0.908.

автоматизированных органов управления, при реализации которых суммарный сброс сточных вод в окружающую среду будет минимальным, т.е.

при i = 1, 2, …, n, i≠k,

10. They are looking for a solution to the problem of mathematical programming according to the criterion of minimum discharges of wastewater into the environment as part of an example for the second period, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total discharge of wastewater into the environment will be minimal, i.e.

for i = 1, 2, ..., n, i ≠ k,

400000=32000 м³/ч.The solution is as follows. Because q _2,3 = 0 then

400000 = 32000 m ³ / h.

Thus, the claimed invention has the property of industrial applicability.

Claims (13)

A method for optimizing wastewater flows, comprising the steps of: a) receive data on the values of the parameters of the system flows, transmit them to the control point and write to the RAM of the computer; b) solve the problem of mathematical programming on a computer, using the values of the system flow parameters as initial data, and obtain the values of the optimal flow parameters as a solution; c) transmit to the automated control bodies the values of the settings of their position, ensuring the redistribution of the optimal parameters of the wastewater flows in accordance with the solution of the mathematical programming problem, characterized in that to step a), the entire drainage system is divided into a finite number n of independent drainage basins, each of which contains at least drainage networks connected to a transport line, which is connected to the sewage treatment plant with the main pumping station and discharges treated wastewater into the environment at least one discharge of wastewater into the environment, connected to a transport highway and configured to discharge untreated wastewater into the environment when epolnenii transport route, as the parameters of the flows of the wastewater system take the volumes of wastewater

, i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt, as automated governing bodies take inter-basin pumping stations and / or inter-basin transport highways with shut-off and regulating bodies connecting the transport highways of independent pools, determine the maximum parameters of system flows

for each i-th independent drainage basin for the time period Δt without emissions of untreated wastewater into the environment, where

,

,

- free volumes of collectors and wells, a highway and drainage networks at the moment t _{0 of} solving a mathematical programming problem,

- the maximum supply of the STS of the i-th independent drainage basin, form a matrix of maximum performance

automated controls, characterizing the limits of possible wastewater supplies from the i-th independent drainage basin to the jth independent drainage basin, in which the values for the main diagonal and nonexistent elements are zero, experimentally determine for each i-th independent drainage basin over a period of time Δt the experimental dependence v _i = f (H _i ) of the system flow parameters v _i at least on the forecast values of the precipitation volumes H _i , receive data on the predicted values of precipitation volumes H _i , i = 1, 2, ..., n, for each i-th independent drainage basin for the time period Δt, receive data on the values of the parameters of the system flows by calculating the values of the parameters of the system flows v _i for each i-th independent drainage basin for the forecast period of time Δt from the experimental dependence v _i = f (H _i ), at stage b) the mathematical programming problem is solved by the criterion of minimum payments for pumping water, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total payment of electricity consumption of independent drainage basins and inter-basin pumping stations will be minimal and

, i = 1, 2, ..., n, i ≠ k,

, and in the absence of such a result, they decide the mathematical programming problem to be solved by the criterion of minimum discharges of wastewater into the environment, i.e. as a solution form the matrix of optimal performance

automated controls, the implementation of which the total discharge of wastewater into the environment will be minimal, i.e.

for i = 1, 2, ..., n, i ≠ k,

.

Images