Professional Documents
Culture Documents
By
Anastasia L. Maukar
1
Computerized Layout Planning
2
Computerized Layout Planning
3
Computerized Layout Planning
Information in layout planning
Numeric information
Space required for an activity
Total flow between two activities
Logic information
Preferences of the designer, i.e., activity relationship
chart
Graphical information
Drawing of the block plan
4
Computerized Layout Planning
5
Computerized Layout Tech
6
Computerized Layout Technique
Suppose that we are given some space for some departments.
How shall we arrange the departments within the given space?
We shall assume that the given space is rectangular shaped and
every department is either rectangular shaped or composed of
rectangular pieces.
We shall discuss
a layout improvement procedure, CRAFT, that attempts to find
a better layout by pair-wise interchanges when a layout is given
and
a layout construction procedure, ALDEP/CORELAP, that
constructs a layout when there is no layout given.
7
ALDEP
Automated Layout Design Program
8
ALDEP
9
ALDEP
Production area
O
Office rooms A
U I
Storage O E
A X A
Dock area U U
U O
Locker room O
A: absolutely necessary
U E: especially important
Tool room I: important
O: ordinarily important
Figure 1. ARC U: unimportant
X: undesirable
10
ALDEP
The procedure will be explained with an example. Suppose that the
facility is 8 blocks (horizontal) 6 block (vertical).
11
ALDEP
12
ALDEP
Lets start with dock rooms (D). On the upper left corner 8
blocks must be allocated for the dock area.
The sweep width defines the width in number of blocks. Let
sweep width = 2. Then, dock area will be allocated 2 4 =
8 blocks.
D D
D D
D D
D D
13
ALDEP
14
ALDEP
There are only 2 2 = 4 blocks, remaining below dock
area (D). After allocating 4 blocks, the down wall is hit
after which further allocation will be made on the
adjacent 2 (=sweep width) columns and moving
upwards.
D D
D D
D D
D D
S S S S
S S S S 15
ALDEP
See carefully that the allocation started from the upper
left corner and started to move downward with an width
of 2 (=sweep width) blocks.
After the down wall is hit, the allocation continues on the
adjacent 2 (=sweep width) columns on the right side and
starts moving up.
This zig-zag pattern will continue.
Next time, when the top wall will be hit, the allocation will
continue on the adjacent 2 (=sweep width) columns on
the right side and starts moving down.
16
ALDEP
To find the next department to allocate, find the department that
has the highest proximity rating with storage area. Production
area (P) has the highest proximity rating A with the storage
area.
The production area (P) needs 14 blocks.
20
ALDEP
21
ALDEP
Adjacent departments:
(D,S) (D,P)
D D P P P P O O
(S,P) (S,T)
(S,L) (P,T)
D D P P P P O O
(P,O) (T,L) D D P P P P O O
(T,O) (L,O) D D P P T T O O
S S S S T T O O
S S S S L L L L
22
ALDEP
Adjacents Proximity Value Score
Dept Ratings
(D,S) A 64 128
(D,P) I 4 8
(S,P) A 64 128
(S,T) O 1 2
(S,L) U 0 0
(P,T) A 64 128
(P,O) O 1 2
(T,L) U 0 0
(T,O) U 0 0
(L,O) X -1024 -2048
-763 -1526 23
ALDEP
The process is repeated several times and the layout
with the highest score is chosen.
Notice the large negative weight associated with X
ratings.
If the departments which cannot be next to each other,
are adjacent in a layout, then the layout score reduces
significantly.
This is important because ALDEP also uses a cut-off
score (if not specified by the user this cut-off is zero) to
eliminate any layout which has a layout score less than
the cut-off score.
24
CORELAP
25
CORELAP
Importance of Closeness
Line Numerical
Value Closeness
code weights
A Absolutely necessary 32
E Especially important 26
I Important 8
O Ordinary closeness OK 4
U Unimportant 2
X Undesirable -32
CORELAP - STEPS
1. Selection Procedure
27
CORELAP STEP 1
First department: max TCRi
i
Where:
m
TCR i [V(rij )]
j1
Second department:
X-relation last placed department
A-relation with first. If none E-relation with
first, etcetera
28
CORELAP Tie Breaker Rules
Highest TCR
Largest Area
Lowest Dept. Number (random)
29
CORELAP STEP 2
Department areas are converted into grid
squares.
CORELAP does not take the building shape
into account.
The final shape of the facility created by
CORELAP depends on the placement of
departments it has selected.
30
CORELAP STEP 2
Place the first department in the center of the layout
Subsequent department is placed abutting already
placed departments in the position that gives the best
placement rating
After the layout is completed CORELAP calculates a
numerical score for the layout
LayoutScor e CRij d ij
i j i
31
CORELAP STEP 2
8 7 6
1 1st 5
2nd
2 3 4
32
Example of Dept Placements
Contoh: Dept. 1, 2, 3 sudah diletakkan di layout dan dept. 4 akan
diletakkan. Weighted Rating: (assigned by the user)
A = 600 E = 200 I = 50 O = 10 U = 0 X = 200
3 4 2 2 1
2 1 3
3
3
3
4 650
3 4
2
800
(a) (b)
2 1
1 - 4: A
4
2 4: E 850
3
3 4: I
(c) 33
Procedure to Place Departments
Assume that a department is
8 7 6
placed in the middle (position 8 71 0 56
2 3 4
0). Then, if another department
1 Pusat 5
is placed in position 1, 3, 5 or 7,
it is fully adjacent with the 2 3 4
35
Example - CORELAP
CV values:
V(A) = 125
1. Receiving V(E) = 25
A V(I) = 5
2. Shipping A V(O) = 1
E E V(U) = 0
3. Raw Materials Storage A O V(X) = -125
E U U
4. Finished Goods Storage A O U Partial adjacency:
E U U A = 0.5
5. Manufacturing O U E O
A A E U
6. Work-In-Process Storage A
A E
A O U
7. Assembly
O A
8. Offices X O
A
9. Maintenance X
36
Table of TCR Values
Department Summary
Dept. TCR Order
1 2 3 4 5 6 7 8 9 A E I O U X
1 - A A E O U U A O 3 1 0 2 2 0 402 (5)
2 A - E A U O U E A 2 2 0 1 3 0 301 (7)
3 A E - E A U U E A 3 3 0 0 2 0 450 (4)
4 E A E - E O A E U 2 4 0 1 1 0 351 (6)
5 U O A E - A A O A 4 1 0 2 1 0 527 (2)
6 U O U O A - A O O 2 0 0 4 2 0 254 (8)
7 U U U A A A - X A 4 0 0 0 3 1 625 (1)
8 A E E E O O X - X 1 3 0 2 0 2 452 (9)
9 O U A U A O A X - 3 0 0 2 2 1 502 (3)
37
Example (cont.)
62.5 187.5 187.5 62.5
62.5 125 62.5
187.5 5 7 0 125 3 5 7 0
187.5 9 187.5 0
62.5 126.5 9 1.5 0
0.5 1 3 5 7 125
1 2 1 9 4 63.5
0.5 1 0.5
40