Lecture 5 - Algorithmic Approaches To Layouting
Lecture 5 - Algorithmic Approaches To Layouting
LAYOUTING
Benefits of using algorithms
Enhances the productivity of layout planner and quality
of the final solution
Can be computerized to facilitate computations
Enables the evaluation of many layout alternatives
Layout Algorithm Classification
Classification in terms of data
Quantitative input – flow data
Qualitative input – relationship chart
Classification in terms of objectives
Minimize sum of flows times distances
Maximize adjacency score
Classification in terms of representation
Discrete layout (grid based)
Continuous layout
Layout Algorithm Classification
Classification in terms of primary function
Construction
Improvement
Three Main Algorithms
1. Relationship diagramming - Apple
2. Pair-wise exchange method - Reed
3. Graph-based construction method - Graph Theory
RELATIONSHIP DIAGRAMMING
PROCEDURES
2. Select the second department to enter the layout and place it adjacent to
dept. selected in 1.
The selected department should have an A relationship with the
first department.
It should have the greatest number of A relationships with the
remaining departments.
Ties should be broken using the guidelines presented in 1.
3. Select the third department to enter the layout.
It should have the highest combined relationship with the two
departments already in the layout.
Place the department where it has the strongest relationship.
4. Determine the nth department to enter the layout according to the rules
described in the previous steps.
Example 1: Department Areas and
Number of Unit Area Templates
Code Function Area (ft2) No. of Unit Area
Templates
1 Receiving 12,000 6
2 Milling 8,000 4
3 Press 6,000 3
4 Screw Machine 12,000 6
5 Assembly 8,000 4
6 Plating 12,000 6
7 Shipping 12,000 6
Relationship Chart
Fr\To 1 2 3 4 5 6 7
1 - E O I O U U
2 - U E I I U
3 - U U O U
4 - I U U
5 - A I
6 - E
7 -
Relationship Diagramming Worksheet
REL DEPARTMENTS
1 2 3 4 5 6 7
A 6 5
E 2 1, 4 2 7 6
I 4 5, 6 1, 5 2, 4, 7 2 5
O 3, 5 1, 6 1 3
U 6, 7 3, 7 2, 4, 5, 7 3, 6, 7 3 1, 4 1, 2, 3, 4
X
Solution
Candidate departments to first enter the layout: 5, 6
(Each with one A relationship)
Choose Department 6
Second department to enter the layout: Department 5
Third department to enter is based on highest
combined relationships with Departments 5 and 6.
Solution
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E 6
I 5, 6 5 5
O 5 6
U 6 5 6
X
Solution
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E
I 5, 6 5
O 5 6
U 6, 7 7 5, 7 6, 7
X
Solution
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E 2 2
I 5
O 5 6
U 6, 7 2, 5, 7 6, 7
X
Solution
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E 2
I 4
O 5 6
U 6, 7 2, 4, 5, 7
X
FINAL (MASSAGE) LAYOUT
1 1 1
4 4 1 1
4 4 3 1
4 2 3 3
4 2 2 2
5 6 6 6
5 6 6 6
5 7 7 7
5 7 7 7
Pair-wise exchange method
Improvement-type layout algorithm
It uses distance-based objective
Assumes that the departments have equal distances from
each other
PAIRWISE EXCHANGE METHOD FOR LAYOUT
IMPROVEMENT
3 5
Hypothetical 4
Initial
Layout
1 2 3 4
1 1 2 3 Distance
2 1 2 Matrix
3 1
4
Iteration 0
1 2 3 4 1 2 3 4
1 10 15 20 1 1 2 3
2 10 5 2 1 2
3 5 3 1
4 4
Iteration 1 1 2 3 4
The
distance 1 1 1 2
matrix
is 2 2 3
changed 3 1
because
of this 4
1. From the relationship chart, select the department pair with the
largest weight.
2. Select the third department to enter. The third department is chosen
based on the sum of weights wrt the departments selected in 1.
3. Select the fourth department by evaluating the value of adding one
of the unassigned departments represented by a node on the face of
the graph. A face of a graph is a bounded region of a graph.
4. Continue the process by determining which face to insert the
remaining departments.
5. Having determined the adjacency graph, reconstruct a block layout.
Example
Choose
5 Department
2 3 and 4
Since they
have the
4 highest
3 weight
Iteration 1
Dept 3 4 Total
1 8 10 18
2 12 13 25
5 0 2 2
Iteration 2
Dept 2 3 4 Total
1 9 8 10 27
5 7 0 2 9
Iteration 3
Dept 1 2 3 4 Total
5 0 7 0 2 2
Faces 1 2 3 Total
1-2-3 0 7 0 7
1 2 4
Arbitrarily
1-2-4 0 7 2 9
Choose 1-2-4
1 3 4
1-3-4 0 0 2 2
2 3 4
2-3-4 7 0 2 9
Layout Score = 81
Relationship Diagramming Worksheet
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E
I
O
U
X
Solution
REL DEPARTMENTS
1 2 3 4 5 6 7
A
E
I
O
U
X