Cell formation in group technology: review, evaluation and directions for future research
Computers and Industrial Engineering - Cellular manufacturing systems: design, analysis and implementation
A heuristic algorithm for machine assignment in cellular layout
Computers and Industrial Engineering
Heuristic approaches for part assignment in cell formation
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Modified p-median approach for efficient GT cell formation
Computers and Industrial Engineering
An evolutionary algorithm for manufacturing cell formation
Computers and Industrial Engineering
A hybrid grouping genetic algorithm for the cell formation problem
Computers and Operations Research
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
A multi-objective scatter search for a dynamic cell formation problem
Computers and Operations Research
Genetic algorithm approach for solving a cell formation problem in cellular manufacturing
Expert Systems with Applications: An International Journal
The sustainable cell formation problem: manufacturing cell creation with machine modification costs
Computers and Operations Research
An ant colony optimization metaheuristic for machine-part cell formation problems
Computers and Operations Research
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
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.