A hybrid genetic algorithm for the dynamic plant layout problem

The dynamic plant layout problem (DPLP) deals with the design of multi-period layout plans. Although an optimal solution method based on dynamic programming is available, it is not practical for large DPLPs. It has recently been shown that heuristics based on genetic algorithms can solve large DPLPs. In this research, we extend and improve the use of genetic algorithms by creating a hybrid algorithm. A computational study is carried out to compare the proposed algorithm with the existing genetic algorithms and a recent simulated annealing algorithm. The study shows that the proposed algorithm is effective. Thus it may be useful in solving the larger problems.