Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem

Today’s manufacturing plants tend to be more flexible due to rapid changes in product mix and market demand. Therefore, this paper investigates the problem of location and relocation (when there are changes incurred to the material flows between departments) manufacturing facilities such that the total cost of material flows and relocation costs are minimized. This problem is known as the dynamic facility layout problem (DFLP), which is a general case of static facility layout problem. This paper proposes a robust and simply structured hybrid technique based on integrating three meta-heuristics: imperialist competitive algorithms, variable neighborhood search, and simulated annealing, to efficiently solve the DFLP. The novel aspect of the proposed algorithm is taking advantage of features of all above three algorithms together. To test the efficiency of our algorithm, a data set from the literature is used for the experimental purpose. The results obtained are quite promising in terms of solution quality for most of the test problems.