6.

Layout By Graph Theory

The graph based method is construction type layout algorithm, it has its roots in the
graph theory. It is often used with an adjacency based objective.
It uses From To chart of Activity Relation chart.
It is construction method ( Layout is generated )

6.1. Basic Concepts of the Graph Theory

It net work graph to determine neighboring departments and represented by drawing the
follow:
1. Circle for department and called Node.
2. Line or curve represent relation or weight between departments and called Arc
( arrow ).
Notes:
For each arrow two faces;

External face: if arrow face is no limited by any other arrow ( open )

Internal face: if arrow face is limited by other arrow ( closed )

Neighboring concept:

Two departments are neighbored, when the arrow drawn between them without
cross ( to achieve an adequate layout, try all arrows are not crossed ).
Achieving uncrossed arrow is called Planarity Graph ( crossed arrows are not
taken into account ). If this is not achieved, then it is called Non Planar Graph.
Calculating weights:

No need to find the distance between departments.

Weights are value of relation between departments

The weight of not crossed arrows are summed to give Score for each alternative
( best layout which attained Maximum Score )
Example -1:
Consider the layout of five equal sized departments. The material flow matrix is given
below. Find the final adjacency graph using the graph based method.

81
 A B C D E

A 9 8 10 0

B 12 13 7

C 20 0

D 0

Solution:

7
13
B D
12 0
9 20 E
0
10
A C
8 0

Initial Layout

According to the notes mentioned before: redraw the network free of crossed arrows

A Arc wt. E Arc wt.

A-B 9 A-B 9
A-E 0 A A-D 10
B-C 12 A-E 0
E B-D 13 B-C 12
B B-E 7 B B-D 13
C-D 20 B-E 7
D-E 2 C-D 20

D 63 D 71
C
C

82
Step-1:
Select two department have the largest value between each other ( if there is any tie
select one of the randomly ).

A B C D E

A 9 8 10 0

B 12 13 7
20
C 20 0 C D

D 0

Step-2:
Select the third department which has the largest value.

Total B
C D
12 13
A 8 10 18

B 12 13 25 Best
20
C D
E 0 2 2

Step-3:
Select next department, when the relation value is largest with the previously selected
department. This department is placed within closed arrows which internal and external
faces can be recognized and without causing crossing arrows.

83
 B C D Total
B
A 9 8 10 27 Best
9
12 13
E 7 0 2 9
A
8 10

20
C D

Step-4:
Step 3 is repeated until all departments are selected. In this example the 5th department,
the relation values are calculated for the faces and largest value is selected. Then the
department is placed inside that face.

A B C D Faces Total

E 0 7 0 2 A-B-C 7

A-B-D 9 Best

A-C-D 2

B-C-D 9 Best

7
12 13
9

0 E
A 2
8 10
10
C D
20

Step-5:
Calculate the score and find the largest score

84
 Arc Weight
B A-B 9
A-C 8
A-D 10
7 A-E 0
12 13
9 B-C 12
B-D 13
B-E 7
0 E C-D 20
D-E 2
A 2
8 10
81
10
C D
20

Step-6:
To develop the layout, put point between faces internally and externally. The points are
joints to give the departments boundary. Thus diagrammatic shape can be drawn.

12 B 13

9 7

E
8 A 0

C
10 2

20
D

85
 Assignment # 6

Q.1:
The from to material flow matrix for an five departments facility is given in the table
below. Based on the graph based construction method, develop a block layout.

A B C D E Area

A 10 50 30 0 500

B 0 45 40 30 500

C 0 25 35 5 340

D 30 5 20 40 630

E 20 30 5 10 630

Q.2:
The from to material flow matrix for an eight departments facility is given in the
table below. Based on the graph based construction method, develop a block layout.

A B C D E F G H Area

A 302 0 0 0 66 0 68 2800

B 504 20 136 154 56 40 2100

C 76 352 0 122 94 2600

D 0 0 180 8 400

E 122 0 282 600

F 188 24 400

G 296 2300

H 1800

86