MULTI-LEVEL BUILDING LAYOUT WITH DIMENSION CONSTRAINTS ON DEPARTMENTS
The branch and bound techniques based on cut tree and eigenvector have been introduced in the literature[1, 2, 3, 6, 9, 10]. These rechniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.