Chapter 2 (Facilities Location) DQP 4092
Chapter 2 (Facilities Location) DQP 4092
Chapter 2 (Facilities Location) DQP 4092
Facility Management
Chapter 2
Facilities Location
Facilities Location
Sub Topic:
market area.
INTRODUCTION (cont…)
3. Transport Facilities:
Speedy transport facilities ensure timely supply of
raw materials to the company and finished goods to
the customers. The transport facility is a prerequisite
for the location of the plant. There are five basic
modes of physical transportation, air, road, rail, water
and pipeline. Goods that are mainly intended for
exports demand a location near to the port or large
airport. The choice of transport method and hence
the location will depend on relative costs,
convenience, and suitability. Thus transportation cost
to value added is one to the criteria for plant location.
INTRODUCTION (cont…)
4. Infrastructure availability:
The basic infrastructure facilities like power, water and
waste disposal, etc., become
The prominent factors in deciding the location. Certain types
of industries are power hungry e.g., aluminium and steel and
they should be located close to the power station or location
where uninterrupted power supply is assured throughout the
year. The non-availability of power may become a survival
problem for such industries. Process industries like paper,
chemical, cement, etc., require continuous supply of water in
large amount and good quality, and mineral content of water
becomes an important factor. Waste disposal facilities for
process industries are an important factor, which influences
the plant location.
INTRODUCTION (cont…)
5. Labour and wages:
The problem of securing adequate number of
1. Rectilinear
2. Euclidean
3. Flow path
2.3 Distance Measure (Cont……)
1. Rectilinear
Distance are measured along paths that are
aisles in a factory
Formula: dAB = │ xA – xB │+ │ yA – yB │
2.3Distance Measure
(Cont……)
2.3 Distance Measure (Cont.…)
Example 2
So
dAB = │ 40 – 70 │+ │ 80 – 90 │
dAB = 30+10
dAB = 40KM
2.3 Distance Measure (Cont.…)
2. Euclidean
Straight line
Distance are measured along the straight line path
Formula: dAB = ( xA – xB )2 + ( yA – yB )2
2.3 Distance Measure (Cont.…)
2.3 Distance Measure (Cont.…)
Example 2
dAB = ( xA – xB )2 + ( yA – yB )2
dAB = (140– 100)2 + ( 80 – 90 )2
dAB = 402 + 102
dAB = 402 + 102
dAB = 1700
dAB =41 KM
2.3 Distance Measure (Cont.…)
3. Flow path
Distance is measured along the actual path
a. Location of markets
b. Volume of goods shipped to those markets
c. Shipping cost (or distance)
y - coordinate = i∑d Q
iy i
i∑Qi
where dix = x-coordinate of location i
diy = y-coordinate of location i
Qi = Quantity of goods moved to or from location
i
2.4.1 Centure of Gravity
(cont…)
2.4.1 Centure of Gravity
(cont…)
2.4.1 Centure of Gravity (cont…)
2.4.2 Minisum Location Model
The objective of minisum location model is to
minimize the sum of the weight distances
between the new facility and the other existing
facilities.The minisum location problem is
formulated as below:
2.4.2 Minisum Location Model
(Cont…)
Where f(x) = total cost of travel between
new facility and existing facility
wi = the weighted score
x = x-coordinate for new facility
y = y-coordinate for new facility
ai = x-coordinate for existing facility
bi = y-coordinate for existing facility
2.4.2 Minisum Location Model (Cont…)
Examples 1
In order to illustrate how one determines the optimum
solution to the minisum problem, consider an example
involving the minisum location of a new machine tool in
a maintenance department. Suppose there are five
existing machines that have a material handling relation
ship with the new machine.
The existing machines are located at the points P1 = (1,
1), P2 = (5, 2), P3 = (2, 8), P4 = (4, 4), and P5 = (8, 6) as
in Figure 2.5. The cost per unit distance traveled is the
same between the new machine and each existing
machine. The number of trips per day between the new
machine and the existing machines are 5, 6, 2, 4, and
8, respectively.
2.4.2 Minisum Location Model
(Cont…)
2.4.2 Minisum Location Model (Cont…)
Solution:
Arrange x value ascending with the
corresponding weight
2.4.2 Minisum Location Model
(Cont…)
Sum all the weight and calculate median of
the cumulative weight
2.4.2 Minisum Location Model (Cont…)
X optimum is define if partial sum first equal
or exceeds one-half the total
Repeat steps to get the optimum value of Y.
2.4.2 Minisum Location Model
(Cont…)
The total weighted distance resulting from the location x =
(5, 4) is:
Minimum f(x) = max [(│x - ai │ + │y – bi │, I = 1,2,…m]
Formula 2.6: Total weight distance
f(5,4) = 5(I5 - 11 + I4 – 1I) + 6(I5 – 5I + I4 – 2I) + 2(I5 – 2I +
I4 – 8I) +
4(I5 – 4I + I4 – 4I) + 8(I5 – 8I + I4 – 6I)
= 35 + 12 + 14 + 4 + 40
= 105
2.4.3 Minimax Location Model
The objective of minimax location model is to minimize the maximum distance between
the new facility and any existing facility. The minimax location problem is formulated as
below:
The maximum distance between the new facility and the existing facilities = c/2
2.4.3 Minimax Location Model
(Cont…)
Example 2.4:
Eight machines are to be maintained by crew
from the central maintenance facility. The
coordinate locations of the machines are (0,0),
(4,6),(8,2), (10,4) (4,8), (2,4), (6,4), and (8,8) as
in Figure below.
2.4.3 Minimax Location Model
(Cont…)
2.4.3 Minimax Location Model
(Cont…)
Solution:
c1 = min (ai + bi) = 0
c2 = max (ai + bi) = 16
c3 = min (-ai + bi) = -6
c4 = max (-ai + bi) = 4
c5 = max (c2 – c1, c4 – c3) = 16