Consider the following layout problem.

Basic Data:

(i) Number of departments in the layout = 6

(ii) Areas of departments:

Department Area (sq.m.)

1 16,000 2 24,000 3 10,000 4 20,000 5 16,000 6 12,000

(iii) The relationship chart:

From

(iv) Minimum department preference value (MDP) = I = 4.
(v) Sweep width = 2 (vi) Number of iterations to be performed = 2.
Apply ALDEP algorithm to design a suitable layout by performing two iterations.AppendixLO1

Transcribed Image Text:

1 - 2 A - 3 O U = 4 E E I - 5 I A U I - 6 E I 0 E A To 1 2 3 4 10 - 5 6