# Water supply network in a fuzzy environment; maximum-entropy approach.

Abstract

The maximum entropy principle initiated by Jaynes  is a powerful optimization technique of determining the distribution of random system in the case of partial or incomplete information or data available about the system [7, 10, 12, 13]. In our real world problem input data or parameters are often fuzzy or imprecise because of incomplete or non-obtainable information. The system is pipe line network, Which delivers known demands from source, Which are fuzzy number, to consumers. Traditional mathematical programming is unable to solve this type of problem. The paper deals with the estimation of optimal distribution of water in a water supply network by modifying the maximum entropy principle after ranking of fuzzy number.

Keywords and Phrases: Triangular fuzzy number, Ranking of fuzzy numbers, Maximum entropy principle, Shanon entropy.

1. Introduction

In recent years, fuzzy set theory has been given place in the realm of logistics. Zimmermann  first applied the fuzzy set theory concept with some suitable membership functions to solve linear programming problem with several objective functions. He showed that solutions obtained by fuzzy linear programming are always efficient.

In this paper we introduce looped water supply network. Network has a single source from where water is distributed to different demand which are known and fuzzy number. We estimate the flow rate. In our practical life demand, source are not always crisp. First we have constructed an equivalent crisp model by ranking fuzzy numbers with respect to their total integral value. In order to calculate the flow rate (in [m.sup.3]/hr) in the pipes of a looped system accurately we need additional information to enable us to calculate the head losses around the loops and so determine the flow rates. The conventional computer oriented pipe network analysis method [1, 10] are useless in this situation as they require data on pipe lengths, diameters, and friction coefficients which we do not have. We can then infer some sort of "most likely" flow rate based only upon the incomplete information that we possess.

2. Preliminary Concepts

The problem considered in this study arises when a decision maker has vague or imprecise data in hand. At this point the coefficients in the problem can be defined by fuzzy numbers [4, 6]. Before developing optimization model, some basic concepts of fuzzy set theory and ranking fuzzy number functions are described below.

2.1 Fuzzy Sets and Fuzzy Numbers

Definition 2.1. Define a universe of discourse, X, as a collection of objects all having the same characteristics. A fuzzy set [~.A] of X is defined by membership function [[mu].sub.[~.A]] : X [right arrow] [0, 1]. [[mu].sub.[~.A]](x) is the degree of membership of x in [~.A]. The closer the value of [[mu].sub.[~.A]](x) is to unity, higher the grade of x in [~.A]. Therefore, [~.A] is completely characterized by the set of ordered pairs : [~.A] = {(x, [[mu].sub.[~.A]](x))| x [member of] X}.

Definition 2.2. Let F(R) be a set of all triangular fuzzy numbers in real line R. A triangular fuzzy number [~.A] [member of] F(R) is a fuzzy number with the membership function [[mu].sub.[~.A]] : R [right arrow] [0, 1] parameterized by a triplet ([a.sub.L], a, [a.sub.R]) where [a.sub.L] and [a.sub.R] denote the lower and upper limits of the support of a fuzzy number [~.A] with mode a :

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (1)

where [a.sub.L] [less than or equal to] a [less than or equal to] [a.sub.R] are real numbers, and [[mu].sub.[~.A].sup.L](x) and [[mu].sub.[~.A].sup.R](x) are the left membership function and right membership function of the fuzzy number [~.A]. [[mu].sub.[~.A].sup.L](x) : [[a.sub.L], a] [right arrow] [0, 1] is continuous and strictly increasing and [[mu].sub.[~.A].sup.R](x) : [a, [a.sub.R]] [right arrow] [0, 1] is continuous and strictly decreasing function.

Figure 1: Triangular Fuzzy Number

In the triangular fuzzy number [~.A] denoted by [~.A] = ([a.sub.L], a, [a.sub.R]), the parameter a gives the maximal grade of [[mu].sub.[~.A]](a), i.e. [[mu].sub.[~.A]](a)=1; it is the most possible value of the evaluation data. [a.sub.L] and [a.sub.R] are the lower and upper bounds of the available areas of the evaluation data. For a non fuzzy number A, this can be expressed as [~.A] = (a, a, a). A triangular fuzzy number is therefore a generalization of a non-fuzzy number.

By the extension principle Zadeh , an arithmetics operation [~.W] = [~.U] * [~.V] of two triangular fuzzy numbers [~.U] = ([u.sub.L], u, [u.sub.R]) and [~.V] = ([v.sub.L], v, [v.sub.R]), is a triangular fuzzy number whose membership function [[mu].sub.[~.W]](x) is defined by Dubois and Prade  and Kaufmann and Gupta  as:

[[mu].sub.[~.W]](z) = [[mu].sub.[~.U]*[~.V]](z) = [sup.[z=x*y]] min{[[mu].sub.[~.U]](x), [[mu].sub.[~.V]](y)}

where * denotes the one of the arithmetic operations +, - or X. Then, the result of fuzzy addition [~.U][direct sum][~.V] = ([u.sub.L]+[v.sub.L], u+v, [u.sub.R]+[v.sub.R]) is also a triangular fuzzy number. The operation of fuzzy subtraction [~.U] - [~.V] = ([u.sub.L] - [v.sub.R], u - v, [u.sub.R] - [v.sub.L]) and scaler multiplication

k x [~.v] = (k[v.sub.L], kv, k[v.sub.R]), k [greater than or equal to] 0

= (k[v.sub.R], kv, k[u.sub.L]), k < 0

are also fuzzy number.

2.2 Ranking Fuzzy Numbers with Respect to their Total Integral Value

Before making a decision, decision-makers have to assess the alternatives with fuzzy numbers and rank these fuzzy numbers correspondingly Liou and Wang . It can be seen that ranking of fuzzy numbers is an important procedure in solving the fuzzy programming problem. Many methods have been proposed for ranking of fuzzy numbers. A relatively simple computation and easily understood method proposed by Liou and Wang  is considered in this study.

Definition 2.3. Let [~.A] be a triangular fuzzy number with membership function (1). The left integral value of[~.A] is defined as

[I.sub.L]([~.A]) = [[integral].sub.0.sup.1] ([[mu].sub.[~.A].sup.L])[.sup.-1](y)dy (2)

and the right integral value of [~.A] is defined as

[I.sub.R]([~.A]) = [[integral].sub.0.sup.1] ([[mu].sub.[~.A].sup.R])[.sup.-1](y)dy (3)

Where ([[mu].sub.[~.A].sup.R])[.sup.-1](y) and ([[mu].sub.[~.A].sup.L])[.sup.-1]

(y)aretheinversefunctionsof [[mu].sub.[~.A].sup.L](x) and [[mu].sub.[~.A].sup.R](x) respctively.

For TFN [~.A] = ([a.sub.L], a, [a.sub.R])

([[mu].sub.[~.A].sup.L])[.sup.-1](y) = [a.sub.L] + (a - [a.sub.L])y and ([[mu].sub.[~.A].sup.R])[.sup.-1](y) = [a.sub.R] + (a - [a.sub.R])y, y [member of] [0, 1]

Thus, we have

[I.sub.L]([~.A]) = [1/2]([a.sub.L] + a) (4)

and

[I.sub.R]([~.A]) = [1/2](a + [a.sub.R]), (5)

The left integral value [I.sub.L]([~.A]) and the right integral value [I.sub.R]([~.A]) of a TFN [~.A] are geometrically interpreted as the areas of trapezoids OLPQ and ORPQ respectively (Figure 1)

Definition 2.4. Lit [~.A] be a triangular fuzzy number with membership function (1), then the total [lambda]-integral value of [~.A] with index of optimism [lambda] [member of] [0, 1] is defined as

[I.sub.T.sup.[lambda]]([~.A]) = [lambda][I.sub.R]([~.A]) + (1 - [lambda])[I.sub.L]([~.A])

= [1/2][[lambda][a.sub.R] + a + (1 - [lambda])[a.sub.L]] (6)

where [I.sub.R]([~.A]) and [I.sub.R]([~.A]) are the right and left integral values of [~.A] respectively.

The left integral value is used to reflect the pessimistic viewpoint and the right integral value is used to reflect the optimistic viewpoint of the decision maker. The total [lambda]-integral value is a convex combination of right and left integral values through an index of optimism.

Remarks. When [~.A] is a crisp number, denoted by (a, a, a), then

[I.sub.T.sup.[lambda]]([~.A]) = [lambda][I.sub.R]([~.A]) + (1 - [lambda])[I.sub.L]([~.A])

= [1/2][[lambda]a + a + (1 - [lambda])a] = a

It is observed that the total integral value of a non-fuzzy number [~.A] [=(a, a, a)] is a for all values of [lambda].

Definition 2.5. Let S = {[~.A.sub.1], [~.A.sub.2],..., [~.A.sub.n]} be a set of convex fuzzy numbers, and that ranking function R R : S [right arrow] R is a mapping from S to the real line R. For any distinct [~.A.sub.i], [~.A.sub.j] [member of] S, the ranking function has the following properties:

(1) R([~.A.sub.i]) < R([~.A.sub.j]) implies [~.A.sub.i] < [~.A.sub.j],

(2) R([~.A.sub.i]) = R([~.A.sub.j]) implies [~.A.sub.i] = [~.A.sub.j],

(3) R([~.A.sub.i]) > R([~.A.sub.j]) implies [~.A.sub.i] > [~.A.sub.j]

In this study, total [lambda]-integral value of fuzzy numbers is used as the ranking function. Under a given level of optimism [lambda] [member of] [0, 1], fuzzy numbers can be ordered by comparing their total integral value with their [lambda]-value. That is, for any distinct [~.A.sub.i], [~.A.sub.j] [member of] F(R) [subset] S, we use the following criteria to rank a fuzzy number based on Definition 2.5:

(1) [I.sub.T.sup.[lambda]]([~.A.sub.i]) < [I.sub.T.sup.[lambda]]([~.A.sub.j]) implies [~.A.sub.i] < [~.A.sub.j] ([~.A.sub.i] is smaller than [~.A.sub.j]),

(2) [I.sub.T.sup.[lambda]]([~.A.sub.i]) = [I.sub.T.sup.[lambda]]([~.A.sub.j]) implies [~.A.sub.i] = [~.A.sub.j] ([~.A.sub.i] is equal to [~.A.sub.j]),

(3) [I.sub.T.sup.[lambda]]([~.A.sub.i]) > [I.sub.T.sup.[lambda]]([~.A.sub.j]) implies [~.A.sub.i] > [~.A.sub.j] ([~.A.sub.i] is greater than [~.A.sub.j]).

Obviously, the ranking function for fuzzy numbers is affected by the decision maker's degree of optimism, which is represented by the parameters [lambda] [member of] [0, 1]. A larger [lambda] specifies a higher degree of optimism. For instance, when [lambda] = 1, the total integral value [I.sub.T.sup.1]([~.A]) = [I.sub.R]([~.A]) represents an optimistic decision maker's point of view. On the other hand, when [lambda] = 0, the total integral value [I.sub.T.sup.0]([~.A]) = [I.sub.L]([~.A]) indicates pessimistic decision maker's point of view.

When [lambda] = 0.5, [I.sub.T.sup.0.5]([~.A]) = [1/2]([I.sub.R]([~.A]) + [I.sub.L]([~.A]))

= ([a.sub.L] + 2a + [a.sub.R])/4

which is the same as ordinary representation of [~.A] Kaufmann and Gupta, . It indicates a moderately optimistic decision maker's point of view and is well qualified to be a defuzzification of the fuzzy number [~.A].

3. The Maximum Entropy Principle Probabilistic Distribution

Consider a random process which can be described by discrete random variable X with n possible outcomes {[x.sub.1], [x.sub.2],..., [x.sub.N]}. Define [p.sub.i], i = 1, 2,..., N, to be the probability that X has the values [x.sub.i], i = 1, 2,..., N. i.e. P(X = [x.sub.i]) = [p.sub.i]. The probabilities are not known. Some information is available about the random process in the form of M expectation function

[N.summation over (j=1)] [p.sub.j][a.sub.ij](x) = E[[a.sub.i]], i = 1, 2,..., M (7)

[N.summation over (j=1)] [p.sub.j] = 1 (8)

Our problem is that of finding a probability assignment which avoids bias while agreeing with whatever information is given. The distribution random process possesses great deal disorder or chaos. This measure of disorder was given by Shanon  as:

S([p.sub.1], [p.sub.2],..., [p.sub.N]) = -K[N.summation over (j=1)] [p.sub.j] ln[p.sub.j] (9)

where K is a positive constant called the Boltzmann constant, depends upon the unit measurement of entropy. Jaynes's Maximum Entropy Principle casts the problem of determining the discrete probabilities p into the form of an optimization problem. Modified form of Maximum Entropy Principle  is used to generate solution to wider, more general problems where the available information is not complete.

Problem

Maximize S = -[N.summation over (j=1)] [p.sub.j] ln([p.sub.j]), (K = 1) (10)

Subject to linear constraints:

[N.summation over (j=1)] [p.sub.j] = 1 (11)

[N.summation over (j=1)] [p.sub.j] [b.sub.ij] = [c.sub.i], i = 1, 2,..., M (12)

The solution of the problem I is

[p.sub.j] = exp{- [mu] - [M.summation over (i=1)] [[beta].sub.i][b.sub.ij]}, j = 1, 2,..., N (13)

where [[beta].sub.i], i = 1, 2,..., M and [mu] are Lagrange multipliers associated with (12) and (11) respectively. To determine the probabilities [p.sub.j], j = 1, 2,..., N from the equation (13) it is therefore necessary to know the values of Lagrange multipliers. This can be found solving the equations

[N.summation over (j=1)] exp {-[M.summation over (i=1)] [[beta].sub.i][b.sub.ij]} = exp([mu]) (14)

[N.summation over (j=1)] [b.sub.ij] exp {- [mu] - [M.summation over (i=1)] [[beta].sub.i][b.sub.ij]} = [c.sub.i], i = 1, 2,..., M (15)

Solving the (M + 1) non-linear equations we can find (M + 1) Lagrange multipliers, which is awkward and tedious and required laborious numerical calculation. We modify this process in the following way:

Assume that the matrix B = [[b*.sub.ij]][.sub.(M+1)xN] where [b*.sub.ij] = [b.sub.ij], i = 1, 2,..., M

= 1, i = M + 1, j = 1, 2,..., N

has the rank (M + 1) [M + 1 < N, otherwise equations (14) and (15) would themselves be sufficient to determine the unknown probabilities uniquely and would consist of complete rather than partial information.]

Then we can write

[p.sub.1] = [[psi].sub.1]([p.sub.M+2], [p.sub.M+3],..., [p.sub.N])

[p.sub.2] = [[psi].sub.2]([p.sub.M+2], [p.sub.M+3],..., [p.sub.N])

... (16)

[p.sub.M+1] = [[psi].sub.M+1]([p.sub.M+2], [p.sub.M+3],..., [p.sub.N])

Then original problem is then reduced to unconstrained optimization problem. For maximization [partial derivative]S/[[partial derivative][p.sub.j]] = 0. Then

[p.sub.j] [M+1.[product].[i=1]] [[psi].sub.i.sup.([[partial derivative][[psi].sub.i]]/[[partial derivative][p.sub.j]])] = exp [- {1 + [M+1.summation over (i=1)] [[[partial derivative][[psi].sub.i]]/[[partial derivative][p.sub.j]]]}], j = M + 2, M + 3,..., N. (17)

Hence N - (M + 1) equations and N - (M + 1) unknowns, which can be solved to find the values ([p.sub.M+2], [p.sub.M+3],..., [p.sub.N]) and then from the relations (16) we can find the whole set ([p.sub.1], [p.sub.2],..., [p.sub.N])

4. Water Supply Network Analysis

Water distribution system connect consumers to sources of water, using hydraulic components, such as pipes, valves and reservoirs. The engineer faced with the design of such a system or of additions to an existing system, has to select sizes of its components. Also he has to consider the way in which the operational components will used to supply the required demands with adequate pressures. A problem is to estimate of least biased pipe flow rate through different known direction of a looped water network from known demand, which is usually made that all the demands occur at the nodes. In order to calculate the flow rates in the pipes of a looped system accurately we need additional information to enable us to calculate the head losses around the two loops and so determine the flow rates. The conventional computer oriented pipe network analysis [1, 9, 10, 11] are useless in this situation as they required data on pipe lengths, diameters, friction coefficients etc. which we do not have.

Again in our real world problem input data or parameters are often fuzzy or imprecise because of incomplete or non-obtainable information. Traditional mathematical programming techniques, obviously, can not solve this type of problem. Here the demands, sources are characterized as triangular fuzzy number (TFN). First these model have been converted into deterministic ones via the ranking function of the fuzzy numbers with respect to their total integral values and maximum entropy technique developed in the previous section can successfully used in determining the flow rate.

5. Small Looped Water Network Problem

Consider a looped water supply network Fig-2 with 7 nodes and 8 pipes whose source and demand are triangular fuzzy number. Note Fig-2 shows the connectivity of the system and the flow direction in each pipe but does not give any data for the individual pipes. If the network were branched we would have no difficulty in calculating the flow rates in the pipes of the branched system. We could simply work backwards along each branch accumulating demand quantities as flow rates until we reach the single source. Let [Q.sub.i] be the assumed flow rate([m.sup.3]/hour) through i th pipe (i = 1, 2,..., 8). Then we have equations

[Q.sub.1] = (1060, 1120, 1200)

[Q.sub.2] + [Q.sub.3] = (940, 1020, 1110)

[Q.sub.2] - [Q.sub.7] = (90, 100, 110)

[Q.sub.8] + [Q.sub.6] = (190, 200, 210)

[Q.sub.5] - [Q.sub.6] = (320, 330, 340)

[Q.sub.3] - [Q.sub.4] - [Q.sub.5] = (110, 120, 130)

[Q.sub.4] + [Q.sub.7] - [Q.sub.8] = (260, 270, 290) (18)

First convert this model into crisp one by (6). Which gives

[Q.sub.1] = 1090 + 70[lambda]

[Q.sub.2] + [Q.sub.3] = 980 + 85[lambda]

[Q.sub.2] - [Q.sub.7] = 95 + 10[lambda]

[Q.sub.8] + [Q.sub.6] = 195 + 10[lambda]

[Q.sub.5] - [Q.sub.6] = 325 + 10[lambda]

[Q.sub.3] - [Q.sub.4] - [Q.sub.5] = 115 + 10[lambda]

[Q.sub.4] + [Q.sub.7] - [Q.sub.8] = 265 + 15[lambda] (19)

All input and output flow rates have also been scaled by appropriate factor of (980 + 85[lambda]) and using (17) we find the least biased estimation of the pipe flow rate for different values of [lambda]

6. Conclusion

For large engineering systems such as pipe line networks, traffic networks etc, complete and accurate data is rarely available and often the calculated performance depends upon'engineering judgements' in supplying guesses at values for data items in order to be able to use existing computer programs. Again in our real world problem input data or parameters are often fuzzy or imprecise because of incomplete or non-obtainable information. Traditional mathematical programming techniques, obviously, can not solve this type of problem. Here the demands, sources are characterized as triangular fuzzy number (TFN).

The above the process shown how the entropy measure of uncertainty and the Maximum Entropy Principle can be used to infer least biased results using incomplete data. In the network described we have specified initially the direction of flow and demand, source which are TFN. If the direction of flow is not given we shall consider all possible kinds of direction of the network and estimate the corresponding maximum entropy for each case. We shall select the one which yields the greatest value. Initially the problem has been converted into crisp one by ranking of fuzzy numbers with respect to their integral values and then maximum entropy principle can successfully used in determining the flow rate.

Acknowledgments

The authors are very grateful to the anonymous referees for their valuable suggestions to revised the paper.

References

 E. Alperovits and U. Shamir, Desgin of optimal water distribution system, Water Resources Research 13 (6) (1977), 885-900.

 D. Dubois and H. Prade, System of linear constraint, Fuzzy Sets and Systems 3 (1980), 37-48.

 S. C. Fang, J. R. Rajasekera, and H. S. J. Tsao, Entropy Optimization and Mathematical programming, Kluwer Academic Publisheres, 1997.

 Y. J. Hwang and Lai Ching-Lai, Fuzzy Mathematical Programming (Methods and Application), Springer-Verlag, 1992.

 E. T. Jaynes, Information Theory Statistical Mechanics, John Wiley, New York, (1957).

 A. Kaufmann and M. M. Gupta, Introduction to Fuzzy Arithmetic : Theory and Applications (van Nostrand Reinhold, New York, 1985).

 J. N. Kapur, Maximum Entropy Models in Science and Engineering, Wiley eastern limited.

 T. Liou and M. Wang, Ranking of fuzzy numbers with integral value, Fuzzy Sets and Systems 50 (1992), 247-255.

 C. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois press, London, (1949).

 U. Shamir, Optimal desgin and operation of water distribution system, Water Resources Research 11 (4) (1974), 27-36.

 M. Tribus, Rational Description Decision Design. Pergamon. London, (1969).

 S. G. Tomlin, A kinetic theory of traffic distribution and similar problem, Environment and Planning 1, 221-227.

 A. G. Wilson, Entropy in Urban and Regional Modellings (1970), Pion, London.

 L. A. Zadeh, Fuzzy Sets, Information and Control 8 (1965), 338-353.

 H. J. Zimmermann, Fuzzy programming and linear programming with several objective functions, Fuzzy Sets and Systems 1 (1978), 45-55.

P. Jana*

Department of Mathematics, Scottish Church College 1 & 3 Urquhart Square Calcutta--700 006 India

T. K. Roy and S. K. Mazumder

Department of Mathematics, Bengal Engineering College (D. U.), Howrah--711103., India

Received February 2, 2004, Accepted December 20, 2005.

*E-mail: puspendu_jana@yahoo.com
```[lambda] Flow rate

0 [Q.sub.1] = 1090 [Q.sub.2] = 355.210 [Q.sub.3] = 639.895
[Q.sub.4] = 144.562 [Q.sub.5] = 379.323 [Q.sub.6] = 55.827
[Q.sub.7] = 260.153 [Q.sub.8] = 141.030
0.3 [Q.sub.1] = 1111 [Q.sub.2] = 362.123 [Q.sub.3] = 649.287
[Q.sub.4] = 147.134 [Q.sub.5] = 382.564 [Q.sub.6] = 56.289
[Q.sub.7] = 263.753 [Q.sub.8] = 142.158
0.5 [Q.sub.1] = 1125 [Q.sub.2] = 366.145 [Q.sub.3] = 656.054
[Q.sub.4] = 149.566 [Q.sub.5] = 385.134 [Q.sub.6] = 56.916
[Q.sub.7] = 265.573 [Q.sub.8] = 14.612
0.7 [Q.sub.1] = 1139 [Q.sub.2] = 370.923 [Q.sub.3] = 662.254
[Q.sub.4] = 150.857 [Q.sub.5] = 388.028 [Q.sub.6] = 57.734
[Q.sub.7] = 268.873 [Q.sub.8] = 146.331
1 [Q.sub.1] = 1160 [Q.sub.2] = 377.834 [Q.sub.3] = 672.012
[Q.sub.4] = 153.237 [Q.sub.5] = 391.985 [Q.sub.6] = 58.152
[Q.sub.7] = 271.904 [Q.sub.8] = 147.876

Table: 1 / Flow rate for different values of [lambda]
```
COPYRIGHT 2007 Aletheia University
No portion of this article can be reproduced without the express written permission from the copyright holder.