Pairwise Exchange Method
-Used to redesign an existing facility, which is typically
triggered by :
•addition of new machines,
•changes in product mixes,
•decisions related to the contraction and expansion of storage areas,
or
•a simple realization that the old layout is no longer adequate for its
current needs.
Pairwise Exchange Method
- It is like an algorithm that research for a good layout from a given initial layout.
1 2 3 4
1m 1m 1m
Distance 1-4 = 20 x 3 = 60 meters
TC1234 = 10(1m) + 15(2m) + 20(3m) + 10(1m) + 5(2m) + 5(1m) = 125 meters
Material Flow Matrix Distance Matrix
1 2 3 4 1 2 3 4
1 - 10 15 20 1 - 1m 2m 3m
2 - 10 5 2 - 1m 2m
3 - 5 3 - 1m
4 - 4 -
1 2 3 4
1m 1m 1m
TC = 20(3) = 60m
Material Flow Matrix Distance Matrix
1 2 3 4 1 2 3 4
1 - 10 15 20 1 - 1m 2m 3m
2 - 10 5 2 - 1m 2m
3 - 5 3 - 1m
4 - 4 -
1 4 3 2
1m 1m 1m
TC = 10(3) + 15(2) + 20(1) + 10(1) + 5(2) + 5(1) = 105
TC = 20(1) = 20m
Material Flow Matrix Distance Matrix
1 2 3 4 1 2 3 4
1 - 10 15 20 1 - 4m 2m 1m
2 - 10 5 2 - 1m 2m
3 - 5 3 - 1m
4 - 4 -
initial 1 2 3 4
1st
TC1234 = 10(1m) + 15(2m) + 20(3m) + 10(1m) + 5(2m) + 5(1m) = 125 Iteration
1-2 2 1 3 4
TC = 10(1) + 15(1) + 20(2) + 10(2) + 5(3) + 5(1) = 105
1-3 3 2 1 4
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95
1-4 4 2 3 1
TC = 10(2) + 15(1) + 20(3) + 10(1) + 5(1) + 5(2) = 120
2-3 1 3 2 4
TC = 10(2) + 15(1) + 20(3) + 10(1) + 5(1) + 5(2) = 120
2-4 1 4 3 2
TC = 10(3) + 15(2) + 20(1) + 10(1) + 5(2) + 5(1) = 105
3-4 1 2 4 3
TC = 10(1) + 15(3) + 20(2) + 10(2) + 5(1) + 5(1) = 125
initial 1 2 3 4
1st
TC1234 = 10(1m) + 15(2m) + 20(3m) + 10(1m) + 5(2m) + 5(1m) = 125 Iteration
1-2 2 1 3 4
TC = 10(1) + 15(1) + 20(2) + 10(2) + 5(3) + 5(1) = 105
1-3 3 2 1 4
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95
1-4 4 2 3 1
TC = 10(2) + 15(1) + 20(3) + 10(1) + 5(1) + 5(2) = 120
2-3 1 3 2 4
TC = 10(2) + 15(1) + 20(3) + 10(1) + 5(1) + 5(2) = 120
2-4 1 4 3 2
TC = 10(3) + 15(2) + 20(1) + 10(1) + 5(2) + 5(1) = 105
3-4 1 2 4 3
TC = 10(1) + 15(3) + 20(2) + 10(2) + 5(1) + 5(1) = 125
initial 1 2 3 4
1st
TC1234 = 10(1m) + 15(2m) + 20(3m) + 10(1m) + 5(2m) + 5(1m) = 125 Iteration
New
Layout 3 2 1 4
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95
New Layout 3 2 1 4
2nd
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95 Iteration
1-2 3 1 2 4
TC = 10(1) + 15(1) + 20(2) + 10(1) + 5(1) + 5(3) = 95
1-3 1 2 3 4
TC = 10(1) + 15(2) + 20(3) + 10(1) + 5(2) + 5(1) = 125
1-4 3 2 4 1
TC = 10(2) + 15(3) + 20(1) + 10(1) + 5(1) + 5(2) = 110
2-3 2 3 1 4
TC = 10(2) + 15(1) + 20(1) + 10(1) + 5(3) + 5(2) = 90
2-4 1 4 3 2
TC = 10(1) + 15(2) + 20(1) + 10(3) + 5(2) + 5(2) = 105
3-4 1 2 4 3
TC = 10(1) + 15(1) + 20(2) + 10(2) + 5(1) + 5(3) = 105
New Layout 3 2 1 4
2nd
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95 Iteration
1-2 3 1 2 4
TC = 10(1) + 15(1) + 20(2) + 10(1) + 5(1) + 5(3) = 95
1-3 1 2 3 4
TC = 10(1) + 15(2) + 20(3) + 10(1) + 5(2) + 5(1) = 125
1-4 3 2 4 1
TC = 10(2) + 15(3) + 20(1) + 10(1) + 5(1) + 5(2) = 110
2-3 2 3 1 4
TC = 10(2) + 15(1) + 20(1) + 10(1) + 5(3) + 5(2) = 90
2-4 1 4 3 2
TC = 10(1) + 15(2) + 20(1) + 10(3) + 5(2) + 5(2) = 105
3-4 1 2 4 3
TC = 10(1) + 15(1) + 20(2) + 10(2) + 5(1) + 5(3) = 105
Previous Layout 3 2 1 4 2nd
TC = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95 Iteration
New
Layout 2 3 1 4
TC = 10(2) + 15(1) + 20(1) + 10(1) + 5(3) + 5(2) = 90
New Layout 2 3 1 4
3rd
TC = 10(2) + 15(1) + 20(1) + 10(1) + 5(3) + 5(2) = 90 Iteration
TC1324 = 10(2) + 15(1) + 20(3) + 10(1) + 5(1) + 5(2) = 120
TC2134 = 10(1) + 15(1) + 20(2) + 10(2) + 5(3) + 5(1) = 105
TC2341 = 10(3) + 15(2) + 20(1) + 10(1) + 5(2) + 5(1) = 105
TC3214 = 10(1) + 15(2) + 20(1) + 10(1) + 5(2) + 5(3) = 95
TC4312 = 10(1) + 15(1) + 20(2) + 10(2) + 5(3) + 5(1) = 105
TC2413 = 10(2) + 15(1) + 20(1) + 10(3) + 5(1) + 5(2) = 100
Since the possible changes resulted in increase then the previous
Layout is the best. Therefore the best is : 2-3-1-4
Graph-Based Construction Method
are among the most active approaches to
semi-supervised learning. This occurs
mainly due to their ability to deal with local
and global characteristics of available
data, identify classes or groups regardless
the data shape.
Graph-Based Construction Method
Construction => new layout
Steps:
1. Build a graph that represents adjacency
2. Convert to block layout
3. Evaluate block layout (usually A-based)
Graph-Based Method
• The graph-based method is a construction-type
layout algorithm.
• It is often used with an adjacency-based
objective.
• Finding a maximally weighted block layout is
equivalent to obtaining an adjacency graph with
the maximum sum of ARC weight.
• End......
