Article ID: | iaor1988133 |
Country: | United Kingdom |
Volume: | 13 |
Issue: | 4 |
Start Page Number: | 317 |
End Page Number: | 330 |
Publication Date: | Jul 1988 |
Journal: | Engineering Optimization |
Authors: | Bhowmik R., Ramakrishnan C.V., Krishnamoorthy S. |
Keywords: | allocation: resources, programming: integer |
The paper presents a branch and bound algorithm and an iterative heuristic algorithm for the optimal location of clusters in a multistorey building. The use of cluster analysis is proposed for grouping highly related activities. The vertical layout problem is formulated mathematically. Results obtained by both the algorithms are compared. Some practical problems are solved and the cost comparison made.