a new optimization via invasive weeds algorithm for dynamic facility layout problem

The dynamic facility layout problem (dflp) is the problem of finding positions of departments on the plant floor for multiple periods (material flows between departments change during the planning horizon) such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasive weeds optimization (iwo) is utilized to solve the well-known dflp. iwo is a simple algorithm which uses basic characteristics of a colony of weeds such as proliferation, growth and competition. a set of reference numerical problems is taken in order to evaluate the efficiency of the algorithm compared with the dynamic programming method which had been applied to solve the addressed problem. in order to verify the efficiency of the proposed algorithm a wide range of experiments are carried out to compare the proposed algorithm. computational results have indicated that the diwo algorithm is capable of obtaining optimal solutions for small and medium-scaled problems very efficiently.