Professional Documents
Culture Documents
Layout Planning (ALDEP Algorithm)
Layout Planning (ALDEP Algorithm)
Relationship Chart:
3. Relationship Chart
From
1 -
2 E -
3 O U -
4 I E U -
5 O I U I -
6 U I O U A -
7 U U U U I E -
To 1 2 3 4 5 6 7
The triangular matrix is represented in a rectangular matrix form as follows:
1 2 3 4 5 6 7
To
From
1 - E O I O U U
2 E - U E I I U
3 O U - U U O U
4 I E U - I U U
5 O I U I - A I
6 U I O U A - E
7 U U U U I E -
4. Minimum department preference (MDP) value = 4
5. Sweep width = 2
6. Number of iterations to be performed = 2
Apply ALDEP algorithm to design a suitable layout
Solution:
S0: No. of departments = 7
Area of departments:
Assume 1 square for a department = 400 sq.m
S5: Select the department from List B with the maximum REL value in relation to
department 2. So, department 1 is selected and placed in the layout.
S6: Since all the departments are not placed in the layout, go to S2.
S2: Form List A and List B
Unselected department
1 2 3 4 5 6 7
Lastly selected department 1: - - O - O U U
4 4 2 2 2 2 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 0
4 4 2 2 1 1 6 6 6 6 7 7 7 7 3
4 4 2 2 1 1 6 6 6 6 7 7 7 7 3
4 4 2 2 1 1 6 6 5 5 5 5 7 7 3
4 4 2 2 1 1 1 1 5 5 5 5 3 3 3
4 4 4 4 1 1 1 1 5 5 5 5 3 3 3
4 4 4 4 1 1 1 1 5 5 5 5 3 3 3
4 4 4 4 1 1 1 1 5 5 5 5 3 3 3
***************************************************************************