An Emergency Service Facility

Location Problem With Fuzzy

Objective and Constraint.
Tatsuo Matsutomi
Hiroaki Ishii
Hasan Safadi
Outline

1. Introduction.
2. Formulation of the problem.
3. Fuzzy Decisions.
4. Properties of the chance constraint.
5. Boundary of Feasible Region.
6. Solution Procedure.
7. Conclusion.
Introduction

z because their locations are known only after

a call is been made
made, they assumed the
locations of demand points are reandom
variables. And thats whyy they y introduced the
fuzzy sets concepts into the problem.
z they have developed a solution procedure for
an ambulance
b l d
depott llocation
ti problem
bl with
ith
fuzzy a chance constraint and fuzzy objective
and constraint.
Formulation
F l ti
Understanding the model

1. An ambulance must respond to a call for

service from the location of the incident.
2. Transport the patient to the nearest hospital.
3. Then it goes back to its depot, and wait for the
next call
call.
z From above, there are three important times to
consider or to minimize:
1. Response time.
2. Time the ambulance takes from the incident location
to the nearest hospital.
3. Time for
f the ambulance to go back to its depot.
Formulation
F l ti
Notations

1. [Xi,Yi],i=1,2,…,n Î locations of demand (calls) points. Assumed to

be independently, identically distributed (i.i.d).
2. ( ) Î locations
(x,y) l ti off a new ffacility.
ilit ((emergency d depot).
t)
3. (a,b) Î locations of existing facilities (hospitals).
4. ro Î maximum time or distance allowed between a demand point
and both the depot and the hospital.
5. rc Î maximum time or distance allowed between the existing facility
and the depot.
6. rp Î maximum time or distance allowed between a demand point
and the depot.
7. Di(x,y) Î distance function from the depot to the demand point plus
the distance between the demand point to the hospital.
8. d(x,y) Î distance function between depot and the hospital.
9. di(x,y)
( ,y) Î distance function between depot p and the demand ppoint.
10. α Î is a probability level to which the chance constraint should hold.
Formulation
F l ti
The model

z The problem P was formulated as follows:

n
P : E( ∑
i=1
Di(x, y)) p ro

Subject to :
d(
d(x, y)) p rc
Pr [ max di(x, y) ≤ rp] ≥ α
(x, y) ∈ [0, L] * [0, M], 0 ≤ α ≤ 1.

z p means that the objective function and the

first constraint can be violated up to a certain
threshold.
Formulation
F l ti
Membership function

z The functions µo (x,y) and µc (x,y) are introduced in-order to

reduce the problem P to ordinary equivalent location problem.
⎡ 0 if r ≥ ro + lo ⎤
µo ( x, y ) = ⎢1 − ( r − ro ) / lo if ro < r < ro + lo ⎥⎥
⎢
⎣⎢ 1 if r ≤ ro ⎥⎦
⎡ 0 if r ≥ ro + lo ⎤
µc ( x, y ) = ⎢1 − ( d ( x , y ) − rc ) / lc if ro < r < ro + lo ⎥⎥
⎢
⎣⎢ 1 if r ≤ ro ⎥⎦
n
r = E ( ∑ Di ( x , y )), lo > 0 , lc > 0 .
i
formulation

z µo indicates the degree to which the objective is satisfied and lo is a

maximum threshold.
z In other words it means the decision maker thinks he want the value r
to be at most ro but he can accept bigger values of r but decreasing
the satisfaction degree to the limit of ro+lo.
z Properties of the membership functions: μo
1. Decreasing over the interval [ro,ro+lo].
2. Has the value of 0 at ro+lo and 1 at ro. 1

ro

0
r
lo
Fuzzy Decision

z Their first step in generating the solution was

t reduce
to d the
th problem
bl P iinto
t ttwo problems
bl
P1 and P2 as follows:
P1 : Maximize {µo(x,
o(x y) ∧ µc(x,
µc(x y)}
Pr [max di(x, y) ≤ rp] ≥ α
(x, y) ∈ [0, L] * [0, M], 0 ≤ α ≤ 1
z Here they used the minimum-operator.
Fuzzy Decision

z And For the fuzzy constraint:

P2 : Maximize {Wo * µ o(x, y) + Wc * µ c(x, y)}
S.T :
di(x y) ≤ rp] ≥ α
Pr [ max di(x,
(x, y) ∈ [0, L] * [0, M], 0 ≤ α ≤1

z Here they used an add-operator.

add operator.
Fuzzy decision

z In order to solve P1 and P2 they had to transform

them into equivalent problem
problem.
P1 : Maximize λ
S.T :
n
E( ∑ Di(x, y)) ≤ ro + lo(1 - λ )
i = 1
d(x,
d(x y) ≤ rc + lc(1 - λ )
Pr [ max di(x, y) ≤ rp] ≥ α
(x, y) ∈ [0, L] * [0, M], 0 ≤ α ≤ 1.
Fuzzy decision

P2 : Maximize Wo * λo + Wc * λc
S.T :
n
E( ∑ Di(x, y)) ≤ ro + lo(1 - λo)
i = 1
d(x,
d( y)) ≤ rc + l (1
lc(1 - λc)
λ )
Pr [max di(x, y) ≤ rp] ≥ α
(x, y) ∈ [0, L] * [0, M],
0 ≤ λo, λc, α ≤ 1.
Properties
P ti off the
th
chance constraint

Pr [max di(x, y) ≤ rp] = ( Pr [ d ( x, y) ≤ rp] ) n

z Property 1: The probability Pr[ rp ] is equal to the proportion of
th area where
the h a rotated
t t d square region
i (di
(diamond d ( x,y )) whose
h
center is (x , y ) is included in the rectangular [ 0,L ] * [ 0,M ]
Where Pr[ rp ] = Pr [ d(x,y)]
Properties
P ti off the
th
chance constraint

z A(x,y) is the area of intersection of

rectangular
t l [0
[0,L]*[0,M]
L]*[0 M] andd the
th diamond
di d ((x,y))

M rp(x,y)
( )

A(x,y)

0 L
Properties
P ti off the
th
chance constraint

z Property 2:The probability Pr[ rp ] takes

maximum
i value
l where
h ((x,y)) = (L/2
(L/2,M/2)
M/2) and
d
takes minimum value where
( ) =(0,0),(L,0),(0,M)
(x,y) (0 0) (L 0) (0 M) and d (L
(L,M).
M)
Boundary of Feasible Region

z From Property 2 we can identify the feasible

region where the chance constraint is satisfied
satisfied.
z we define the region R1(α,rp) as follows

Rl( α , rp) = [ ( x , y) A(x, y)/L * M ≥ α

1
n
]
Boundary of Feasible Region

z R1(α,rp) can be identified by following procedure

in which we take into account the Property 2 . We
assume that a ≥ L/2, b ≥ M/2

1
z STEP 1:If A (L, M)/(L * M) ≥ α n
then R1(α,rp) coincide with a rectangular area
[0,L]*[0,M]. Stop. Otherwise, go to STEP 2 .
Boundary of Feasible Region

z STEP 2:If A (L, M/2)/(L * M) ≥ α 1 n

fi d points
find i t p1 1 = (L,y1)
(L 1) and d q1=(xi,M)
1 ( i M) such
h
that
1 1
A (L, 1)/(L * M) = α n , A (x1,
(L y1)/(L ( 1 M)/(L * M) = α n
Then find the relation between x and y that
1
satisfy A ((x,, y) = L * M * α n Stop. Otherwise, go
to STEP 3.
Boundary of Feasible Region
z STEP 3:
1. Find a point q2=(x2,M/2) such that A(x2,M/2)=L*M*(α^1/n). If rp<M/2.
2. find q3=(x2,y2) such that A(x2,y2)=L*M*(α^1/n). Y2=M-rp.
3. Find a point p2=(x3,M) such that A(x3,M)=L*M*(α^1/n). if such p2 is
found and rp<L/2.
4. Find qq4=(x4,y3)
( ,y ) such that A(x4,y3)=L*M*(α^1/n).
( ,y ) ( ) X4=L-rp.
p
5. Then find a relation between x and y that satisfy
A(x,y)=L*M*(α^1/n),where x3<=x<=x2 and M/2<=y<=M , Stop. I f such
p2 does not exist,
6. find a p
point p
p3=(L/2,y4)
( ,y ) such that A(L/2,y4)=L*M
( ,y ) *(α^1/n).
( ) instead of
p2.
7. find a relation between x and y that satisfy A(x,y)=L*M *(α^1/n). where
L/2<=x<=x2 and M/2<= y <= y2.
Solution Method

z Let ( x * , y * ) denotes an optimal solution of P1 . So

we obtain the following gpprocedure:
1. STEP 1: Identify the boundary of R1(α,rp).
2. STEP 2: Find (xo(λ),yo(λ) ).If (xo(λ),yo(λ))ε R1(α,rp)
then (x*
(x ,yy*)=(xo(λ)
) (xo(λ) ,yo(λ)
yo(λ) ) , stop.
stop Otherwise
Otherwise.
3. STEP 3: Find a point of contact (xd(λ),yd(λ)) of the
boundary of R1(α,rp) and the diamond. If
(xd(λ),yd(λ)) satisfies constraint (10) , then (x
(x*,y*)
,y ) =
(xd(λ),yd(λ)), stop. Otherwise, find a point which
satisfies constraint (10) and (11) on the boundary of
R1(α,rp). Terminate.
Solution Method

z Problem P2 can be solved almost using the same

procedure as in Problem P1 From (13) and (14) ,
if ellipse (λo) expressed by equation
(x - L/2) 2 /L + (y − M/2) 2 /M ≤ (ro + lo(1 - λo))/n - constant

and diamond (λc) with center (a,b) and radius

rc+lc*(1-λc) have a point of contact, the value
of objective function is maximized.
Solution Method

z So we find the relation between λo and λc for

ellipse
lli (λ
(λo)) and d di
diamondd (λ
(λc)) h
having
i a
contact point. Let (x”,y”) denotes a contact
points If (x”
points. (x ,yy”)ε
)ε R1(α,rp),
R1(α rp) then input the
relation of λo and λc into the objective
function of P2,, we can easilyy find an optimal
p
solution.
Conclusion

z In this paper they developed a solution

procedure
d off an emergency facility
f ilit llocation
ti
problem with fuzzy objective and constraint.
One uses a minimum
minimum-operator
operator and the other
uses an add-operator.