A hybrid algorithm for budget constrained dynamic facility layout problem

In nowadays fluctuating environment, demand of products changes and in most cases, the material handling cost increases. This matter necessitates rearrangement of the facilities to improve the efficiency of the facility layout. This research investigates the dynamic facility layout problem (DFLP) under the main constraint on the layoutrearrangement funds. Because constrained DFLP is a NP-hard problem, traditional exact procedures could not find optimal solution for medium and large size problems. This paper presents a new genetic algorithm (GA) for the constrained DFLP. Some numerical experiments are solved by this algorithm and the obtained results are compared toan existing heuristic algorithm that has been used to solve the problem thus far. To improve the efficiency of the proposed algorithm, a hybrid GA-SA algorithm is developed for this problem. The results indicate that the proposed algorithms are more effective than the existing ones in both quality and computational time.

Keywords:

Dynamic facility layout problem , Budget constraint , simulated annealing , Genetic algorithm , Hybrid GASA.