The Heuristic Methods of Dynamic Facility Layout Problem

Abstract

The hybrid heuristic simulation algorithms for dynamic facility layout problem (DFLP) have been proposed in this paper. By the combination of genetic algorithm and simulated annealing, we develop two heuristic methods and design the process of the algorithms with the forecasting and backtracking strategies in order to obtain the optimal solutions. Finally, a lot of experiments have been performed to reduce the random property of the algorithms. The simulation experiments have shown that the two combined heuristic algorithms proposed in this paper have much better performance than the other algorithms proposed in the reference when solving the sequential coding problem, especially in solving large-size problems. © Springer-Verlag Berlin Heidelberg 2014.