Professional Documents
Culture Documents
hw5 Solutions PDF
hw5 Solutions PDF
hw5 Solutions PDF
Problem 1.
From-To A B C D E
A 0 0 0 0
B 350 200 0 0
D 250 0 0 200
F. Between A A B C D E A B E C I E -
B 350 -
C 250 350 -
D 250 0 0 -
E 0 400 50 450 -
D I U U -
E U A O A Total Score 17 24 13 15 21
Act. Rel. A B C D E
A -
B 7 -
C 5 7 -
D 5 0 0 -
E 0 10 1 10 -
Number of blocks: 3 3 2 4 4
Act. Rel. A B C D E
A -
B 7 -
C 5 7 -
D 5 0 0 -
E 0 10 1 10 -
Total Score 17 24 13 15 21
D
Then place all 7-relationships:
E C B E
D A D
D A
C B
D A
or
B C
D A
A C
B D
Flow-Between A B C A - 6 0 B - 5 C D
D 3 0 0 -
A B C D
D 3 0 0 -
Note that there is positive flow only between three department pairs: AB, BC and AD. Their relative distances are the only ones we need to worry about. (The others will be multiplied with zero due to zero flow between). Department A is fixed, so there are only three pairs to consider for pairwise exchange: BC, BD, CD Iteration 0: Initial cost = + + = 6 2 1 + 5 1 2 + 3 3 2 = 40 Iteration 1: BC: 6 2 1 + 5 1 2 + 3 3 2 = 40 BD: 6 2 2 + 5 1 1 + 3 3 1 = 38 CD: 6 2 1 + 5 1 1 + 3 3 1 = 26 Swapping C and D gives the best layout among three options considered in iteration 1, so the current layout becomes:
Layout (Itr 1)
A D
B C
Note that in the current layout, all department pairs with a positive flow in between (AB, BC and AD) have a distance of 1 unit each (minimum distance possible for this layout). Further swaps will not reduce the cost. At this step, you should either state the same observation or perform iteration 2 which gives no improved layouts. Hence the current layout is optimal.