# A Mathematical Model for Fuzzyp-Median Problem with Fuzzy Weights and Variables

Authors: Fatemeh Taleshian; Jafar Fathali
Journal: Advances in Operations Research
 (2016)

---

## Abstract

We investigate thep-median problem with fuzzy variables and weights of vertices. The fuzzy equalities and inequalities transform to crisp cases by using some technique used in fuzzy linear programming. We show that the fuzzy objective function also can be replaced by crisp functions. Therefore an auxiliary linear programming model is obtained for the fuzzy p-median problem. The results are compared with two previously proposed methods.


---

## Body

## 1. Introduction

Location theory is an important topic in the fields of transportation and communication. Thep-median problem is a classic problem in this line of investigation which consists of locating p facilities to cover the given demands such that the total transportation cost is minimized.In the graph version ofp-median problem it is shown that there exists an optimal solution that all the facilities are located at p vertices of the graph and the demand of each vertex will be totally covered by the nearest facility. The p-median problem for arbitrary p in general graphs is NP-hard [1]. For more information about location problems on networks see [2].There are many situations in real world that can be modeled usingp-median problem. In actual cases the amounts of parameters are seldom determined precisely. Hence the parameters are determined with some degree of uncertainty. On the other hand fuzzy set theory is the best tool to illustrate this uncertainty. That is, the amounts of parameters are considered as fuzzy numbers. In the p-median problem, the weight of each point represents the amounts of corresponding customers demand and the aim is to find the p best places for locating p facility center which provide customers demand. Therefore in the problem with ambiguous and uncertain demands, providing the exact amount of customer’s need by facility centers is far from reality. Therefore it is expected that the value of objective function and the amounts of variables be in fuzzy form. However in last researches the exact amounts for objective value and variables were yielded. Thus in this paper we overcome this shortcoming and consider the variables as fuzzy variables.The concept of decision making in fuzzy environment is presented by Bellman and Zadeh [3]. Many authors applied this concept for solving fuzzy linear programming problems. Lai and Hwang [4] provided an auxiliary multiple objective linear programming model to solve a linear programming problem with fuzzy constraint coefficients of objective functions. Recently Allahviranloo et al. [5] solved a full fuzzy linear programming using ranking function and Lotfi et al. [6] solved this kind of models by lexicography method and fuzzy approximate solution. Kumar et al. [7] proposed a new method for finding the fuzzy optimal solution of full fuzzy linear programming with equality constraints. Nasseri et al. [8] considered the case that constraints are in inequality forms and presented a new fuzzy solution for solving full fuzzy linear programming.Many researchers consider the fuzzy location problems. Canós et al. [9] considered the fuzzy p-median problem. They presented a fuzzy formulation to combine the standard minimization of transport costs with an acceptable reduction of the covered demand. Their algorithm considered only slight modifications of the total demand that should be covered and the optimal transport cost associated with it. In [10] the same method applied in a global sense of fuzzy p-median problem. For this problem Canós et al. [11] introduced some marginal analysis techniques to study how solutions depend on membership functions. Moreno-Perez et al. [12] considered some location problems with fuzzy weights and lengths and presented methods to solve them. Kutangila-Mayoya and Verdegay [13] proposed a formulation to find optimal solution for the p-median problem in a fuzzy environment when data related to the node demands and the edge distances are imprecise and uncertain. Many other fuzzy location problems are studied by authors (e.g., see [14, 15]).In this paper we consider thep-median problem where the demands of clients and variables are fuzzy numbers and fuzzy variables, respectively. We show the fuzzy model can be transformed to a crisp linear programming. Our method is the extended method of Lai and Hwang [4]. Their model was linear programming and we extend the method for mixed integer programming problem and apply it for the p-median problem.In what follows in this paper the model of crispp-median and some basic definitions and arithmetics between two triangular fuzzy numbers are reviewed in Section 2. In Section 3 the fuzzy model is converted to a linear programming model. To illustrate the proposed method, numerical examples are solved and the obtained results are discussed and compared with two other methods in Section 4.


## 2. Preliminaries

In this section the crisp model ofp-median problem and some necessary notions of fuzzy set theory are reviewed.


### 2.1. The Crispp-Median Model

LetV={v1,…,vn} be n existing points. Each point vj has a nonnegative weight wj, usually called the demand at vj, and dij is the distance between points vi and vj. The p-median problem asks to select p facilities of these n points such that the sum of the weighted distances of the existing points to the closest facility is minimized.The first integer linear programming for thep-median problem was presented by ReVelle and Swain [16]. A general integer programming for this problem can be written as follows.Letxij be the demand of customer in point vj which provide by facility in vi and(1)yi=1if  pointviis  selected  as  a  facility0otherwiseand then the model can be written as follows:(2)P1minz=∑j=1n∑i=1ndijxijs.t.∑i=1nxij=wjj=1,…,n∑i=1nyi=pxij≤yiwji=1,…,nj=1,…,nyi∈0,1i=1,…,nxij≥0i=1,…,nj=1,…,n.


### 2.2. Fuzzy Backgrounds and Notations

Definition 1 (see [17]).
LetA~=a1,a2,a3 and B~=b1,b2,b3 be two triangular fuzzy numbers and then the fuzzy operators are defined as follows: (1)
A~⊕B~=〈a1+b1,a2+b2,a3+b3〉.(2)
A~≃B~ if and only if a1=b1, a2=b2, and a3=b3.(3)
A~≳0 if and only if a1≥0.Definition 2 (see [18]).
LetF(R) be a set of fuzzy numbers defined on set of real numbers. A ranking function is a function R:F(R)→R which maps each fuzzy number into the real line, where a natural order exists.In this paper we use the following ranking function:(3)Ra,b,c=14a+2b+c.Remark 3 (see [18]).
An inequality of fuzzy numbersX~≲A~ can be transformed to equality, by adding fuzzy numbers S~ and T~ to the left and right sides of inequality, respectively; that is, (4)X~⊕S~=A~⊕T~,where R(S~)-R(T~)≥0.


## 2.1. The Crispp-Median Model

LetV={v1,…,vn} be n existing points. Each point vj has a nonnegative weight wj, usually called the demand at vj, and dij is the distance between points vi and vj. The p-median problem asks to select p facilities of these n points such that the sum of the weighted distances of the existing points to the closest facility is minimized.The first integer linear programming for thep-median problem was presented by ReVelle and Swain [16]. A general integer programming for this problem can be written as follows.Letxij be the demand of customer in point vj which provide by facility in vi and(1)yi=1if  pointviis  selected  as  a  facility0otherwiseand then the model can be written as follows:(2)P1minz=∑j=1n∑i=1ndijxijs.t.∑i=1nxij=wjj=1,…,n∑i=1nyi=pxij≤yiwji=1,…,nj=1,…,nyi∈0,1i=1,…,nxij≥0i=1,…,nj=1,…,n.


## 2.2. Fuzzy Backgrounds and Notations

Definition 1 (see [17]).
LetA~=a1,a2,a3 and B~=b1,b2,b3 be two triangular fuzzy numbers and then the fuzzy operators are defined as follows: (1)
A~⊕B~=〈a1+b1,a2+b2,a3+b3〉.(2)
A~≃B~ if and only if a1=b1, a2=b2, and a3=b3.(3)
A~≳0 if and only if a1≥0.Definition 2 (see [18]).
LetF(R) be a set of fuzzy numbers defined on set of real numbers. A ranking function is a function R:F(R)→R which maps each fuzzy number into the real line, where a natural order exists.In this paper we use the following ranking function:(3)Ra,b,c=14a+2b+c.Remark 3 (see [18]).
An inequality of fuzzy numbersX~≲A~ can be transformed to equality, by adding fuzzy numbers S~ and T~ to the left and right sides of inequality, respectively; that is, (4)X~⊕S~=A~⊕T~,where R(S~)-R(T~)≥0.


## 3. Fuzzy Models

Letx~ij=〈xij1,xij2,xij3〉 and w~ij=〈wij1,wij2,wij3〉 be triangular fuzzy numbers corresponding to xij and wij, respectively. Then the fuzzy model of (P1) can be written as follows:(5)P2min∑j=1n∑i=1ndijxij1,xij2,xij3(6)s.t.∑i=1nxij1,xij2,xij3≃wij1,wij2,wij3j=1,…,n∑i=1nyi=pxij1,xij2,xij3≲yiwij1,wij2,wij3i=1,…,nj=1,…,nyi∈0,1i=1,…,nxij1≥0i=1,…,nj=1,…,n.LetX~=[x~ij]n×n and Y=[yi]n×n. Then [X~,Y] is the optimal solution of problem (P2) if it satisfies the following characteristics:(1)
X~ is a nonnegative fuzzy number.(2)
X~ and Y satisfy conditions (6).(3)
If there exist any nonnegative fuzzy numberX~′ and a vector Y′ such that they satisfy conditions (6), then (7)R∑j=1n∑i=1ndijxij1,xij2,xij3≤R∑j=1n∑i=1ndijxij1′,xij2′,xij3′.Model(P2) can be transformed to a crisp model by the following steps.Step 1.
Letzijk=dijxijk and vijk=yiwjk for i,j=1,…,n and k=1,2,3; then model (P2) is converted to the following model: (8)P3min∑j=1n∑i=1nzij1,zij2,zij3(9)s.t.∑i=1nxij1,xij2,xij3≃wij1,wij2,wij3j=1,…,n(10)∑i=1nyi=p(11)xij1,xij2,xij3≲vij1,vij2,vij3i=1,…,nj=1,…,n(12)yi∈0,1i=1,…,n.(13)xij1≥0i=1,…,nj=1,…,n.Step 2.
Using Remark3, by adding fuzzy variables s~ij=〈sij1,sij2,sij3〉 and t~ij=〈tij1,tij2,tij3〉 for i=1,…,nj=1,…,n inequality (11) can be replaced by the following equalities:(14)xij1,xij2,xij3⊕sij1,sij2,sij3=vij1,vij2,vij3⊕tij1,tij2,tij3Rs~ij-Rt~ij≥0.Step 3.
With definition of fuzzy operators, the fuzzy equalities can be replaced by crisp equalities. Then the model can be written as follows:(15)P4min∑j=1n∑i=1nzij1,zij2,zij3s.t.∑i=1nxij1=wij1j=1,…,n∑i=1nxij2=wij2j=1,…,n∑i=1nxij3=wij3j=1,…,n∑i=1nyi=pxij1+sij1=vij1+tij1i=1,…,nj=1,…,nxij2+sij2=vij2+tij2i=1,…,nj=1,…,nxij3+sij3=vij3+tij3i=1,…,nj=1,…,nsij1+2sij2+sij3-tij1+2tij2+tij3≥0i=1,…,nj=1,…,nxij1≥0,xij2-xij1≥0,xij3-xij2≥0i=1,…,nj=1,…,nsij2-sij1≥0,sij3-sij2≥0i=1,…,nj=1,…,ntij2-tij1≥0,tij3-tij2≥0i=1,…,nj=1,…,nyi∈0,1i=1,…,n.In the following steps we consider the objective function of model(P4) and convert model to a crisp model by using the method of Lai and Hwang [4].Step 4.
Consider the following objective function:(16)min∑j=1n∑i=1nzij1,zij2,zij3.We have(17)∑j=1n∑i=1nzij1,zij2,zij3=∑j=1n∑i=1nzij1,∑j=1n∑i=1nzij2,∑j=1n∑i=1nzij3in which ∑j=1n∑i=1nzij1 is the most possible value and ∑j=1n∑i=1nzij2 and ∑j=1n∑i=1nzij3 are the least possible values. This fuzzy objective is fully defined by three corner points geometrically. Thus, minimizing the fuzzy objective can be obtained by pushing these three critical points in the direction of the left-hand side (see Figure 1). Therefore the objective function can be replaced by the following auxiliary functions:(18)z1=max⁡∑j=1n∑i=1nzij2-zij1,z2=min⁡∑j=1n∑i=1nzij2,z3=min⁡∑j=1n∑i=1nzij3-zij2.The three new objectives also guarantee the previous argument of pushing the triangular possibility distribution in the direction of the left-hand side.Figure 1
Objective function in Step4.Step 5.
LetF be the set of feasible solutions of model (P4). Consider the Positive Ideal Solutions (PIS) and Negative Ideal Solutions (NIS) of the three objective functions as follows:(19)z1PIS=max⁡∑j=1n∑i=1nzij2-zij1,X~,Y∈F,z1NIS=min⁡∑j=1n∑i=1nzij2-zij1,X~,Y∈F,z2PIS=min⁡∑j=1n∑i=1nzij2,X~,Y∈F,z2NIS=max⁡∑j=1n∑i=1nzij2,X~,Y∈F,z3PIS=min⁡∑j=1n∑i=1nzij3-zij2,X~,Y∈F,z3NIS=max⁡∑j=1n∑i=1nzij3-zij2,X~,Y∈F.Then the linear membership function of the objective functions can be computed as follows: (20)μz1=1ifz1>z1PISz1NIS-z1z1NIS-z1PISifz1NIS≤z1≤z1PIS0ifz1<z1NIS,and for k=2,3, (21)μzk=1ifzk<zkPISzkNIS-zkzkNIS-zkPISifzkPIS≤zk≤zkNIS0ifzk>zkNIS.Now we solve the following equivalent single-objective linear programming model introduced by Zimmermann [19]: (22)P5maxαs.t.μzk≥αk=1,2,3∑i=1nxij1=wij1j=1,…,n∑i=1nxij2=wij2j=1,…,n∑i=1nxij3=wij3j=1,…,n∑i=1nyi=pxij1+sij1=vij1+tij1i=1,…,nj=1,…,nxij2+sij2=vij2+tij2i=1,…,nj=1,…,nxij3+sij3=vij3+tij3i=1,…,nj=1,…,nsij1+2sij2+sij3-tij1+2tij2+tij3≥0i=1,…,nj=1,…,nxij1≥0,xij2-xij1≥0,xij3-xij2≥0i=1,…,nj=1,…,nsij2-sij1≥0,sij3-sij2≥0i=1,…,nj=1,…,ntij2-tij1≥0,tij3-tij2≥0i=1,…,nj=1,…,nyi∈0,1i=1,…,n.


## 4. Comparing with Other Methods and Numerical Examples

In this section we compare our method with the methods of Nasseri et al. [8] and Moreno-Perez et al. [12] and use our method to solve some test problems.First to compare our method with Nasseri et al. [8], we should mention that they used the following ranking for defuzzification fuzzy constraints:(23)b1,b2,b3≤a1,a2,a3ifb1≤a1,b2≤a2,b3≤a3.Their method is not always able to presented correct ranking. It is clear that their method is not able to rank the following two fuzzy numbers:A=〈1,2,3〉 and B=〈0.99,200,201〉. In this paper we deal with this problem. By adding fuzzy variable, each fuzzy inequality constraint reduces to equality form. Then each fuzzy equality constraint transforms to three constraints with constant coefficients as follows: (24)b1,b2,b3⊕sij1,sij2,sij3=a1,a2,a3⊕tij1,tij2,tij3,where R(s~ij)-R(t~ij)≤0.Second to compare our method with method of Moreno-Perez et al. [12], in the following example, first we solve the crisp case and then explain our method to solve the problem with fuzzy weights and variables. Finally we solve the fuzzy model by method of Moreno-Perez et al. [12] and compare their results with those obtained by our method.Example 1.
Consider a problem of finding two medians of five existing points on the plane. The coordinates of existing facilities and corresponding demands are given in Table1.
Using the Euclidean distance the distance matrix of these points is obtained as follows:(25)D=06.3245.65610.8169.2196.32402.82858.0625.6562.82805.3855.38510.81655.38507.6159.2198.0625.3857.6150.
Thus the problem can be formulated as follows:(26)minz=∑j=15∑i=15dijxij=6.324x12+5.656x13+10.816x14+9.219x15+6.324x21+2.828x23+5x24+8.062x25+5.656x31+2.828x32+5.385x34+5.385x35+10.816x41+5x42+5.385x43+7.615x45+9.219x51+8.062x52+5.385x53+7.615x54s.t.∑i=15xi1=5∑i=15xi2=8∑i=15xi3=7∑i=15xi4=12∑i=15xi5=15∑i=15yi=1xij≤yiwji=1,…,5j=1,…,5yi∈0,1i=1,…,5.
By solving this problem the value of objective function and the amounts of variables are obtained as follows:(27)Z∗=111.422,y2=y5=1,x12=5,x22=8,x32=7,x42=12,x55=15.
Now suppose that the corresponding demands are all triangular fuzzy numbers as shown in Table2.
The fuzzy model is as follows:(28)minz=∑j=15∑i=15dijx1ij,x2ij,x3ij=6.324x112,x212,x312+5.656x113,x213,x313+10.816x114,x214,x314+9.219x115,x215,x315+6.324x121,x221,x321+2.828x123,x223,x323+5x124,x224,x324+8.062x125,x225,x325+5.656x131,x231,x331+2.828x132,x232,x332+5.385x134,x234,x334+5.385x135,x235,x335+10.816x141,x241,x341+5x142,x242,x342+5.385x143,x243,x343+7.615x145,x245,x345+9.219x151,x251,x351+8.062x152,x252,x352+5.385x153,x253,x353+7.615x154,x254,x354s.t.∑i=15x1i1,x2i1,x3i1=4,5,6,∑i=15x1i2,x2i2,x3i2=6.5,8,10∑i=15x1i3,x2i3,x3i3=5,7,8,∑i=15x1i4,x2i4,x3i4=11.5,12,13∑i=15x1i5,x2i5,x3i5=14,15,15.5,∑i=15yi=1x1ij,x2ij,x3ij≤yiw1j,w2j,w3ji=1,…,5j=1,…,5yi∈0,1i=1,…,5.
By adding the fuzzy variables〈s1ij,s2ij,s3ij〉 and 〈t1ij,t2ij,t3ij〉 for i,j=1,…,5 and replacing yi〈w1j,w2j,w3j〉 by 〈v1ij,v2ij,v3ij〉 for i,j=1,…,5, the constraints are reduced to the following:(29)∑i=15x1i1=4,∑i=15x2i1=5,∑i=15x3i1=6,∑i=15x1i2=6.5,∑i=15x2i2=8,∑i=15x3i2=10,∑i=15x1i3=5,∑i=15x2i3=7,∑i=15x3i3=8,∑i=15x1i4=11.5,∑i=15x2i4=12,∑i=15x3i4=13,∑i=15x1i5=14,∑i=15x2i5=15,∑i=15x3i5=15.5,∑i=15yi=1,x1ij+s1ij=v1ij+t1ij,i,j=1,…,5x2ij+s2ij=v2ij+t2ij,i,j=1,…,5x3ij+s3ij=v3ij+t3ij,i,j=1,…,5s1ij,s2ij,s3ij-t1ij,t2ij,t3ij≥0,i,j=1,…,5x1ij≥0,x2ij-x1ij≥0,x3ij-x2ij≥0,i,j=1,…,5s2ij-s1ij≥0,s3ij-s2ij≥0,i,j=1,…,5t2ij-t1ij≥0,t3ij-t2ij≥0,i,j=1,…,5yi∈0,1i=1,…,5.
The objective function also can be transformed to the following tree crisp objective functions:(30)maxz1=∑j=15∑i=15z2ij-z1ij,minz2=∑j=15∑i=15z2ij,minz3=∑j=15∑i=15z3ij-z2ij,where (31)z1=6.324x212-x112+5.656x213-x113+10.816x214-x114+9.219x215-x115+6.324x221-x121+2.828x223-x123+5x224-x124+8.062x225-x125+5.656x231-x131+2.828x232-x132+5.385x234-x134+5.385x235-x135+10.816x241-x141+5x242-x142+5.385x243-x143+7.615x245-x145+9.219x251-x151+8.062x252-x152+5.385x253-x153+7.615x254-x154,z2=6.324x212+5.656x213+10.816x214+9.219x215+6.324x221+2.828x223+5x224+8.062x225+5.656x231+2.828x232+5.385x234+5.385x235+10.816x241+5x242+5.385x243+7.615x245+9.219x251+8.062x252+5.385x253+7.615x254,z3=6.324x312-x212+5.656x313-x213+10.816x314-x214+9.219x315-x215+6.324x321-x221+2.828x323-x223+5x324-x224+8.062x325-x225+5.656x331-x231+2.828x332-x232+5.385x334-x234+5.385x335-x235+10.816x341-x241+5x342-x242+5.385x343-x243+7.615x345-x245+9.219x351-x251+8.062x352-x252+5.385x353-x253+7.615x354-x254.
LetS be the set of feasible solutions for the recent model. The Positive Ideal Solution and the Negative Ideal Solution for each of these functions are obtained the same as Step 5, for n=5.
By solving the obtained problems, we will find the following values:(32)Z1NIS=12.32,Z1PIS=47.255,Z2NIS=418,Z2PIS=111.422,Z3NIS=46.427,Z3PIS=11.86. Then the linear membership functions of them are obtained as follows:(33)μ1v=1ifz1>47.255z1-12.3234.935if12.32≤z1≤47.2550ifz1<12.32,μ2v=1ifz2<111.422418-z2306.578if111.422≤z2≤4180ifz2>418,μ3v=1ifz3<11.8646.627-z334.567if11.86≤z3≤46.4270ifz3>46.427.
Using model(P5) it follows that the minimum degree of satisfaction α for this example is equal to 0.904 and y2=y5=1. So the facilities should be located at points 2 and 5. The fuzzy optimal solution X~ obtained by solving the model is as follows:(34)x~11=0,0,0,x~12=0,0,0,x~13=0,0,0,x~14=0,0,0,x~15=0,0,0,x~21=4,4,6,x~22=6.5,6.5,8.5,x~23=5,5,6,x~24=11.5,11.52,12.52,x~25=0,1,1,x~31=0,0,0,x~32=0,0,0,x~33=0,0,0,x~34=0,0,0,x~35=0,0,0,x~41=0,0,0,x~42=0,0,0,x~43=0,0,0,x~44=0,0,0,x~45=0,0,0,x~51=0,1,1,x~52=0,1.5,1.5,x~53=0,2,2,x~54=0,0.48,0.48,x~55=14,14,14.5.
Now suppose that the above problem is solved using the method of Moreno-Perez et al. [12]. Based on their method the fuzzy weights are transformed to crisp weights by applying third index of Yager; that is, the triangular fuzzy weight w~j=〈w1j,w2j,w3j〉 is transformed to (1/4)(w1j+2w2j+w3j). Therefore the crisp weights are as follows:(35)w1′=5,w2′=8.125,w3′=6.75,w4′=12.125,w5′=14.875.
After solving the problem with these new weights the value of objective function and the amounts of variables will be obtained as follows:(36)z∗=111.340,y2=1,y5=1,x12=5,x22=8.125,x32=6.75,x42=12.125,x55=14.875.
As it is clear based on their method a lot of information of problem is lost. Also they obtained crisp amount for objective value and variables. It is very unrealistic that the optimal value of fuzzy problem is obtained as real constant amount. However based on our method the fuzzy objective value and fuzzy amount for variables are yielded. Obviously our method presented realistic and effectiveness results. Therefore the decision maker is able to get the best decision based on the possibilities and circumstances.Table 1
The coordinates and demands of existing facilities for Example1.
j
a
j
1
a
j
2
w
j
1
1
1
5
2
3
7
8
3
5
5
7
4
7
10
12
5
10
3
15Table 2
The fuzzy weights of demand points.
j
1
2
3
4
5
w
~
j
=
w
1
j
,
w
2
j
,
w
3
j
〈
4,5
,
6
〉
〈
6.5,8
,
10
〉
〈
5,7
,
8
〉
〈
11.5,12,13
〉
〈
14,15,15.5
〉Example 2.
As the second example we consider the first test problem (p-median instances) from the ORLIB library which is composed of a graph with 100 nodes and 200 edges; see Beasley [20]. A number of medians are supposed to be p=5 and the fuzzy demands of vertices are given in Table 3.
By applying our new proposed method it yields thatα=0.911 and y4=y8=y10=y23=y42=1, which means the vertices 4,8,10,23, and 42 should be chosen as the location of facilities. Also the fuzzy objective is obtained as 〈125944,170330,180999.56〉. Tables 4–8 presented how the facility centers are provided the demands of customers.Table 3
The demands of existing facilities for Example2.
W
1
=
23,24,25
W
2
=
〈
9,10,10.5
〉
W
3
=
〈
16.5,17.5,18
〉
W
4
=
19,20,21
W
5
=
〈
8,9
,
9.5
〉
W
6
=
〈
18.5,20,21
〉
W
7
=
11,11.5,12
W
8
=
〈
18,19,20
〉
W
9
=
〈
14,15,16.5
〉
W
10
=
4,5
,
6
W
11
=
〈
21,22,23
〉
W
12
=
〈
21,22,23
〉
W
13
=
17.5,18.5,19.5
W
14
=
〈
8,9
,
10
〉
W
15
=
〈
25,26,27
〉
W
16
=
11,11.5,12.5
W
17
=
〈
6,7
,
8
〉
W
18
=
〈
19,20,21
〉
W
19
=
4.5,5.5,6
W
20
=
〈
4.5,5.5,6.5
〉
W
21
=
〈
26,27,28
〉
W
22
=
9,10,11
W
23
=
〈
19,20,21
〉
W
24
=
〈
9,10,11
〉
W
25
=
11,12,13
W
26
=
〈
3,4
,
4.5
〉
W
27
=
〈
22,23,24
〉
W
28
=
14.5,15,16
W
29
=
〈
7,7.5,9
〉
W
30
=
〈
27,28,29
〉
W
31
=
19.5,20,21
W
32
=
〈
14,15,16
〉
W
33
=
〈
9.5,10,11
〉
W
34
=
5,6
,
7
W
35
=
〈
12,13,14
〉
W
36
=
〈
29,30,31
〉
W
37
=
25,26,27
W
38
=
〈
13,14,15
〉
W
39
=
〈
6.5,7.5,8.5
〉
W
40
=
9,10,11
W
41
=
〈
19,20,21
〉
W
42
=
〈
7.5,8.5,9.5
〉
W
43
=
12,13,14
W
44
=
〈
21,22,23
〉
W
45
=
〈
18,19,20
〉
W
46
=
6,7
,
8
W
47
=
〈
30.5,31,32
〉
W
48
=
〈
10.5,12,13
〉
W
49
=
9.5,11,12
W
50
=
〈
9.5,10,11
〉
W
51
=
〈
24,25,26
〉
W
52
=
19.5,20,21
W
53
=
〈
18.5,19.5,20.5
〉
W
54
=
〈
12,13,14
〉
W
55
=
〈
4.5,5
,
5.5
〉
W
56
=
〈
16.5,17,18
〉
W
57
=
〈
19.5,20,21
〉
W
58
=
〈
7.5,9
,
10.5
〉
W
59
=
〈
26,27,28
〉
W
60
=
〈
10,11,12
〉
W
61
=
〈
8.5,9
,
9.5
〉
W
62
=
〈
22,23,24
〉
W
63
=
〈
19,20,21
〉
W
64
=
〈
30,31,32
〉
W
65
=
〈
29.5,30,31
〉
W
66
=
〈
12,13,14
〉
W
67
=
〈
4,5
,
6
〉
W
68
=
〈
14,15,16
〉
W
69
=
〈
14,15,16
〉
W
70
=
〈
10,11,12
〉
W
71
=
〈
20,21,22
〉
W
72
=
〈
27.5,28.5,29
〉
W
73
=
〈
9,10,11
〉
W
74
=
〈
14,15,15.5
〉
W
75
=
〈
30,31,32.5
〉
W
76
=
〈
8.5,9
,
10
〉
W
77
=
〈
19,20,21
〉
W
78
=
〈
6.5,7
,
8.5
〉
W
79
=
〈
11,12,13
〉
W
80
=
〈
20,21,22
〉
W
81
=
〈
8.5,9.5,10
〉
W
82
=
〈
14.5,15,16.5
〉
W
83
=
〈
25,26,27
〉
W
84
=
〈
23,24,25
〉
W
85
=
〈
20,21,22
〉
W
86
=
〈
20.5,11,12
〉
W
87
=
16.5,17.5,19
W
88
=
〈
14,15,16.5
〉
W
89
=
〈
30,31,32
〉
W
90
=
27,28,29
W
91
=
〈
9.5,10.5,11.5
〉
W
92
=
〈
9.5,7.5,8
〉
W
93
=
〈
16,17,18
〉
W
94
=
〈
18,19,20
〉
W
95
=
〈
8.5,9.5,10
〉
W
96
=
〈
12.5,13,14
〉
W
97
=
〈
4,5
,
6
〉
W
98
=
〈
28,29,30
〉
W
99
=
〈
18.5,19,20
〉
W
100
=
〈
7.5,8.5,9
〉Table 4
Fuzzy numbers of assignment facility 4 to the customers for Example2.
Facility number 4
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
2
〈
9,9
,
9.5
〉
3
〈
16.5,16.5,16.5
〉
4
〈
19,19,20
〉
5
〈
8,8
,
8
〉
6
〈
18.5,18.5,18.5
〉
7
〈
5.95,5.95,5.95
〉
14
〈
8,8
,
8
〉
15
〈
25,25,25
〉
16
〈
11,11,11
〉
19
〈
4.5,4.5,4.5
〉
20
〈
4.5,4.5,4.5
〉
24
〈
0,0
,
1
〉
26
〈
3,3
,
3
〉
27
〈
22,22,23
〉
28
〈
14.5,14.5,15.5
〉
31
〈
0,0
,
1
〉
33
〈
9.5,9.5,10.5
〉
34
〈
5,5
,
6
〉
35
〈
12,12,13
〉
37
〈
0,0
,
1
〉
45
〈
18,18,19
〉
46
〈
0,0
,
1
〉
48
〈
0,0
,
1
〉
49
〈
0,0
,
1
〉
50
〈
9.5,9.5,10.5
〉
52
〈
0,0
,
1
〉
58
〈
0,0
,
1.5
〉
59
〈
26,26,27
〉
60
〈
10,10,11
〉
62
〈
22,22,23
〉
63
〈
19,19,19
〉
65
〈
29.5,29.5,29.5
〉
67
〈
4,4
,
5
〉
68
〈
14,14,15
〉
71
〈
0,0
,
1
〉
72
〈
27.5,27.5,28
〉
73
〈
9,9
,
10
〉
76
〈
8.5,8.5,9.5
〉
77
〈
19,19,19
〉
78
〈
6.5,6.5,8
〉
79
〈
11,11,12
〉
80
〈
20,20,20
〉
84
〈
0,0
,
1
〉
87
〈
16.5,16.5,16.5
〉
88
〈
14,14,15.5
〉
89
〈
30,30,31
〉
90
〈
27,27,28
〉
91
〈
9.5,9.5,10.5
〉
92
〈
6.5,6.5,7
〉
94
〈
18,18,19
〉
96
〈
12.5,12.5,13.5
〉
97
〈
4,4
,
5
〉
98
〈
0,0
,
1
〉
99
〈
0,0
,
1
〉Table 5
Fuzzy numbers of assignment facility 8 to the customers for Example2.
Facility number 8
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
1
〈
23,23,24
〉
3
〈
0,0
,
0.5
〉
5
〈
0,0
,
0.5
〉
6
〈
0,0
,
1
〉
7
〈
5.05,5.05,5.05
〉
8
〈
18,18,19
〉
9
〈
14,14,14
〉
14
〈
0,0
,
1
〉
16
〈
0,0
,
1
〉
18
〈
19,19,20
〉
19
〈
0,0
,
0.5
〉
21
〈
0,0
,
1
〉
26
〈
3,3
,
3
〉
27
〈
26,26,26
〉
22
〈
9,9
,
10
〉
26
〈
0,0
,
0.5
〉
29
〈
7,7
,
8.5
〉
32
〈
14,14,15
〉
38
〈
13,13,13
〉
39
〈
6.5,6.5,7.5
〉
48
〈
10.5,10.5,10.5
〉
49
〈
9.5,9.5,9.5
〉
51
〈
24,24,24
〉
52
〈
19.5,19.5,19.5
〉
53
〈
18.5,18.5,19.5
〉
61
〈
8.5,8.5,8.5
〉
63
〈
0,0
,
1
〉
64
〈
30,30,31
〉
65
〈
0,0
,
1
〉
66
〈
12,12,13
〉
71
〈
20,20,20
〉
74
〈
14,14,14.5
〉
75
〈
30,30,30
〉
80
〈
0,0
,
1
〉
82
〈
14.5,14.5,16
〉
83
〈
25.5,25.5,26
〉
86
〈
0,0
,
1
〉
93
〈
16,16,16
〉
95
〈
8.5,8.5,8.5
〉
98
〈
28,28,28
〉
99
〈
18.5,18.5,18.5
〉Table 6
Fuzzy numbers of assignment facility 10 to the customers for Example2.
Facility number 10
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
4
〈
0,1
,
1
〉
5
〈
0,1
,
1
〉
6
〈
0,1.5,1.5
〉
7
〈
0,0.5,0.5
〉
9
〈
0,0
,
1.5
〉
10
〈
4,4
,
5
〉
11
〈
21,21,22
〉
15
〈
0,0
,
1
〉
16
〈
0,0.5,0.5
〉
17
〈
0,1
,
1
〉
18
〈
0,1
,
1
〉
19
〈
0,1
,
1
〉
20
〈
0,1
,
1
〉
21
〈
0,1
,
1
〉
22
〈
0,1
,
1
〉
23
〈
0,1
,
1
〉
24
〈
0,1
,
1
〉
25
〈
0,1
,
1
〉
26
〈
0,1
,
1
〉
27
〈
0,1
,
1
〉
28
〈
0,0.5,0.5
〉
30
〈
0,1
,
1
〉
32
〈
0,1
,
1
〉
33
〈
0,0.5,0.5
〉
34
〈
0,1
,
1
〉
35
〈
0,1
,
1
〉
36
〈
29,29,29
〉
37
〈
25,25,25
〉
38
〈
0,1
,
1
〉
39
〈
0,1
,
1
〉
40
〈
0,1
,
1
〉
41
〈
0,1
,
1
〉
43
〈
0,1
,
1
〉
45
〈
0,1
,
1
〉
46
〈
0,1
,
1
〉
47
〈
0,0.5,0.5
〉
52
〈
0,0.5,0.5
〉
53
〈
0,1
,
1
〉
54
〈
0,1
,
1
〉
55
〈
0,0.5,0.5
〉
56
〈
0,0.5,0.5
〉
57
〈
0,0.5,0.5
〉
58
〈
0,1.5,1.5
〉
59
〈
0,1
,
1
〉
60
〈
0,1
,
1
〉
61
〈
0,0.5,0.5
〉
62
〈
0,1
,
1
〉
63
〈
0,1
,
1
〉
64
〈
0,1
,
1
〉
65
〈
0,0.5,0.5
〉
66
〈
0,1
,
1
〉
71
〈
0,1
,
1
〉
72
〈
0,1
,
1
〉
74
〈
0,1
,
1
〉
75
〈
0,1
,
1
〉
76
〈
0,0.5,0.5
〉
77
〈
0,1
,
1
〉
78
〈
0,0.5,0.5
〉
80
〈
0,1
,
1
〉
81
〈
0,1
,
1
〉
82
〈
0,0.5,0.5
〉
83
〈
00,0.5,0.5
〉
86
〈
0,0.5,0.5
〉
87
〈
0,1
,
1
〉
88
〈
0,1
,
1
〉
89
〈
0,1
,
1
〉
90
〈
0,1
,
1
〉
91
〈
0,1
,
1
〉
92
〈
0,1
,
1
〉
93
〈
0,1
,
1
〉
94
〈
0,1
,
1
〉
95
〈
0,1
,
1
〉
96
〈
0,0.5,0.5
〉
97
〈
0,1
,
1
〉
98
〈
0,1
,
1
〉Table 7
Fuzzy numbers of assignment facility 23 to the customers for Example2.
Facility number 23
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
1
〈
0,1
,
1
〉
2
〈
0,1
,
1
〉
2
〈
0,1
,
1
〉
3
〈
0,1
,
1
〉
8
〈
0,1
,
1
〉
9
〈
0,1
,
1
〉
10
〈
0,1
,
1
〉
11
〈
0,1
,
1
〉
12
〈
0,1
,
1
〉
13
〈
0,1
,
1
〉
14
〈
0,1
,
1
〉
15
〈
0,1
,
1
〉
17
〈
0,0
,
0.126
〉
21
〈
0,0
,
1
〉
23
〈
19,19,20
〉
24
〈
9,9
,
9
〉
25
〈
11,11,12
〉
26
〈
0,1
,
1
〉
29
〈
0,0.5,0.5
〉
31
〈
0,0.5,0.5
〉
36
〈
0,1
,
1
〉
37
〈
0,1
,
1
〉
42
〈
0,1
,
1
〉
44
〈
0,1
,
1
〉
48
〈
0,1.5,1.5
〉
49
〈
0,1.5,1.5
〉
50
〈
0,0.5,0.5
〉
51
〈
0,1
,
1
〉
67
〈
0,1
,
1
〉
68
〈
0,1
,
1
〉
69
〈
0,1
,
1
〉
61
〈
0,0.5,0.5
〉
70
〈
0,1
,
1
〉
73
〈
0,1
,
1
〉
75
〈
0,0
,
1.5
〉
79
〈
0,1
,
1
〉
84
〈
0,1
,
1
〉
85
〈
0,1
,
1
〉
99
〈
0,0.5,0.5
〉
100
〈
0,1
,
1
〉Table 8
Fuzzy numbers of assignment facility 42 to the customers for Example2.
Facility number 42
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
Customers
x
i
j
=
〈
x
1
i
j
,
x
2
i
j
,
x
3
i
j
〉
7
〈
0,0
,
0.5
〉
12
〈
21,21,21
〉
13
〈
17.5,17.5,18.5
〉
17
〈
6,6
,
6.874
〉
8
〈
0,1
,
1
〉
9
〈
0,1
,
1
〉
20
〈
0,0
,
1
〉
30
〈
27,27,28
〉
31
〈
19.5,19.5,19.5
〉
36
〈
0,0
,
1
〉
38
〈
0,0
,
1
〉
40
〈
9,9
,
10
〉
41
〈
19,19,20
〉
42
〈
7.5,7.5,8.5
〉
43
〈
12,12,13
〉
44
〈
21,21,22
〉
46
〈
6,6
,
6
〉
47
〈
30.5,30.5,31.5
〉
51
〈
0,0
,
1
〉
54
〈
12,12,13
〉
55
〈
4.5,4.5,5
〉
56
〈
16.5,16.5,17.5
〉
57
〈
19.5,19.5,20
〉
58
〈
7.5,7.5,7.5
〉
61
〈
0,0
,
0.5
〉
69
〈
14,14,15
〉
70
〈
10,10,11
〉
77
〈
0,0
,
1
〉
81
〈
8.5,8.5,9
〉
84
〈
23,23,23
〉
85
〈
20,20,21
〉
86
〈
10.5,10.5,10.5
〉
87
〈
0,0
,
1.5
〉
93
〈
0,0
,
1
〉
95
〈
0,0
,
0.5
〉


## 5. Conclusion

One of the most important facility location problems which is used to model real situations isp-median problem. However in real world problems it is not easy to determine the parameters and data precisely and in some cases it is not possible at all. Hence most of the times the parameters and data are considered by some degree of uncertainty. As fuzzy set theory is a very useful tool to illustrate this ambiguity and uncertainty, in this paper the fuzzy numbers are used to determining uncertain parameters. In this paper the p-median problem with fuzzy data is considered. Since the parameters of the presented model are known as the demands of costumers and variables are the amounts of demands that each customer served by facility centers, it is far from reality that the facilities cover constant amounts of customer’s demands. Thus in this paper the variables are considered as fuzzy variables. Using some technique in fuzzy linear programming the fuzzy model is transformed to a mathematical linear model. By solving the obtained linear programming, fuzzy objective value and fuzzy variables are obtained. Some numerical examples are solved to illustrate the proposed method.



---

*Source: 7590492-2016-04-10.xml*