MANUFACTURING CELL-FORMATION USING SIMILARITY COEFFICIENTS AND A PARALLEL GENETIC TSP ALGORITHM - FORMULATION AND COMPARISON
Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature. The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers.
similarity coefficients cellular manufacturing traveling salesman problem parallel genetic algorithms group technology