Академический Документы
Профессиональный Документы
Культура Документы
Logistics Management
Distance Measures
Logistics Management
Distance Measures
Pi = (ai, bi)
Pi = (ai, bi)
(x - a i) 2 + (y - b i)2
X = (x, y)
Pi = (ai, bi)
Objectives
Distance measures
Rectilinear
Minisum
Euclidean
Tchebyshev
SingleFacility
Rectilinear
Minimax
Euclidean
Tchebyshev
Facility
Location
Rectilinear
Minisum
Euclidean
Tchebyshev
MultiFacility
Rectilinear
Minimax
Euclidean
Tchebyshev
w i d X, Pi
i 1: location of the new facility
where X = (x, y)
Pi = (ai, bi) : location of the i-th existing facility, i = 1, , m
wi : weight associated to the i-th existing facility
For example, wi =
t i,
ci
vi
vi : average velocity.
Minimax Formulation :
Min f(x) = Max
s. t.
{w i d(X, Pi)}
wi d(X,i =P1,i),mz, i = 1, , m
Min
P1
Horizontal
pegboard
P3
P5
P4
w5
w1
w2
w3
w4
String
Weight proportional
to wi
Majority Theorem :
When one weight constitutes a majority of the total weight, an optimal new facility
location coincides with the existing facility which has the majority weight.
i= 1
[ | x a i | | y b i |]
f1(x) = i= 1 w i | x a i |
m
w i |y b i|
i= 1
f1(x)
- w1 - w2 - w3
w1 - w2 - w3
w1 + w2 - w3
w1
w2
w3
a1
a2
a3
Example 1
Problem Data :
m=3
a1 = 10
a2 = 20 a3 = 40
w1 = 5
w2 = 6
w3 = 4
Solution :
W = w1 + w2 + w3 = 15
W/2 = 7.5
w1 = 5 < 7.5
w1 + w2 = 11 > 7.5
Minimizing point : a2 = 20
Dual variables
s. t. x - r1+ s1
- r 2 + s2 = a 2 ,
- r 3 + s 3 = a 3,
= a1 ,
: y1 x
: y2
: y3
rj, sj 0, j = 1, 2, 3.
Relationships among variables :
0.
If both rj, sj > 0, we can reduce each by j = min {rj, sj}.
This maintains feasibility and reduces z
In an optimal solution, at least one of the r j and sj is 0, i. e., rj sj = 0.
0 y2 2 w2
a2
a3
0 y3 2 w3
a1 a2 a3
15
0 y2 12
20
40
0 y3 8
y1* = 10
y 2* = 5
y 3* = 0
0 < y2* < 12
x* = a2 = 20
15
Min f(x, y) = w
i= 1
[(x a i) (y b i) ]
2
1
2
(ai, bi)
(ai, bi)
Non-colinear Case
The graph of [ ( x a i ) ( y b i ) ]
2
1
2
1
2 2
[(x a i) (y b i) ]
2
contours
(ai, bi)
x
(ai, bi, 0)
f(x, y) = i= 1 w
[(x a i) (y b i) ]
2
1
2
0
x
0
y
i(x , y )
[(x a i) (y b i) ]
2
and
(x , y ) i(x , y )
i1
1
2
a i i(x , y )
i= 1
(x , y )
m
b i i(x , y )
i= 1
(x , y )
i ( x , y ).
M in f(x , y ) w i [(x a i ) (y b i ) ]
2
1
2
i1
f(x,y)
(x*,y*)
y
Weiszfelds Algorithm
1 m
Initialization : ( i ) ( x , y ) ( a i , b i )
m i1
0
or
1 m
w (a i, b i),
(ii) (x , y )
W i1 i
0
w h e re
Iterative step (k = 1, 2, ) :
a i i (x
i= 1
(x
k -1
Terminating conditions :
b i i (x
k -1
,y
k -1
i= 1
(x
(i) (x k , y k ) - (x
or ( i i ) f ( x
k -1
,y
k -1
k -1
k -1
,y
,y
k -1
,y
k -1
k -1
k -1
,y
k -1
) - f(x k , y k )
= w 1 + ... + w
Example 2
Problem Data :
m=4
P1 = (0, 0)
w1 = 1
P3 = (5, 0)
w3 = 1
P2 = (0, 10)
P4 = (12, 6)
w2 = 1
w4 = 1
Solution :
x0 = (5+12)/4 = 4.25
y0 = (10+6)/4 = 4
(x, y)
f(x, y)
4.023, 3.116
24.808
3.949, 2.647
24.665
3.958, 2.124
24.600
10
3.995, 2.011
24.597
Optimum
4.000, 2.000
P1
h1
h3
P3
X
P2
P4
h4
Hospital :
h2
Hospital
Poss. Accident :
Ambulance :
Min z
s. t. |x - ai| + |y - bi| + hi z,
i = 1, , m
(2)
(1)
(4)
x - ai + y - b i z - h i
ai - x + bi - y z - hi
ai - x + y - bi z - hi
x - ai + b i - y z - h i
(1)
(2)
(3)
(4)
x + y - z a i + b i - hi ,
i = 1, ..., m
x + y + z a i + bi + hi ,
i = 1, ..., m
- x + y - z - ai + b i - h i,
i = 1, ..., m
- x + y + z - a i + bi + hi ,
i = 1, ..., m
Min z
s. t.
x + y - z c1
x + y + z c2
where
i = 1, ..., m
i = 1, ..., m
- x + y - z c3
- x + y + z c4
z (c2 - c1)/2
(lower bound)
z (c4 - c3)/2
(lower bound)
z = c5/2
Optimal solution :
(x1, y1, z1) = 1/2 (c1 - c3, c1 + c3 + c5, c5)
(x2, y2, z2) = 1/2 (c2 - c4, c2 + c4 - c5, c5)
The line segment joining (x1, y1) and (x2, y2) is the set of optimal NF
locations
radio transmitter
EF : (ai, bi), (x,
i =y)1, , m(ai, bi)
NF : (x, y)
min g(x, y)
where
min z
s. t. [(x - ai)2 + (y - bi)2]1/2 z, i = 1, , m
min z
s. t.
(x - ai)2 + (y - bi)2 z ,
i = 1, , m
If there are two points, let the two points define the diameter of the circle.
B.
If there are three points defining a right or obtuse triangle, let the two points
opposite to the right or obtuse angle define the diameter of the circle.
Otherwise, construct a circle through the three points (see Figure 1).
C.
If there are four points, construct a circle using as defining points those
indicated in Figure 2.
Defining points :
Defining points :
Defining points :
ABD
BCD
CD
Defining points :
BD
Defining points :
B
Defining points :
Defining points :
Defining points :
B
BD
ACD
A
C
AD
Defining points :
ABD
Defining points :
AD
ABD
Figure 1. Alternative B
Figure 2. Alternative C
P4
w24
w11
X2
X1
v12
w23
P2
w12
P3
Old Facility :
New Facility :
Xj = (xj, yj), j = 1, , n.
Pi = (ai, bi), i = 1, , m.
where k > j.
1 j k n
1 j k n
jk
jk
x j x k w ji x j a i
j1 i 1
n m
y j y k w ji y j b i
j1 i 1
Example 3
m = 3 (EF)
v = [vjk] =
2
4
w = [wji] =
+ |x1 - 20|
1
0
+ 4 |x2 - 20|
x1 - x2 - p12 + q12
x1
=0
- r11 + s11
x1
= 10
- r12 + s12
x2
= 20
- r21 + s21
x2
+ 5 |x2 - 40|
= 10
- r23 + s23 = 40
xi - aj = rij - sij,
p12, q12 0
rij, sij 0
10 u11
s. t. z12 + u11
- z12
=5
+ u21
+ u23
=7
0 z12 4
0 u11 4
0 u12 2
0 u21 8
v
0w j i u23 10
2 1 0
0
4 0 5
2
jk
ji
5
7
12
jk
(10)
u11 4
4
N1
u12 2
12
(0)
(0)
1
Cap =
z12 4
u21 8
E2
(20)
Cap =
N3
(0)
7
N2
u23 10
(40)
Cap =
(0)
E3
After drawing the network, the solution can be usually obtained by inspection.
12
xk* xj*
xj* xk*
0 < zjk*
In particular,
ai xj*
xj* ai
0 < uji*
In particular,
Example 4
Four hospitals located within a city are cooperating to establish a centralized blood-bank facility that
will serve the hospitals. The new facility is to be located such that the (total) distance traveled is
minimized. The hospitals are located at the following coordinates: P 1=(5,10), P2=(7,6), P3=(4,2), and
P4=(16,3). The number of deliveries to be made per week between the blood-bank facility and each
hospital is estimated to be 3, 8, 2, and 10, respectively. Assuming rectilinear travel, determine the
optimum location.
m=4
P1 = (5, 10)
P3 = (4, 2)
w1 = 3
P2 = (7, 6)
w3 = 2
P4 = (16, 3)
w3 = 2
w3 = 2
a1 = 5
w1 = 3
w3 + w1 = 5
a2 = 7
w2 = 8
w3 + w1 + w2 = 13
a4 = 16
w4 = 10
Computation of x*:
a3 = 4
Computation of y*:
b3 = 2
w3 = 2
w3 = 2
b4 = 3
w4 = 10
w3 + w4 = 12
b2 = 6
w2 = 8
b1 = 10
w1 = 3
w2 = 8
w4 = 10
x* =
y* =
W=
Example 5
(10, 16)
16
h4 = 11
14
12
(6, 11)
10
h1 = 10
(12, 9)
8
(14, 7)
(10, 7)
h3 = 14
(12, 5)
h2 = 16
(5, 4)
10
12
14
Example 5 Solution
m=4
P1 = (6, 11)
P3 = (14, 7)
h1 = 10
h3 = 14
P2 = (12, 5)
P4 = (10, 16)
h2 = 16
h4 = 11
}=
z* = 2
Set of optimal solutions: line segment defined by the following end points:
1
(x1*, y1*) = 2 (c1 - c3, c1 + c3 + c5) =
1
(x2*, y2*) = 2 (c2 - c4, c2 + c4 - c5) =
1
2 (
1
2(
)=(
)=(
,
,
)
)
Example 6
Given five existing facilities located at points P1, P2, P3, P4, and P5 as shown below, determine the
optimum location for a new facility which will minimize the maximum distance to the existing
facilities. Assume that distances are Euclidean.
Elzinga-Hearn algorithm:
Figure 1 : Initial set of points = {P1, P2, P3}; center = C1.
Figure 2 : 2nd set of points = {P1, P2, P4}; center = C2.
Figure 3 : 3rd set of points = {P2, P4, P5}; center = C3 (optimal location).
Figure 1
P3
P5
P2
P1
C1
P1
P2
P3
P4
Figure 2
P4
P5
P2
P1
C2
P3
P2
P1
P4
Figure 3
P4
P5
P2
P1
C3
P3
P1
P4
P5