Machine-Part Cell Formation Problem Using a Group Based League Championship Algorithm

This article proposes a new algorithm for grouping problems that is a grouping version of league championship algorithm (GLCA). We compare the performance of GLCA with several well-known algorithms published in the present literature and select a set of 20 most widely used benchmarks of cell formation sample problems posing as a grouping problem. We used a truncated geometric algorithm to find the number of initial cells. Our computations reveal that GLCA can reach the best-known solution for 17 of the 20 benchmark problems, and improve the solution of three others with a 1.4% average gap.

[1]  Larry R. Taube,et al.  The facets of group technology and their impacts on implementation--A state-of-the-art survey , 1985 .

[2]  Andrew Kusiak,et al.  Grouping of parts and components in flexible manufacturing systems , 1986 .

[3]  Nancy Lea Hyer,et al.  Research issues in cellular manufacturing , 1987 .

[4]  M. Chandrasekharan,et al.  GROUPABIL1TY: an analysis of the properties of binary data matrices for group technology , 1989 .

[5]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[6]  M. Chandrasekharan,et al.  MODROC: an extension of rank order clustering for group technology , 1986 .

[7]  Tai-Hsi Wu,et al.  A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator for manufacturing cell formation problems , 2009 .

[8]  D. A. Milner,et al.  Direct clustering algorithm for group formation in cellular manufacture , 1982 .

[9]  Tai-Hsi Wu,et al.  A simulated annealing algorithm for manufacturing cell formation problems , 2008, Expert Syst. Appl..

[10]  Hamid Seifoddini,et al.  A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications , 1989 .

[11]  Larry E. Stanfel,et al.  Machine clustering for economic production , 1985 .

[12]  Larry R. Taube,et al.  Weighted similarity measure heuristics for the group technology machine clustering problem , 1985 .

[13]  Jacques A. Ferland,et al.  Genetic algorithm and large neighbourhood search to solve the cell formation problem , 2012, Expert Syst. Appl..

[14]  Allan S. Carrie,et al.  Numerical taxonomy applied to group technology and plant layout , 1973 .

[15]  Ali Husseinzadeh Kashan,et al.  League Championship Algorithm: A New Algorithm for Numerical Function Optimization , 2009, 2009 International Conference of Soft Computing and Pattern Recognition.

[16]  Bhaba R. Sarker,et al.  Measures of grouping efficiency in cellular manufacturing systems , 2001, Eur. J. Oper. Res..

[17]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[18]  M. Chandrasekharan,et al.  An ideal seed non-hierarchical clustering algorithm for cellular manufacturing , 1986 .

[19]  Anthony Vannelli,et al.  Strategic subcontracting for efficient disaggregated manufacturing , 1986 .

[20]  Ronald G. Asktn,et al.  A cost-based heuristic for group technology configuration† , 1987 .

[21]  Ali Husseinzadeh Kashan,et al.  A differential evolution algorithm for the manufacturing cell formation problem using group based operators , 2010, Expert Syst. Appl..

[22]  Evelyn C. Brown,et al.  CF-GGA: A grouping genetic algorithm for the cell formation problem , 2001 .

[23]  D. Lei *,et al.  Tabu search approach based on a similarity coefficient for cell formation in generalized group technology , 2005 .

[24]  Tabitha L. James,et al.  A hybrid grouping genetic algorithm for the cell formation problem , 2007, Comput. Oper. Res..