Scribd
Upload
463 views

Tools and Techniques - CRAFT - Solved Examples

The document describes the CRAFT algorithm for layout planning. It involves iteratively computing the total handling cost for the current layout and possible pairwise interchanges of departments, and selecting the interchange with the lowest cost to become the new layout. The algorithm is demonstrated on a sample problem involving 3 departments, where an interchange between departments B and C results in the lowest cost layout.

Uploaded by

Shiva Tej
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
463 views

Tools and Techniques - CRAFT - Solved Examples

The document describes the CRAFT algorithm for layout planning. It involves iteratively computing the total handling cost for the current layout and possible pairwise interchanges of departments, and selecting the interchange with the lowest cost to become the new layout. The algorithm is demonstrated on a sample problem involving 3 departments, where an interchange between departments B and C results in the lowest cost layout.

Uploaded by

Shiva Tej
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Layout Planning (CRAFT algorithm)

CRAFT procedure

S1: Input the details


S2: Compute centroids of departments in the present layout
S3: Form distance matrix using the centroids
S4: Compute the total handling cost
S5: Find all the possible pairwise interchanges of departments based on common border or
equal area criterion; For each possibility, interchange the corresponding centroids and
compute approximate costs
S6: Find the pair of departments corresponding to the minimum handling cost from among all
the possible pairs of interchanges
S7: Is the cost in the previous step less than the total cost of the present layout? If yes, go to
S8. If not, go to S11
S8: Interchange the selected pair of departments; Call this as NEW LAYOUT
Compute centroids, distance matrix and total cost
S9: Is the cost of new layout less than the cost of the present layout?
If yes, go to S10; If not, go to S11
S10: The new layout is here after considered as the PRESENT LAYOUT
Its data on centroids, layout matrix, and the total cost is retained
Go to S5
S11: Print the present layout as the FINAL LAYOUT
S12: Stop

Problem:
Consider the following initial layout with unit cost matrix.
Initial Layout

4 6 8

6 A B C

Flow Matrix

To
A B C
From
A - 1 8
B 2 - 1
C 6 2 -

Use the CRAFT pairwise interchange technique to obtain the desirable layout.

Solution:
S1: Total number of departments: 3 Total number of interchangeable departments: 3
Initial Layout:

4 6 8

6 A B C

Cost matrix [cij]

To
A B C
From
A - 1 1
B 1 - 1
C 1 1 -
Flow matrix [fij]

To
A B C
From
A - 1 8
B 2 - 1
C 6 2 -
Area of departments

Department A B C
Area (Sq. 24 36 48
Units)
S2: Centroids of all departments are calculated. Left side and bottom side of the layout
are assumed as Y and X axes respectively

(XA, YA) = (2, 3); (XB, YB) = (7, 3); (XC, YC) = (14, 3)

S3: The distance between any two departments is given by rectilinear distance between
the centroids of the two departments
dij = |(Xi – Xj) + (Yi – Yj)| where (Xi, Yi) and (Xj, Yj) are the centroids
Distance matrix [dij]

To
A B C
From
A - 5 12
B 5 - 7
C 12 7 -
S4: Total cost of handling for the present layout is calculated
Total cost = ∑3𝑖=1 ∑3𝑗=1 𝑓𝑖𝑗 × 𝑑𝑖𝑗 × 𝑐𝑖𝑗
Total cost matrix [TCij]
To
A B C
From
A - 5 96
B 10 - 7
C 72 14 -
Total cost = 204

S5: Consider various departmental interchanges for improvement


Departmental interchanges that are possible are given below
Departments having common border and Departments having common area
Pairwise interchanges are considered; For 3 departments, 3 pairwise interchanges are
Possible
Pair of departments Remark
A and B Interchange based on common border
A and C Not possible
B and C Interchange based on common border
For the purpose of cost calculation, an interchange between two departments would
mean that their present centroids are interchanged
For each interchange, the associated distance and total cost matrices are calculated
Interchange between A and B
(XB, YB) = (2, 3); (XA, YA) = (7, 3); (XC, YC) = (14, 3)
Distance matrix [dij]

To
A B C
From
A - 5 7
B 5 - 12
C 7 12 -
Total cost matrix [TCij]

To
A B C
From
A - 5 56
B 10 - 12
C 42 24 -
Total cost = 149
Interchange between B and C
(XA, YA) = (2, 3); (XC, YC) = (7, 3); (XB, YB) = (14, 3)

Distance matrix [dij]


To
A B C
From
A - 12 5
B 12 - 7
C 5 7 -
Total cost matrix [TCij]

To
A B C
From
A - 12 40
B 24 - 7
C 30 14 -
Total cost = 127
S6: The interchange which promises minimum handling cost is selected for actual
interchange in the layout; interchange between B and C results in minimum cost
S7: This cost is compared with the cost of the present layout; this cost of 127 is less
compared with the cost of 204 for the present layout
S8: Interchange is made between B and C. New layout is drawn
4 8 6

6 A C B

The centroids are


(XA, YA) = (2, 3); (XB, YB) = (15, 3); (XC, YC) = (8, 3)
Distance matrix [dij]
To
A B C
From
A - 13 6
B 13 - 7
C 6 7 -
Total cost matrix [TCij]
To
A B C
From
A - 13 48
B 26 - 7
C 36 14 -
Total cost = 144
S9: The total cost of the new layout is compared with the cost of the present layout
Since the cost is less, the new layout is treated as the present layout
The process is repeated for the next iteration

You might also like