An Optimal Spatial Layout Based on Genetic Algorithm

Layout problems are found in various kinds of industrial design applications. Because the process of layout includes many kinds of combinational conditions, it is difficult and computationally time-consuming to find the optimal solution by using the traditional mathematical programming methods. In this paper we proposed an algorithm for optimal layout problems based on genetic algorithm. The genetic algorithm with a new encoding scheme and a new genetic operator is used for handling the combinations of layout problems with the two-dimensional polygons, and every individual in population is a layout scheme. Many kinds of heuristic location strategies are proposed to help for determining the exact layout so as to minimize the fitness value in the genetic algorithm and decrease the amount of computation. We presented a simulation experiment for demonstrating the effectiveness by this method.