A simple genetic algorithm for dynamic facility layout problems

A Simple Genetic Algorithm (SGA) is presented in this study for tackling Dynamic Facility Layout Problems (DFLPs). The method employs genetic operators such as roulette wheel selection, single point crossover, and swap mutation. The termination conditions are defined to that same maximum number of generations. The algorithm is put to the test on 48 different test cases with six different problem sizes. Despite the fact that the results achieved are not as good as those published in other literatures, this work serves as a starting point for the creation of genetic algorithm-based hybrid algorithms with improved performance.