Cluster boundary search algorithm for building-block layout optimization

An analytical technique is presented to optimize the layout of building-blocks of unequal areas in a continuous plane. A construction-cum-improvement type algorithm is introduced in which the optimum position of each block is determined by piecewise one-dimensional search on the boundary formed by the cluster of previously placed blocks. The search process is dynamic so that all boundary blocks are continually moved to their optimum positions until no more improvement is possible. The technique is implemented in a computer program which is fully automated and does not require any user interaction to obtain the optimal layout. Comparisons with some recent programs based on analytical and heuristic techniques demonstrate the high computational efficiency of the presented technique making it suitable for solving large-scale layout problems on a PC.