Professional Documents
Culture Documents
where
d ij
distance of the (i, j) entry from the diagonal
f ij
the (i, j) entry in the matrix
1
CRAFT
• Input for CRAFT:
– initial spatial array/layout
– flow data
– cost data
– Number and location of fixed department
2
CRAFT
10 20 30 40 50 60 70 80 90 100
Following are some
A D
examples of
questions addressed
by CRAFT:
• Is this a good C
layout?
• If not, can it be
B
improved?
1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 1 0 30
CRAFT
The possible interchange:
– only pairwise interchage
– only three-way interchange
– pairwise interchage followed by three-way
interchange
– three-way interchage followed by pairwise
interchange
– best of two-way and three-way interchage
4
CRAFT: Distance Between Two
Departments
• Consider the problem of finding the distance between two adjacent
departments, separated by a line only.
• People needs walking to move from one department to another, even
when the departments are adjacent.
• An estimate of average walking required is obtained from the distance
between centroids of two departments.
• The distance between two departments is taken from the distance
between their centroids.
• People walks along some rectilinear paths. An Euclidean distance
between two centroids is not a true representative of the walking
required. The rectilinear distance is a better approximation.
• So, Distance (A,B) = rectilinear distance between centroids of
departments A and B
5
CRAFT: Distance Between Two
Departments
• Let
– Centroid of Department A = xA , y A
– Centroid of Department B = xB , yB
x A xB y A y B
x A xC y A yC 30 80 75 35 90