Genetic search and the dynamic layout problem

An improved genetic algorithm for the dynamic layout problem is developed and tested in this research. Our genetic algorithm differs from the existing implementation in three ways: first, we adopt a different crossover operator, second, we use mutation, and third, we use a new generational replacement strategy to help increase population diversity. A computational study shows that the proposed GA is quite effective.