论文信息 - COMPARISON OF BRANCH AND BOUND AND ITERATIVE HEURISTIC ALGORITHMS FOR FLOOR ALLOCATION OF ACTIVITY CLUSTERS IN MULTISTOREY BUILDINGS

COMPARISON OF BRANCH AND BOUND AND ITERATIVE HEURISTIC ALGORITHMS FOR FLOOR ALLOCATION OF ACTIVITY CLUSTERS IN MULTISTOREY BUILDINGS

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

R. Bhowmik | S. Krishnamoorthy | C. V. Ramakrishnan

[1] Robin Liggett. The Quadratic Assignment Problem: An Analysis of Applications and Solution Strategies , 1980 .

[2] B. Whitehead,et al. The use of cluster analysis in multi-storey layout planning , 1975 .

[3] B. Whitehead,et al. A study of movement in a school building , 1968 .

[4] Robin Liggett,et al. The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies , 1981 .

[5] P. C. Portlock,et al. Three dimensional layout planning , 1974 .

[6] B. Whitehead,et al. The planning of single-storey layouts , 1965 .

[7] M. Bazaraa. Computerized Layout Design: A Branch and Bound Approach , 1975 .

[8] William J. Mitchell,et al. Optimal space planning in practice , 1981 .