A meta-heuristic approach for cell formation problem

  • Authors:
  • Tuyen Dinh;Tien Dinh;Jacques Ferland

  • Affiliations:
  • University of Science, VNU-HCMC, Nguyen Van Cu, Ho Chi Minh City, Vietnam;University of Science, VNU-HCMC, Nguyen Van Cu, Ho Chi Minh City, Vietnam;Université de Montréal, Succ. Centre-Ville, Montréal (Québec)

  • Venue:
  • Proceedings of the Second Symposium on Information and Communication Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cell Formation Problem (CFP) is used widely in Cellular Manufacturing. However, until now very few test cases out of 35 cases have been proved optimality [8]. The others are just feasible. In this paper, we apply 2 different meta-heuristic approaches which are Simulated Annealing and Tabu Search to find feasible solutions in a reasonable time. Then, we compare our results with that of the Genetic Algorithm [7] on the same 35 test data. In our experiments, the Tabu Search approach shows equal or better solutions than Genetic Algorithm and Simulated Annealing on all test data.