Article ID: | iaor19921690 |
Country: | United States |
Volume: | 10 |
Issue: | 1 |
Start Page Number: | 44 |
End Page Number: | 72 |
Publication Date: | Jan 1991 |
Journal: | Journal of Operations Management |
Authors: | Miltenburg John, Zhang Wenjiang |
Keywords: | computational analysis, heuristics |
Nine algorithms, developed to solve the cell formation problem, are evaluated and compared for their ability to produce good solutions to large problems. A primary performance measure and two secondary performance measures are presented for gauging the quality of a solution to be the cell formation problem. Eight problems from the open literature and 60 randomly generated, large problems are analyzed. The analysis shows that there is no solution algorithm that performs better on all performance measures for problems from both the literature and the randomly generated data sets. One algorithm, called the ISNC algorithm and based on clustering around seeds, performs significantly better than all other algorithms on the primary performance measure (and performs well on the secondary measures) for the randomly generated data set, and performs well for the problems from the literature. Therefore this algorithm appears to be the most appropriate algorithm to use as a