Scribd
Upload
52 views7 pages

Facility Planning Solution HK2!22!23

Uploaded by

Lâm Lê Hoàng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views7 pages

Facility Planning Solution HK2!22!23

Uploaded by

Lâm Lê Hoàng
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

(Date) (Date)

Lecturer: Approved by:


(Signature & Fullname) (Signature, Position & Fullname)

(The above part must be hidden when copying for exam)

FINAL EXAM Semester/Academic year 2 2022-2023


SOLUTION Date 15.05.2023
Course title Facility Planning
UNIVERSITY OF TECHNOLOGY - VNUHCM Course ID ME3253
FACULTY OF FME Duration 70 min Question sheet code 01
Notes - Open book
: - Can use pencils for drawing diagrams
- Submit the question sheet together with the answer sheet

Question 1 (4pts) L.O.4, L.O.6:


Four equal-sized departments are located as shown in Figure 1. The measurement of
2
each department is 10x10 𝑚 . Frequency flow matrix between each department is
given in Table 1. The traveling distance follows the Rectilinear Distance

Figure 1: Initial layout of four Departments


Table 1: Frequency flow matrix between each department
TO
A B C D
A 200 3000 700
B 200 200
FROM
C 100
D

a) Determine the total traveling distance of initial layout (1pts).


b) Using Pairwise Exchange Method in one iteration to achieve a better layout
(3pts).
1
Answers
The initial layout is A-D-B-C with the distance matrix shown below:
Meters TO
A B C D
A - 20 30 10
FROM B 20 - 10 10
C 30 10 - 20
D 10 10 20 -

The total traveling distance of initial layout is 107000 m


b)
Perform Pairwise Exchange Method with one iteration, we have:
Layout B-D-A-C C-D-B-A D-A-B-C A-D-C-B A-B-D-C A-C-B-D
Distance
51000 113000 78000 80000 113000 61000
(meters)

We choose the layout having the smallest total traveling distance. The optimal result
B-D-A-C has been depicted with the total traveling distance 51000 m.
Question 2 (3pts) L.O.4, L.O.5:
For the machine-part matrix shown in Table 2:
Table 2: Machine-part matrix
Machine #
Part # 1 2 3 4 5
1 1 1
2 1
3 1
4 1 1
5 1 1 1
6 1 1

a) Use Direct Clustering Algorithms (DCA) to form cells for above-mentioned


machine-part matrix (2pts).
b) Propose one alternative for resolving any conflicts (1pts).

2
3
Answers
a)
- Sum the “1s” in each column and in each row of the machine-part matrix.
- Order the rows (top to bottom) in descending order of the number “1s” in the
rows, and order the columns (left to right) in ascending order of the number “1s”
in the columns.
- Where ties exist, break the ties in descending numerical sequence.

Machines
Part # 5 4 3 2 1 SUM
5 1 1 1 3
6 1 1 2
4 1 1 2
1 1 1 2
2 1 1
3 1 1
SUM 2 2 2 2 3

Sort column to form block:


Machines
Part # 5 3 1 2 4
5 1 1 1
6 1 1
4 1 1
1 1 1
2 1
3 1

Sort row to form block:


Machines
Part # 5 3 1 2 4
5 1 1 1
6 1 1
1 1 1
2 1
4 1 1
3 1

4
The result is depicted below:
Machines
Part # 3 5 1 2 4
5 1 1 1
6 1 1
1 1 1
2 1
4 1 1
3 1

b) The layout shows that we need purchase one more machine 1 for solving the
conflict
Machines
Part # 3 5 1a 1b 2 4
5 1 1 1
6 1 1
1 1 1
2 1
4 1 1
3 1

Question 3 (3pts) L.O.1, L.O.2, L.O.3:


Consider a distributor location problemi involving 5 customers. The locations
(X,Y-coordinate) of customers are given in Table 3. The Euclidean distance assumption
is applied
Table 3: The locations (X,Y- coordinate) of customers
Customers X Y
1 30 40
2 50 20
3 60 80
4 70 40
5 85 95

5
The number of trips per month between a new distributor and each customer are
estimated as 250, 350, 400, 200, 300
a) Determine the optimal location of the distributor using Minisum approach (2
pts).
b) Calculate total traveling distance according to the new distributor location (1
pts).

6
Answers
a)
Number of trips per month between a new distributor and each customer
Custome X Y Trips from
r new
distributor
1 30 40 250
2 50 20 350
3 60 80 400
4 70 40 200
5 85 95 300

The locations (X,Y- coordinate) of new distributor

Custome X Trips Number of Customer Y Trips Number of


r trip trip
accumulatio accumulatio
n n
1 30 250 250 2 20 350 350
2 50 350 600 1 40 250 600
4 60 400 1000 4 40 200 800
5 70 200 1200 3 80 400 1200
3 85 300 1500 5 95 300 1500
Sum 1500 New X=60 1500 New Y=40

The optimal location of the new distributor is U(60,40)


b)
2 2
Total distance = 250( (60 − 30) + (40 − 40) )+
2 2 2 2
350( (60 − 50) + (40 − 20) )+ 400( (60 − 60) + (40 − 80) )+
2 2 2 2
200( (60 − 70) + (40 − 40) )+ 300( (60 − 85) + (40 − 95) )= 51450.806

You might also like