Performance Comparison of Particle Swarm Optimization and Genetic Algorithm Combined with A* Search for Solving Facility Layout Problem

Abstract

Optimization metaheuristics have become necessary due to the growing demand for better and more realistic designs. This paper proposes a metaheuristic-based approach for solving design problems in a reasonable time while browsing large spaces of solutions. The objective of this article is to compare the performance of two methods Genetic Algorithm GA and Particle swarm optimization PSO, combined with A* algorithm, in solving a constrained facility layout problem. The two chosen metaheuristics have been successfully applied in many search problems. We consider their speed and performance. The performance of the obtained solutions is measured in terms of the total distance traveled by products in the workshop. In order to determine the shortest path in a realistic way between workstations in a given irregular area (with aisle structure, or material storage areas, lunchrooms and offices), the A* algorithm was integrated with them. The comparison therefore concerns <GA, A*> and <PSO, A*>. GA and PSO algorithms generate configurations for which the shortest path for any couple of machines is identified through the A* search algorithm taking into account of obstacles. The mathematical model used and the parameters of the genetic algorithm are those developed in (Besbes et al. 2019). The numerical results show the feasibility and effectiveness of both approaches. Our results demonstrate that GA yields a better solution than Particle Swarm Optimization in total distance travelled while PSO is faster.