Dimensioning of Branching Irrigation Networks by Means of Linear Programming
Dimensioning of Branching Irrigation Networks by Means of Linear Programming
Dimensioning of Branching Irrigation Networks by Means of Linear Programming
1. hJAS
1. Notations
lift of pumping station in the k-th service condition;
pumping level (on sucking side):
head loss of pumping station (from pump shaft to junction at main condnit in
the k-th service condition:
mark of critical point (critical hydrant):
elevation of critical point;
mark of service condition critical to point p:
service pressure above ground level to be maintained at the critical point;
head loss permissible up to critical point:
permissible minimum and maximum
velocity, respectively. in pipes:
number of pipe section considered;
by sections longitudinal elements of a pipe system are understood:
- exempt of branching:
- along which water discharge is constant in every service condition (no drawoffs o
branches are found within the length):
- wherein no hydrants to be checked for service pressure are inserted (e.g. from the
viewpoint of geodetic elevation).
Section symbols
length of section;
i-th pipe diameter in the section:
number of different pipe sizes in the section;
length of portion with the i-th diameter:
10*
350 I. IJJAS
The problem is to select the pipe sizes so that the required discharge and
head is available even at the hydrants in the worst position, at a minimum
cost of construction for the pipe network.
The permissible head loss from the pumping station to the p-th critical
point is known:
(1)
The available pipe sizes (which may be used for the construction of the
pipe network) and the minimum and maximum velocity permissible in the
pipes are given.
Consider an arbitrary conduit section and assume it to be constructed
telescope-like of pipes of all the diameters available so that the velocity of
water cannot exceed the maximum permissible velocity V max even for the
maximum discharge in the section, but it is higher than the permissible
minimum velocity Vmin'
In the section of length lj' the portions built of different pipe sizes may
be of arbitrary length lij' provided two conditions are met:
(2)
and
r;
..:21ij = lj. (3)
=1
BRAXCHI:YG IRRIGATIOX II'ETWORKS 351
(4)
where E; [Qkj] = specific head loss along the portion of i-th size in the k-th
service condition.
The head loss bet'ween the pumping station and the p-th critical point
(hydrant) must not surpass the value obtained from (1):
(5)
where p indicates that along the critical line between the pumping station and
point p the head losses of all the sections are to be summed.
The sections of the pipe network should he built of pipe sizes such as to
minimize the construction cost, hence:
n Tj
2.2. iVIathematical model for the determination of the optimum lift of the pumping
station
costs during T years. Thus, the target function (6) tak('s the form:
n T;
K = B.J...TU ~ ...:;.
= ...,;;; "';;'bZ+THC.
lJ IJ. , (7)
j=l i=l
s;
H- .::E ;2 Ei[Qlij] Iij H,,+Hp--Hl +Hb , (8)
p i=l
Development of the model set out from that in every section of the
network the largest pipe size complying with the limit velocity Vmin has been
applied. In this case, the construction cost of the pipe network is
n
Bma" = ;; blj Ij (9)
j=l
h~ = ;; E)[QkJ Ij (10)
p
where El [Q"j] specific head loss along the j-th conduit section for the
largest pipe size (meaning of p is here the same as in (5)).
If the head loss concomitant to the largest pipe size IS higher than the
permissible one, i.e.
(11)
then the problem cannot be soh'ed bv th(' utilization of the gIven series of
pipes.
Application of the largest possible diameters in the pipe network would
be uneconomic. Therefore, as far as possible, in certain sections smaller dia-
meters should be applied. But neither the total length of the new, narrower
BR.LVCHLYG IRRIGATIO,V :VET WORKS 353
portions can be longer than the entire length of the section. Thus, the folIo'wing
condition is to be met:
(12)
wherein lij = length to change over to the i-th diameter (the largest pipe size
i = 1).
Changing over from the largest to a smaller diameter results in an in-
creased head loss. The amount of this increase along the length to the critical
points cannot exceed the difference between the head available and the head
loss due to the application of the largest pipe size.
11 rj
Select d for each section; compute head losses Compute optimum cost for first pump lift from @Ond@a,
B=Bma,-B'max
pu~~--;;r;--J
J
Start computing first simplex table for first
Print results for the first pump lift
.
rJ
Compute hydraulic conditions 0
r.r (E i [QkJ] -E 1 [Qk)] )'I ii ~ hp - H1 [Qkj] 'Ij ,...
p~ 'p No
Are there still pump lifts? I:::
~
Print results r;;
'Compute geometric
rJ
conditi~~s CB I L______
The second model is more eon-venient than the first one hy its fewer
iteration8, the 8maller extent of the problem and the shorter computer timc.
For this problem, se-veral programs ha-ve heen developed in ALGOL 60
language whieh are applied by the Water Management Organization and
Computing Bureau and hy the Institute for \\1 ater Management and Hydraulic
Engineering of the Teehnical "University, Budapest.
The model is computer constructed climinating the cumbersome data
setup.
The program permits the determination of optimum diameter com-
binations corresponding to lifts of seyeral pumps, in-voh-ing several right-hand
sides. The optimum related to the first lift having been determined, com-
putation affects the second right-hand side, i.e., the dual problem. The algo-
rithm quickly approximates the optimum for the second and further pump
lifts. The number of iterations and therehy, the computer time needed for the
second and further lifts make up a minor fraction of those required for the first
lift.
This program helped already to design sprinkler irrigation systems for an
area over 150000 ha in Hungary. Economy in first costs amounted to 2500
f orints per ha.
356 I IJJAS
Summary
In Hungary, linear programming has been applied since 1966 for dimensioning branching
irrigation pipe networks. The presented mathematical model (first model) has been used in
several countries with more or less modifications, yet, another mathematical model (second
model) has been developed at the Institute of Water Management and Hydraulic Engineering of
the Technical University. Budapest. For the optimization of the branching pipe networks,
programs using several different methods (Labye's discontinuous method, linear programming)
have been established. In the case of identical input data and conditions, the programs operat-
ing according to different methods gave identical results. The application fields of the methods
are different. In many cases, the choice of the convenient method depends on the nature of
the problem.
References
1. CHliDZIK, B.-OPALIl'\SKI. Cz.: Techniczno-ekonomiczna optimalizacja projektu sieci
rurociag6w deszczownianych. Zeszyty Xaukowe Wyzszej Szkoly Rolniczej we \\'ro-
clawiu. Wroclaw. 1970. Nr. 90.
2. IJJA5. I.:' Investigation of underground pipe network of sprinkler irrigation systems.
(In Hungarian). (Dr. Techn. Thesis 1966).
3. IJJA5, I.: Determination of the optimum lift of pumping stations by means of dynamic
programming. Periodica Polytechnica. Civ. Eng. 14 (1970) 243.
4. IJJA5, I.: Okreslenie srednic podziemnej sieci rurociag6w deszczowni. Zeszyty :\'aukowe
.. \\iyzszej Szkoly Rolniczej we Wroclawiu, Wroclaw, 1970. :\'r. 90.
,).IJJA5, I.: Application of computers in agricultnral water resources management. (In
Hungarian). Lecture notes for special engineering students. Tankiinyvkiad6 1971
6. IJJAS, I.: Determination of the optimal route of the main conduit of branching irrigation
pipe networks by means of dynamic programming. ICID YIlI. European Congress, 1971.
BRASCHISG IRRIGATIOS SEnmRKS 337
Senior _~ss. DJ' Ish-an lJJAS, 1111 Budapest, lVIiiegyetem rkp. 3, Hungary