Solving Multiobjective Dynamic Facility Layout Problem Using a Hybrid Local Search-Simulated Annealing Algorithm

Dynamic facility layout problem (DFLP) is locating departments in different time zones where the location of each department may be varied at the beginning of each period. Traditionally, this problem is constructed based on the minimization of total handling cost, while more objectives could be considered in designing an efficient layout, like activity relationship, department closeness and etc. In this article DFLP is considered by two minimization of the total handling cost and maximization of total activity relationships. This problem is then solved by a new hybrid heuristic algorithm using local search supplemented by simulated annealing. This algorithm is so powerful to generate pareto solutions in such a way that both of convergence and diversity properties are evident.