Professional Documents
Culture Documents
Locating Facilities 2
Locating Facilities 2
Locating Facilities 2
CLIMATE 10 8 6 9 7 5
INFRASCTURE 20 12 16 15 8 13
ACCESSIBILITY 10 6 8 7 9 9
CONSTRUCTION COST 5 3 1 4 2 1
COMMUNITY ATTITUDE 10 6 8 7 4 8
GOVERNMENTS VIEWS 5 2 2 3 4 3
CLOSENESS TO SUPPLIERS 15 10 10 13 13 10
CLOSENESS TO CUSTOMERS 20 12 10 15 17 10
AVAILABILITY OF WORKFORCE 5 1 2 4 5 3
LOCATING FACILITIES
8 EN HT
22
5 15
20
CP 6
25 6 FR
10
Solution
This is a single median problem, so we start with a
matrix showing the minimum distances between each
town, as shown in figure 5.13. This matrix also shows
the weight to be moved in column B. if we take one
column, say C, this shows the distance from a centre
located in AL to each other town. If we multiply this
distance by the corresponding weight
in column B, we get the weight-distance for each town.
Then adding these down the column gives the total
weight- distance for a logistics centre in AL, shown in
Row 12.
Solution continued
Weight distance of a centre at AL=(10x0) + (15x15) +
(25x22) + (20x24) + (20x31) + (10x28) + (10x32) +
(15x36) = 3015
3
3
I
10
E
6
6
4
15
G
C
15
H
14
10
15
B
D
10
10
A
Road net work showing travel time in minutes between
locations
Solution
We could, of course, do the calculations for this
covering problem, finding the maximum time for each
town and identifying the best, and then finding the
combination of towns that gives service times less than
15 minutes. There is no need for this, as a lot of soft-
ware solves network problems and Figure 5.15 shows a
printout from a simple package. As you can see, if a
single location is needed the package recommends
town C, giving a maximum journey of 25 minutes. If this
is too much, facilities at A and I will reduce the
maximum journey to 15 minutes.
A B C D E F G H H J K
Covering
1 problem
2
Distance
3 Matrix
4
5 A B C D E F G H I J
6 A 0 10 24 10 29 29 25 20 35 32
7 B 10 0 14 20 19 19 15 30 25 22
8 C 24 14 0 15 11 5 15 25 11 14
9 D 10 20 15 0 26 20 30 10 25 29
10 E 29 19 11 26 0 6 4 23 8 3
11 F 29 19 5 20 6 0 10 21 6 10
12 G 25 15 15 30 4 10 0 27 12 7
13 H 20 30 25 10 23 21 27 0 15 20
14 I 35 25 11 25 8 6 12 15 0 5
15 J 32 22 14 29 3 10 7 20 5 0
16 Maximum 35 30 25 30 29 29 30 30 35 32
17
18 Single location C
19 Maximum time 25
20
21 Two Location A I
22 A 0
23 B 10
24 C 11
25 D 10
26 E 8
27 F 6
28 G 12
29 H 15
30 I 0
31 J 5
32 Maximum time 10 15