Optimization planning of low-rise residential buildings

This paper presents a novel heuristic algorithm to solve the problem of optimal planning low-rise residential buildings. For this problem, many engineering companies try to use efficient methods to reduce costs. Firstly, it is shown that a comprehensive search is only effective on a small number of data. Then, a novel heuristic algorithm is proposed, which handles large amounts of data efficiently. The heuristic algorithm for planning one-storied buildings has been designed. On the basis of this algorithm, an algorithm for planning low-rise buildings has been developed (the algorithm was tested on three-four-storied buildings). The results are compared with those of the algorithm optimization based on comprehensive search. All test cases have shown that the algorithm at low dimension gives the best results. Computation time of the heuristic algorithm is different from the that of the comprehensive search by hundreds of times.