Professional Documents
Culture Documents
2008
M. IST, Z. BAJTEK
ABSTRACT
KEY WORDS
The paper demonstrates a new model for determining the minimum cost for the design of
a water distribution system based on a combination of linear programming methodology
and a genetic algorithms approach. The optimal design of looped hydraulic pipe networks
belongs to the class of large combinatorial optimization problems that are difficult to
handle using conventional operational research techniques. Although many research
efforts have been made for the sake of achieving the optimal design of large loop water
distribution networks, there is still some uncertainty about finding a generally reliable
method. The author of the paper proposes a method in which the complementary usage
of deterministic and soft computing methods will ensure a new level for the quality of
outputs. The method is based on a combination of linear programming methodology and
a genetic algorithms approach and is intended for use in drinking water systems and the
rehabilitation of pressurized irrigation systems as well.
Genetic Algorithm,
Linear Programming,
Optimal design of looped hydraulic pipe
networks
INTRODUCTION
A water distribution network is a system containing pipes, reservoirs,
pumps, and valves of different types, which are connected to each
other to provide water to consumers. It is an important component
of an urban infrastructure or agricultural landscape as an irrigation
project and requires significant investment. Therefore, researchers
are constantly searching for new ways to create more economical
and efficient designs. Although the problem of the optimal design of
water distribution networks has various aspects to be considered, it
is often viewed as a least-cost optimization problem with the pipe
diameters acting as the primary decision variables. In most situations,
the pipe layout, connectivity, and imposed minimum head constraints
at the pipe junctions (nodes) are taken as fixed design targets.
Cisty.indd 1
2008/4 PAGES 1 7
Cisty.indd 2
2008/4 PAGES 1 7
(2)
(3)
(4)
Where Xij is
Bi
Amn
Ci
Di
RESULTS
Mathematical programming methods, which undisputedly lead
to global optimality, can be applied only in the case of branched
networks with no loops for a single loading. In the case of looped
networks, even for the simplest case of a least cost design, under one
single loading for a gravity fed network (no tanks, no pumps), the
debate about global optimality is still, today (after about 40 years),
a research issue. In fact, for looped networks, no deterministic
theoretical methods exist to reach global optimality. For this reason
various heuristic methods are applied to these problems.
But while using heuristic methods (e.g. GA), problem of testing it
arises. Tasks which heuristic methods are capable of solving (e.g.,
the optimization of a looped network) are often not possible to solve
with any other methods, especially not deterministic methods. So it
is not possible to prove their mathematically reliability of them. For
this reason it is obvious to use the so-called benchmark networks
for testing. The problem which follows is that commonly used
Cisty.indd 3
2008/4 PAGES 1 7
we are solving), a loop split will be done in every demand node, and
then we will propose diameters in such a manner that this meeting
of flows will happen in this node. In this way we can produce many
alternatives of splitting the network into branched. The node which
was chosen for this splitting must be doubled; the original node
will be assigned to one link from which the flow is coming to the
node and its twin node to another link from the opposite side of the
original node. The demand in the node will be divided into these
two nodes with a rational number of alternatives. The number of
alternatives depends on the amount of the demand a high demand
in a node requires more alternatives. So the number of demand
nodes multiplied by the number of these alternatives of demand
splitting gives the number of possible branch networks to which it
is possible to divide a one-loop network.
A network may consist of more than one loop, of course. For this
reason the following algorithm intended for the transformation of
a looped network to a branched one will be run:
1. The number of loops will be determined on the original
network:
L=PJ+1
(5)
Cisty.indd 4
Split node
Split link
Split ratio
0.25
0.5
0.75
0.25
0.25
0.25
0.25
0.25
0.25
0.25
2008/4 PAGES 1 7
(mm)
152
203
254
Cost
(units)
11
16
23
32
(mm)
305
356
406
457
508
559
610
(units)
50
60
90
130
170
300
550
Diameter
Cost
Node
Demand
(m3/h)
Ground level
(m)
1 (Reservoir)
-1,120.0
210.00
100.0
150.00
100.0
160.00
120.0
155.00
270.0
150.00
330.0
165.00
200.0
160.00
Cisty.indd 5
2008/4 PAGES 1 7
Alperovits and
Shamir (1977)
D [mm]
L [m]
D [mm]
L [m]
D [mm]
L [m]
D [mm]
L [m]
D [mm]
256.00
508.0
1000.00
457.2
1000.00
457.2
1000
457.2
1000.00
457.2
744.00
457.2
996.38
8.0
66.00
304.8
238.02
304.8
1000
254.0
202.00
304.8
3.62
152.4
934.00
254.0
761.98
254.0
798.00
254.0
1000.00
457.2
1000.00
406.4
1000.00
406.4
1000
406.4
1000.00
406.4
319.38
8.0
713.00
76.2
1000.00
25.4
1000
101.6
1000.00
25.4
680.62
152.4
287.00
50.8
1000.00
406.4
836.00
406.4
628.86
406.4
1000
406.4
693.00
406.4
164.00
355.6
371.14
355.6
307.00
355.6
990.00
254.0
10.00
203.2
902.00
254.0
98.00
203.2
1000.00
25.4
6
7
8
Cost
784.94
304.8
109.00
304.8
989.05
254.0
215.06
254.0
891.00
254.0
10.95
8.0
1000.00
152.4
819.00
254.0
921.86
254.0
181.00
8.0
78.14
8.0
1000.00
25.4
990.93
152.4
920.00
76.2
9.07
101.6
80.00
50.8
497 525
417 500
402 352
419 000
1000
1000
1000
254.0
254.0
25.4
403 454
Cisty.indd 6
ist (2008)
L [m]
Geem (2002)
ACKNOWLEDGEMENT
This study was supported by the Scientific Grant Agency of the
Ministry of Education of the Slovak Republic and the Slovak
Academy of Sciences, Grants No. 1/0496/08, 1/0585/08 and by
Slovak Research and Development Agency, Grant No. APVV0443-07.
2008/4 PAGES 1 7
REFERENCES
Cisty.indd 7