Solving a dynamic cell formation problem using metaheuristics

In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), simulated annealing (SA) and tabu search (TS). Most of previous researches were done under the static condition. Due to the fact that CF is a NP-hard problem, then solving the model using classical optimization methods needs a long computational time. In this research, a nonlinear integer model of CF is first given and then solved by GA, SA and TS. Then, the results are compared with the optimal solution and the efficiency of the proposed algorithms is discussed.

• Type: Journal
• Year: 2005
• Where: AMC
• Authors: Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima Safaei, Amir Azaron
• Keywords: AMC 2005, Classical Optimization Methods, Long Computational Time, Traditional Metaheuristic Methods