Professional Documents
Culture Documents
By Paul W - Jowitt and Chengchao Xu: Agement, Vol. 116, No. 4, July/August, 1990. ©ASCE, ISSN 0733-9496/90/0004
By Paul W - Jowitt and Chengchao Xu: Agement, Vol. 116, No. 4, July/August, 1990. ©ASCE, ISSN 0733-9496/90/0004
DISTRIBUTION NETWORKS
INTRODUCTION
455
100
90
80
70
60
"J 50
< 1
<
40
30
20
10
20 40 60 80 100
AVERAGE ZONE NIGHT PRESSURE (m)
function that describes the relationship between the element flow and the
head difference between the two ends of the element. The form of the re-
lationship depends on the physical characteristics of the element. The sys-
tem-governing equations can be formulated in accordance with the following
two familiar rules: (1) Nodal mass balance—the algebraic sum of all the
inflow and outflow at each node is equal to zero; and (2) Energy conser-
vation—the total sum of the all head losses around any loop in the network
is equal to zero.
There are several pipeflow formulas available that relate flow and head
loss under various flow regimes. The most typical are the Darcy-Weisbach-
Colebrook-White and Hazen-Williams equations (Twort et al. 1985). The
Darcy-Weisbash equation in conjunction with Colebrook-White formula is a
more accurate representation of wide-ranging flow conditions but requires
more computational effort; the Hazen-Williams equation is not really valid
for flows throughout the laminar, transition, and rough regimes, but it has
the advantage of computational simplicity and therefore receives wider ap-
plication. By using the Hazen-Williams equation, the flow-head-loss char-
acteristics of a pipe can be modeled as follows:
fiff (la)
~zr-sgn(ff,-ff,).|ff,-/ryr
Q9 = Rtj-SgniH, - Hj) • \H, - tf/'54 (lb)
In Eq. la and b, Qv represents the flow (1/s); Dtj = pipe diameter (m); Ltj
= length of the pipe (m); Ht - head at node i (m); CHWV = Hazen-Williams
coefficient for the pipe that connects nodes i and j ; a = a constant whose
value depends on the units used (for the units used herein, a has the value
278.534); Sgn(x) = sign of x. Some of the elements of Eq. la do not vary
with head or flow, and it is convenient to gather these together as a com-
posite term Rv, as shown in Eq. lb.
In the case of a flow-control valve located between nodes i and j , the
relationship between the flow and head loss can be expressed in a form
analogous to Eq. 1:
Q,j = V{k) -Ry Sgn(Ht - Hj) • \H, - Hj\0-54 (2)
where V(k) = a parameter that represents the setting of the Ath flow-control
valve. In this equation, the behavior of a fully closed valve is represented
by setting V(k) to zero. Alternatively, a value of V(k) of unity would rep-
resent a fully open valve, which produces no head loss beyond that in the
pipe element. In general, there may be physical limits to V(k) that restrict
its value to some range in the interval zero to unity. In the development to
follow, the question as to which type of valve is used is left open; the pur-
pose is simply to demonstrate the efficacy of operational valve control in
minimizing uncontrolled leakage. It should also be noted that some valves
may only permit flow in one direction. This aspect is not considered ex-
458
459
subject to:
jeR,- J<ER,
460
available for its solution, including the steepest-descent method, the con-
jugate-gradient method, and the sequential-minimization method (Lasdon
1970). However, the method employed herein is a combination of the linear-
programming and the linear-theory methods; the latter has been widely used
in the analysis of water networks (Wood and Charles 1972; Isaacs and Mills
1980).
i
LINEAR-THEORY METHOD
*S = j ^ T i i - - - - ( 12fe )
461
where
icsr
Substitution of Eqs. 12-14 into Eq. 5 results in a set of simultaneous
linear equations that can be solved readily. The process is repeated until
sufficient convergence is obtained. Numerical experiments show that con-
vergence can be accelerated and ensured if the estimates of flow and leakage
used to linearize Eqs. 12-14 take the following forms after the first iteration:
&j = 0.5 • (fig + Qf1) (15a)
QSl = 0.5 • (QS"9 + QSp) (15fe)
The computational flows Qy and leakage QSy satisfy the continuity rule since
Qh QSlj, Qf1, and QSnfl satisfy Eq. 5 after the first iteration. The iterative
procedure is terminated when the maximum flow discrepancy (Sg.j = Q"j —
Qlrl) in successive iterations is less than some specified tolerance e.
Max|82,y| < e (16)
ijER
Eqs. 12 and 13 can be used to linearize the pipe flow and leakage terms
within the program (Eq. 9). The only remaining nonlinearity is that involving
the unknown valve settings in Eq. 14. The original expression (Eq. 2) in-
troduced to model the effect of each valve can be rewritten as follows:
Qn = V(k)-qtj (17)
where qtj is termed the fictitious pipeflow.
By forming the total differential, the nominal change in the valve flow
can be expressed:
Afi,y = V{kf-Lqij + ,5 • AV(*) (18)
The valve flow at the current iteration can be considered
e r ' = Qlj + Afi„ (19)
Substituting Eqs. 17 and 18 into Eq. 19, and noting the identities AV(&) =
W + 1 • - V(k)n and bq0 = qf' - <fi, gives:
Qf = WW • <?r]] + [qlj • V(k)n+1] - [V(kf •«}] (20)
In a previous approach by Germanopoulos and Jowitt (1989), the valve
flow was given in the following manner
QT1 = «S+I - [i-o - v(k)n+l]-qi (2i)
Notice that the linearization formula (Eq. 20) is different from Eq. 21 in
that the valve setting V(k)n at the previous iteration is incorporated; the new
462
Kj {22b)
' ~wir--
SOLUTION VIA LINEAR PROGRAMMING
Substitution of Eqs. 12, 13, 20, and 22 into the program (Eq. 9) leads,
after n iterations, to the following linear program for the valve-control prob-
lem:
Min 2 KSIj'iHr1 + HJ+1) - ^ KS"U (G, + G}) (23a)
ijER IjeR
subject to
0.5 • 2) KSnv• [H?+l + HJ+1 - (G, + Gj)] + C, + ^ Kny- (H?+1 - H]+i)
j^Rt jeRi
+ ^ iV(k)n • Klj • (Hfl - H'J+l) + q\ • V{k)"+l - ql • V(k)"] = 0;
MRl
i = 1, ..., N (23b)
+i
H? >Hf; i = 1, ..., NR (23c)
min n+l raa
V(k) < V(k) < V(fc) *; k = 1, ..., K (23d)
and
H, > 0; i=l,...,N (23e)
where the objective function term X KS"j (G, + G,) = a constant during the
optimization and can be stripped out; R] and Rj = subsets of Rt that represent
the sets of connections to node i through a pipe and a flow-control valve,
respectively. The quantities in the program (Eq. 23) with a superscript n are
regarded as constants; those with a superscript of n + 1 represent the de-
cision variables.
After solution of the program (Eq. 23), the new values for the heads and
valve settings are used to relinearize the hydraulic constraints for the next
iteration of the linear program. The linear-theory method is thus implicit
within the linear program. Iterations continue until convergence is obtained.
The iterative procedure of the proposed approach can be summarized as fol-
lows:
NUMERICAL EXAMPLES
Legend
_r~|_ Fixed head node
0 Junction node
_ c < _ Flow control valve
464
3 14.0 f 0.0
4 12.0 5.0
5 14.0 30.0
6 15.0 10
7 14.5 0.0
8 14.0 20.0
9 14.0 < 0.0
10 15.0 5.0
11 12.0 10
12 15.0 0.0
13 23.0 0.0
14 20.0 5.0
15 8.0 20.0
16 10.0 0.0
17 7.0 0.0
18 8.0 5.0
19 10.0 5.0
20 7.0 0.0
21 10.0 0.0
22 15.0 20.0
1 .20
1 .00
0.80
Downloaded from ascelibrary.org by ARIZONA,UNIVERSITY OF on 01/05/13. Copyright ASCE. For personal use only; all rights reserved.
O.SO f
0.40
0.20
0.00
0 2 4 6 8 10 12 11 IG 18 20 22 21
Time '
(U
>
(D
Hi
l-l
U
0)
<n
0)
PC
>
U
•H
0
>
l-l
0)
CO
0)
«
467
56L
Downloaded from ascelibrary.org by ARIZONA,UNIVERSITY OF on 01/05/13. Copyright ASCE. For personal use only; all rights reserved.
<u
> 55L
(U
u
•H
o 54
>
u
0)
to
<D
Pi c^^| , , , , , , , , , , , I
0 2 4 6 8 10 12 H IS 18 20 22 21
Time
COMPUTATIONAL DETAILS
The overall procedure just outlined has been coded in Fortran 77 and im-
plemented on the VAX/VMS-8700 mainframe computer at Heriot-Watt Uni-
versity, Edinburgh, United Kingdom. The linear-theory component for the
static analysis used NAG library subroutines F01BRF, F01BSF, and F04AXF
for solving the resulting simultaneous linear equations, which are capable of
exploiting the structure of sparse matrices. The linear-programming problem
is solved by the revised simplex method using NAG library subroutine H01ADF
in which degeneracy is resolved by using the perturbed-problem technique.
The execution time [central processing unit (CPU)] for the example shown
is about 0.4 sec for each iteration. Convergence is achieved in 8-15 itera-
tions.
It has been indicated earlier that linearization of the valve action embodied
in Eq. 20 takes a different form to that used in previous research (Geman-
opoulos and Jowitt 1989). The relative performance of the two methods can
be seen by comparing the maximum discrepancy in the flow and leakage at
consecutive iterations, as shown in Fig. 11. It can be seen that Eq. 20 gives
improved convergence.
Water-supply networks are planned and designed to cope with current and
future peak demands; it is inevitable that excessive pressures will exist and
468
ont
CO 0)
N'
M
0 00 CO
H
H fl>
0)
< M N)
R
Downloaded from ascelibrary.org by ARIZONA,UNIVERSITY OF on 01/05/13. Copyright ASCE. For personal use only; all rights reserved.
o < o
<D
< rs) •
IO
o
o
&ro
p
r
3 s
32
o
a
m
Downloaded from ascelibrary.org by ARIZONA,UNIVERSITY OF on 01/05/13. Copyright ASCE. For personal use only; all rights reserved.
a.
<D
U
Iteration
will frequently occur, typically at the diurnal scale. Whilst adequate pressure
is essential to maintain a satisfactory service, these excess pressures are un-
desirable because they can lead to significant levels of leakage. To increase
economic efficiency, leakage should be reduced to appropriate levels. The
work described in this paper outlines a method of minimizing leakage through
optimal valve control. Reducing leakage leads to financial saving in annual
operational costs and by the deferment of capital investment to increase net-
work capacity. An additional benefit arising from pressure regulation is the
reduction in the frequency and consequent cost of repair of pressure-induced
mains bursts.
The control scheme for minimizing leakage can be implemented alone or
j in conjunction with other leakage-control and detection methods. The latter
include regular sounding (using a simple sounding rod or a "leak noise cor-
j|! relator"), district metering, waste metering, and combined district and waste
il'll metering (NWC: "Leakage" 1980; Twort et al. 1985). Waste metering in-
ijj volves valving off the supply to a group of 1,000 or so consumers, and
jjj.'l installing a waste meter to record night-line flows. The technique is both
u, , time-consuming and expensive, and in any event serves mainly to locate
! jj1 ! districts with high losses. It should be noted at this point that the current
i!' mathematical representation of pressure-dependent leakage term used in this
paper derives from data collected from a specified set of field experiments,
1
MI i and may not be representative of other circumstances [for example, for data
I j! from some networks in Japan (Miyaoka and Funabashi 1984) water leakage
i !!;,! is found to be a function of service pressure to the power 1.15 instead of
h!' ! 1.18]. For many networks, a calibrated pressure-leakage relationship may
I !''!! not be available, but it is hoped that the technique described in the present
([ ], paper will stimulate further interest, both analytical and experimental, in the
estimation of leakage in distribution networks.
The method developed in this paper can also be used to identify the most
appropriate location of flow-control valves at the planning stage. The prob-
lem of optimal valve location is being investigated and results will be pre-
sented on another occasion. In addition, many actual networks contain pumps
and the effect of valve operation on these would need to be taken into ac-
470
tend to increase leakage costs. The leakage model usejl in this paper can be
used to quantify any such effects explicitly.
ACKNOWLEDGMENT
APPENDIX I. REFERENCES
471
| l! : Superscripts
| ],[;;! Min = minimum;
Max = maximum; and
n = nth iteration.
Subscripts
i,j = node numbering.
472