8

     7 6-9 4

161 -167 :1390 3

2 *1

-1
-2
-3
(1390/08/10 : 1389/12/09 :)

.
.
.

( ) .
.
.

. :

A Combination Model of DEA and Facility Location Model for Important

Facilities Considering Dispersion Principle
M. Karbasian1*, M. Dashti 2, A. R. Asadollahi 3
Department of Industrial Engineering, Malek Ashtar University of Technology
(Received:02/28/2011 , Accepted:11/01/2011 )

Abstract
One of the objectives defined in the facility location problem is the maximum dispersing facility location. In these
issues, the goal is maximizing the distance between the facilities according to the available constraints. In some cases
these issues use the location of radio stations, schools, sales representatives and general location with sensitive
facilities which have much application in passive defense principles. On the other hand, the facilities operating one
principle of passive defense should be dispersed. Therefore, they should be established in a place where they can gain
their mission correctly. As a result, the coefficient errors are reduced. Considering this issue (coefficient of performance and reduced error of candidate points), we suggest Data Envelopment Analysis with the criteria to choosing
locations with efficient distribution model. So, in this paper a new multi-objective model for locating critical and
important facilities considering passive defense principles is presented.

Keywords: Passive Defense, Dispersion Facilities, Data Envelopment Analysis, Fuzzy Goal Programming.

Corresponding author E-mail: mkarbasi@mut-es.ac.ir

Passive Defence Sci. & Tech. 2011,3, 161-167

162

" " 3 1390

.1

.
) (...

.

.


.


.

. )
( :
-1 :1 .
-2 :2


.
-3 :3


) ( .







.



:
Mission
Dispersion
Terrain Pattern

) (
.

.

.2

.
)(


.

]2.[1

.
4
.

. :


. 5


. :

] ..[3
.

]5.[4

6

. 1990

] .[ 6 3
.
Max

. Sum Min
.

Noxious
Obnoxious
6
Erkut, Neuman

163

Sum
Min
. Sum Min
.
Min
. Sum
.

) ( ) (
) ( .
.
. 1-2 MaxMinMin

MaxMinMin
2 .
p
p ]8 .[7

] .[9
.
P
.

].[10
.2-2 MaxSumMin

MaxSumMin .

.
p

] .[7
.
. 3-2

MaxMinSum

MaxMinSum


. 1

Hub Distance

. MaxMinSum
].[7
.4-2

MaxSumSum

. MaxSumSum
MaxMinSum

.

.
p-maxian
p

] .[11

.
.

.

MaxSumMin
) ( .
)
(
.


.


2 .
DEA

.
DEA .

DEA
.

)Data Envelopment Analysis (DEA

164

" " 3 1390

.3
)
(

.

.

]13 .[12

1

2008 ) dr
r (
] .[14
:
n

) max = (1 d r

)(1

r =1

St:
I

)(2

Vri I ir = 1

i =1
J

)(3
)(4
)(5

U rjO jr + d r = 1
j =1

) r , k ( k r

i =1

j =1

U rj O jr Vri I ir 0
j , i , r

U rj , Vri

Ojr j r I ir

i r . Urj dr V ri
r
) (DMU j i r.

.4

Max D k

)(6

2 3




.



.
Klimberg

p n
.
MaxMinMin
.
.
:
} K = {1, . . . , n .
} I = {1, . . . , m )
( .
} J = {1, . . . , s )
( .
:
:dkl k ((k,l) K) .l
:M

:
: Iik i k )(iI, kK
: Ojk j k )(jJ, kK
: P
:
xk ) k
1 (
:ek ) ( k
:Vki i k
:Ukj j k
:Dk k
16 15 14 11 10
.

k =1
n

) Max (1 e k

)(7

k =1

)(8
)(9
)(10

1 k n,

1 k < z n,

St:
Dk Mx k ,

Dk d kz + M (1 xz ),
m

I ik = x k

ki

V
i =1

)(11

)(12

) k ; z(k z

)(13

Ukj Ojk + ek = xk
j =1

i =1

j =1

U kj O jz Vki I iz 0
n

xk = p
k =1

165

)(14
)(15
)(16

j, k

U kj xk

i, k

Vki xk

j, k

U kj O jk xk

k = 1,..., n

.

. X gk
k
.

xk = 0,1

) (6
. ) (7
) ( .
) (8 ) (9
. Dk
k . ) (8
Dk
k ) .(xk =0 ) (9 D k
k
) .(xz=0 ) (10
)k (DMU
xk .
. ) (11
k DMU .
. ) (12

. ) (13 P
. )(14
) (15
. ) (16
.
.5 FGP

2 1961
.
.

. -


.
"
" " " " "
. gk
Fuzzy Goal Programming
Charnes

)(1

k = 1,2,...,n

) ( f x ( x) < gk
~

f x ( x) > gk
~

Subject to X F

Max-Min
):[15] 3(1978

)(2

)(3

k ( f k ( x)) 0, k = 1,2,..., n

Maximize

Subject to

X F

k ( f k ( x )) .
k :

)(4

f x ( x) >~ gk

f k ( x) g k ,
lk f k ( x ) g k
f k ( x) l k ,

f k ( x) g k ,

)(5

g k f k ( x ) u k f x ( x ) < g k
~
f k ( x ) uk ,

1,
) ( f ( x) l
k
,
k ( f k ( x)) = k
g k lk

0,

1,

k ( fk ( x)) = (uk (ux) gfk ( x)) ,

k
k

0,

k FGP .

lk uk
-
].[16
4 FGP
:

)(6

St:
1 0

)(7
)(8

2 0
) ( f l
1 = 1 1
g1 l1
) ( f 2 l2
= 2
g 2 l2

)(9
)(10

f1 = Max Dk

)(11

k =1
n

) f 2 = Max (1 ek

)(12
)(13
)(14

Maximize

k =1

1 k n,

1 k < z n,

Dk Mx k ,

Dk d kz + M (1 xz ),

1
2

Zimmermann

166

" " 3 1390

)(15

)(16

Vki I ik = xk

.1

i =1

)(17

) k ; z(k z

i =1

j =1

U kj O jz Vki I iz 0
n

)(18

xk = p
k =1

)(19

j, k

U kj xk

)(20

i, k

Vki xk

)(21

j, k

U kj O jk xk

k = 1,..., n

xk = 0,1

.6

59
55
29
57
27



64
72
50
51
46

29
23
61
58
38

97
60
28
107
51

89
47
29
104
46

46
27
26
58
0






31
71
80
0
58

71
43
0
80
26

47
0
43
71
27


0
47
71
31
46




1
2
3
4
5
6
7
8
9
10

.2 )
(
)(3

)(2

)(1

)(1

7
27
66
98
63
51
52
99
8
10

37
60
87
93
4
38
96
91
71
97

69
46
61
18
53
73
95
36
87
52

50
40
86
73
51
7
85
30
4
100

1
2
3
4
5
6
7
8
9
10

.3 MaxSumMin

.

5
. 10 .

. -
) (1
) ( ) (2 .
) :




(.
) :(1
) :(1
) :(2
) :(3
4
FGP .
MaxSumMin
) (3 . FGP
LINGO 8.0 .




- 6- 4- 3
9- 8

j =1

O jk + ek = x k

kj

10

1709.771

7.800006

0.9843242

0.9843242

167

[4]. Sorensen, J. H.; Soderstrom, J.; Carnes, S. A. Sweet for the Sour:
Incentives in Environmental Mediation.; Environmental Management 1984, 8(4), 28794.
[5]. Melo, M. T.; Niekel, S. F.; Saldanha, G. Facility Location and
Supply Chain Management- A Review.; EJOR 2011, 38-49.
[6]. Erkut, E.; Neuman, S. Comparison of Four Models for Dispersing Facilities.; INFOR 1990, 29(2), 6886.
[7]. Moon, I. D.; Chaudhry, S. S. An Analysis of Network Location
Problems with Distance Constraints.; Management Science
1984, 30(3), 290307.
[8]. Shier, D. R. A MinMax Theorem for p-Center Problems on a
Tree.; Transportation Science 1977, 11(3), 24352.
[9]. Kuby, M. J. Programming Models for Facility Dispersion: The
p-Dispersion and Maximum Dispersion Problems.; Geographical
Analysis 1987, 19(4), 31529.
[10]. Zanjirani Farahani, R.; Hekmatfar, M. Facility Location Concepts, Models, Algorithms and Case Studies.; Springer-Verlag
Berlin Heidelberg: Berlin, 2009.
[11]. Church, R. L.; Garfinkel, R. Locating an Obnoxious Facility on a
Network.; Transportation Science 1978, 12, 10718.
[12]. Thomas, P.; Chan, Y. Obnoxious-Facility Location and DataEnvelopment Analysis: A Combined Distance-Based Formulation.; European Journal of Operational Research 2002, 141(3),
495-514.
[13]. Azadeh, A.; Ghader, S. F.; Nasrollah, M. R. Location Optimization of Wind Plants in Iran by an Integrated Hierarchical Data
Envelopment Analysis.; Renewable Energy 2011, 36-49.
[14]. Klimberg, R. K.; Ratick, S. J. Modeling Data Envelopment
Analysis (DEA) Efficient Location/Allocation Decisions.; Computers & Operations Research 2008, 35, 457- 474.
[15]. Zimmermann, H. J. Fuzzy Programming and Linear Programming with Several Objective Functions.; Fuzzy Sets and Systems
1978, 1, 4555.
[16]. Tamiz, M. D.; Romero, C. Goal Programming for Decision
Making: An Overview of the Current State-of-the-Art.; European Journal of Operational Research 1998, 111, 567-581.

.7

.



.

FGP

.

.
.

.8
[1]. Drezner, Z.; Wesolowsky, G. O. Location of Multiple Obnoxious Facilities.; Transportation Science 1985, 19(3), 193202.
[2]. Drezner, Z.; Wesolowsky, G. O. Obnoxious Facility Location in
the Interior of a Planar Network.; Journal of Regional Science
1996, 35(4), 67588.
[3]. Murray, A. T.; Church, R. L.; Gerrard, R. A.; Tsui, W. S. Impact
Models for Siting Undesirable Facilities.; Papers in Regional
Science 1998, 77(1), 1936.