Genetic search and the dynamic facility layout problem

This research examines the suitability of genetic algorithms to the problem of facility layout over time. Genetic algorithms use the principles of genetics to evolve an initial population of solutions into a population of superior solutions. One advantage of this approach is its ability to include multiple constraints as well as non-linear and non-convex objective functions. The authors present a genetic procedure for the multi-period facility layout problem and report results for two test problems.