Facility Design-Week 10 (cont)

Computerized Layout Planning

By
Anastasia L. Maukar

1
CRAFT- Computerized Relative Allocation
of Facilities Technique

• Created in 1964 by Buffa and Armour

• Process layout approach
• A heuristic computer program
– Compares process departments
– CRAFT requires an initial layout, which is improved
by CRAFT.

2
From-To Chart

• Determines which of the two departments has

a better from-to matrix, we can calculate the
moment of the matrix as follows:

Moment  d f
(i , j )
ij ij

where
d ij
 distance of the (i, j) entry from the diagonal

f ij
 the (i, j) entry in the matrix

3
CRAFT

• Input for CRAFT:

– initial spatial array/layout
– flow data
– cost data
– Number and location of fixed department

• Secara umum, dapat ditambahkan dummy yg

berfungsi untuk:
– Fill building irregularities.
– Represent obstacles or unusable areas in facility
– Represent extra space in the facility
– Aid in evaluating aisle locations in the final layout.

4
 CRAFT

10 20 30 40 50 60 70 80 90 100
Following are some
A D
examples of
questions
addressed by
CRAFT:
C
• Is this a good
layout?
B
• If not, can it be
improved?

5
10 20 30 40 50 60 70 80 90 100
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

6
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
7
CRAFT: Distance Between Two
Departments
• Let
– Centroid of Department A = xA , yA 
– Centroid of Department B = xB , yB 

• Then, the distance between departments A and B, Dist(A,B)

 x A  xB  y A  y B

• Ex: the distance between departments A and C is the rectilinear

distance between their centroids (30,75) and (80,35). Distance
(A,C)

 x A  xC  y A  yC  30  80  75  35  90
8
CRAFT: Distance Between Two
Departments

10 20 30 40 50 60 70 80 90 100
Centroid of A A D
= (30,75)
(80,85)

Centroid of C C
= (80,35)

B
Distance (A,C)
= 90

(30,25)

10 20 30 40 50 60 70 80 90 100
9
 CRAFT: Total Distance Traveled

• If the number of trips between two departments are very

high, then such departments should be placed near to
each other in order to minimize the total distance traveled.
• Distance traveled from department A to B = Distance
(A,B)  Number of trips from department A to B
• Total distance traveled is obtained by computing distance
traveled between every pair of departments, and then
summing up the results.
• Given a layout, CRAFT first finds the total distance
traveled.

10
CRAFT: Total Distance Traveled
(a) Material handling trips(given)
To
From A B C D
A 2 7 4
B 3 5 7
C 6 7 3 (b)
D 7 7 3

(b) Distances (given)

To
From A B C D
A 50 90 60
B 50 60 110
C 90 60 50
D 60 110 50 11
 To
A B C D
CRAFT: Total From

A 2 7 4
Distance Traveled B 3 5 7 (a)
C 6 7 3
(a) Material handling D 7 7 3
trips (given) To
From A B C D
(b) Distances (given)
A 50 90 60
B 50 60 1 1 0 (b)
(c) Sample computation:
distance traveled (A,B) C 90 60 50
= trips (A,B)  dist (A,B) D 60 110 50
=……….. From
To
A B C D
Total distance traveled A 100 630 240
= 100+630+240+…. B 150 300 7 7 0 (c)
= 4640 C 540 420 150
D 420 770 150 12
CRAFT: Savings
• CRAFT then attempts to improve the layout by pair-wise
interchanges.
• If some interchange results some savings in the total
distance traveled, the interchange that saves the most
(total distance traveled) is selected.
• While searching for the most savings, exact savings are
not computed. At the search stage, savings are
computed assuming when departments are
interchanged, centroids are interchanged too. This
assumption does not give the exact savings, but
approximate savings only.
• Exact centroids are computed later.
13
CRAFT: Savings
• Savings are computed for all feasible pairwise interchanges.
Savings are not computed for the infeasible interchanges.
• An interchange between two departments is feasible only if the
departments have the same area or they share a common
boundary.
– Feasible pairs are {A,B}, {A,C}, {A,D}, {B,C}, {C,D}
– and an infeasible pair is {B,D}
• In this example savings are not computed for interchanging B and
D. Savings are computed for each of the 5 other pair-wise
interchanges and the best one chosen.
• After the departments are interchanged, every exact centroid is
found. This may require more computation if one or more shape is
composed of rectangular pieces.
14
CRAFT: A Sample Computation of Savings from a
Feasible Pairwise Interchange

• To illustrate the computation of savings, we shall compute the savings

from interchanging Departments C and D
• New centroids:
A (30,75) Unchanged
B (30,25) Unchanged
C (80,85) Previous centroid of Department D
D (80,35) Previous centroid of Department C
• Note: If C and D are interchanged, exact centroids are C(80,65) and
D(80,15). So, the centroids C(80,85) and D(80,35) are not exact, but
approximate.

15
 CRAFT: A Sample Computation of Savings from a
Feasible Pairwise Interchange

• The first job in the computation of savings is to reconstruct the

distance matrix that would result if the interchange was made.
• The purpose of using approximate centroids will be clearer now.
• If the exact centroids were used, we would have to recompute
distances between every pair of departments that would include one
or both of C and D.
• However, since we assume that centroids of C and D will be
interchanged, the new distance matrix can be obtained just by
rearranging some rows and columns of the original distance matrix.

16
 CRAFT: A Sample Computation of Savings from a
Feasible Pairwise Interchange

• The matrix on the left is the previous matrix, before interchange. The
matrix on the right is after.
• Dist (A,B) and (C,D) does not change.
• New dist (A,C) = Previous dist (A,D)
• New dist (A,D) = Previous dist (A,C) Interchange
• New dist (B,C) = Previous dist (B,D) C,D
• New dist (B,D) = Previous dist (A,C)

To To
From A B C D From A B C D
A 50 90 60 A 50 60 90
B 50 60 110 B 50 11 0 60
C 90 60 50 C 60 110 50
D 60 110 50 D 90 60 50 17
CRAFT: A Sample To
From A B C D
Computation of
Savings A 2 7 4
B 3 5 7 (a)
C 6 7 3
(a) Material handling trips
(given) D 7 7 3
To
From A B C D
(b) Distances (rearranged)
A 50 60 90
(c) Sample computation: B 50 110 60 (b)
distance traveled (A,B) C 60 110 50
= trips (A,B)  dist (A,B)
D 90 60 50
=
Total distance traveled From
To
A B C D
= 100+420+360+… A 100 42 0 360
= 4480 B 150 55 0 420 (c)
Savings C 360 770 150
=
D 630 420 150 18
 CRAFT: Improvement Procedure

• To complete the exercise

1. Compute savings from all the feasible interchanges. If there is
no (positive) savings, stop.
2. If any interchange gives some (positive) savings, choose the
interchange that gives the maximum savings
3. If an interchange is chosen, then for every department find an
exact centroid after the interchange is implemented
4. Repeat the above 3 steps as longs as Step 1 finds an
interchange with some (positive) savings.

19
 CRAFT: Exact Coordinates of Centroids

• Sometimes, an interchange may result

10 20 30 40 50 60 70 80 90 100
in a peculiar shape of a department; a
shape that is composed of some D A
rectangular pieces
• For example, consider the layout (from
example) and interchange departments C
A and D. The resulting picture is shown
on the right. B
• How to compute the exact coordinate of
the centroid (of a shape like A)?

10 20 30 40 50 60 70 80 90 100

20
CRAFT: Exact Coordinates of Centroids

50 60 70 80 90 100
Let
A1  Area A1  A A1
A2  Area A2 
x1 , y1 
 Centroid of A1 A2

x2 , y2 
10 20 30 40 50 60 70 80 90 100
 Centroid of A1

Find the centroid of A
21
CRAFT: Exact Coordinates of Centroids

X-coordinate Multiply
Rectangle Area of centroid (2) and (3)
(1) (2) (3) (4)
A1
A2
Total

X-coordinate of the centroid of A

A1 x1  A2 x2

A1  A2

22
CRAFT: Exact Coordinates of Centroids

Y-coordinate Multiply
Rectangle Area of centroid (2) and (3)
(1) (2) (3) (4)
A1
A2
Total

Y-coordinate of the centroid of A

A1 y1  A2 y2

A1  A2

23
CRAFT: Exact Coordinates of Centroids

50 60 70 80 90 100
A A1

A2

10 20 30 40 50 60 70 80 90 100

Exact coordinate of area A is

24
 CRAFT: Some Comments

• An improvement procedure, not a construction procedure

• At every stage some pairwise interchanges are considered and the
best one is chosen
• Interchanges are only feasible if departments have the same area;
or they share a common boundary
• Departments of unequal size that are not adjacent are not
considered for interchange
• Estimated cost reduction may not be obtained after interchange
(because the savings are based on approximate centroids)
• Strangely shaped departments may be formed

25
 Computerized Layout Planning
Graphical Representation
“Points and lines” representation is not convenient for
analysis

26
 Layout Evaluation
– An Algorithm needs to distinguish between “good” layouts
and “bad” ones
– Develop scoring model, s = g (X )
– Adjacency-based scoring (Komsuluk Bazli Skorlama)
• Based on the relationship chart and diagram
6
Max s   wi X i
i 1

• Xi is the number of times an adjacency i is satisfied, i=A, E, I, O,

U, X
• Aldep uses (w values) A=64, E=16, I=4, O=1, U=0, and X=-1024
i
• Scoring model has intuitive appeal; the ranking of layouts is
sensitive to the weight values. Layout “B” may be preferred to “C”
with certain weights but not with others.
• Therefore, the specification of the weights is very important. 27
Exampl 1 2 3 4 5 6 7
eReceiving 1
2
1 I O 4+1=5
Milling
E
O
3
4 2 E I U 16+4+0=20
I 5
Press
U
E O 6 3 O U 1+0=1
U I U 7
Screw Machine
I
U
O
I
U
U
1
4 ----
Assembly
A
U
U
U
3
2
5 A 64 =64
Plating I 4
E 5 6 E
Shipping 6 16 =16
7 7
Total Score 106

4
U 7 U 2 E
Screw
Shipping Milling
Machine

3 E I I
Press
O 6 A 5 O 1
Plating Assembly Receiving

28
 1
Receiving 2
E 3
Milling O 4
U I 5
Press E O 6
7
Exercise: Find the score of the layout
U I U
Screw Machine U I U shown below. Use A=8, E=4, I=2, O=1,
I O U 1
Assembly U U 2 U=0 and X=-8.
A U 3
Plating I 4
E 5
Shipping 6
7

3 1 2 4
Press Receiving Milling Screw
Machine

7 6 5
Shipping Plating Assembly

29
 Layout Evaluation (cont’d)
– Distance-based scoring (Mesafe Bazli Skorlama)
• Approximate the cost of flow between activities
• Requires explicit evaluation of the flow volumes and costs
m 1 m
Min s c ij Dij
i 1 j i 1

• cij covers both the i to j and the j to i material flows

• Dij can be determined with any appropriate distance metric
– Often the rectilinear distance between department centroids
• Assumes that the material flow system has already been
specified (cij=flow required* cost /flow-distance)
• Assumes that the variable flow cost is proportional to
distance
• Distance often depends on the aisle layout and material
30
handling equipment
CRAFT - Example 2
Initial Layout

Ma Flow Data
From/To A B C D
A B A - 2 4 4
B 1 - 1 3
C 2 1 - 2
D 4 1 0 -
C D

Total Cost
Distance Data From/To A B C D Total
From/To A B C D A - 80 100 220 400
A - 40 25 55 B 40 - 65 75 180
B 40 - 65 25 C 50 65 - 80 195
C 25 65 - 40 D 220 25 0 - 245
D 55 25 40 - Total 310 170 165 375 1020
31
CRAFT - Example 2

• A & D  interchange  Total cost = 1.095

• A (60, 10) dan D (25, 30)
• A & C  interchange  Total cost = 99
• C & D  interchange  Total cost = 1.040
• B & D  interchange  Total cost = 945 
estimated total cost 
• B & C  tidak dapat dipertukarkan

32
CRAFT - Example 2

• Yang dipilih adalah pertukaran B & D 

menghasilkan layout baru dg department
centroid, sesuai dengan luas yang diinginkan
pada layout awal
– (XA, YA) = (25, 30)
– (XB, YB) = (55, 10)
– (XC, YC) = (20, 10)
– (XD, YD) = (67.5, 25)

33
CRAFT - Example 2

To
A B C D
From
40’

30’
A 50 25 47.5
20’

10’
B 50 35 27.5
20’ 40’ 60’ 80’

C 25 35 62.5

D 47.5 27.5 62.5

34
Layout Evaluation – Distance-Based
Scoring
– Distance-based scoring
– Impact of aisle layout and direction of travel

A B

C D

35
Benefits and Problems

• Benefit
– A Computer Program
– Flexibilty
• Problems
– Greedy Algorithm
– Inefficient
– End result may need to be modified

36
Summary
It is beneficial to use CRAFT but you should
also realize that the program is not flawless.

The user must understand how the program

works of the end product is not as efficient as
you had hope.

37