Genetic algorithm approach for solving a cell formation problem in cellular manufacturing

Cellular manufacturing (CM) is an industrial application of group technology concept. One of the problems encountered in the implementation of CM is the cell formation problem (CFP). The CFP attempted here is to group machines and parts in dedicated manufacturing cells so that the number of voids and exceptional elements in cells are minimized. The proposed model, with nonlinear terms and integer variables, cannot be solved for real sized problems efficiently due to its NP-hardness. To solve the model for real-sized applications, a genetic algorithm is proposed. Numerical examples show that the proposed method is efficient and effective in searching for optimal solutions. The results also indicate that the proposed approach performs well in terms of group efficacy compared to the well-known existing cell formation methods.