An Efficient Hybrid Algorithm for Dynamic Facility Layout Problem using Simulation Technique and PSO

One of the most important and effective issues of today's manufacturing companies, is how to arrange their facilities in the most economic manner. different methods and approaches have been examined by researchers to address the so-called facility layout problem (flp). as a combinatorial problem flp is a np-hard one, and so the classic and exact optimization methods just can be useful for small scale problems. therefore, developing meta-heuristic algorithms in order to solve and analyze such problems has been focused by many researchers. in this research, a new hybrid heuristic method is developed by the combination of discrete particle swarm optimization (pso) algorithm and simulation technique to address dynamic facility layout problem (dflp) which is the main contribution of the current study. the proposed algorithm uses simulation modelling to produce some feasible solutions for the problem and then the pso algorithm starts with these solutions as initial particles and moves toward the near optimum solutions. to indicate the efficiency of the proposed algorithm, several test problems taken from the literature have been examined and the results were compared to other algorithms. as the computational results reveal, the quality of solutions and the algorithm speed are suitable enough to be used in the real world problems. also, the proposed algorithm could be used in other combinatorial problems as a general heuristic algorithm.