Enhanced Imperialist Competitive Algorithm for the Cell Formation Problem Using Sequence Data

Imperialist Competitive Algorithm (ICA) is a recent meta-heuristic method that is inspired by the social evolutions for solving NP-Hard problems. The ICA is a population-based algorithm which has achieved a great performance in comparison to other metaheuristics. This study is about developing enhanced ICA approach to solve the Cell Formation Problem (CFP) using sequence data. In addition to the conventional ICA, an enhanced version of ICA, namely EICA, applies local search techniques to add more intensification aptitude and embed the features of exploration and intensification more successfully. Suitable performance measures are used to compare the proposed algorithms with some other powerful solution approaches in the literature. In the same way, for checking the proficiency of algorithms, forty test problems are presented. Five benchmark problems have sequence data, and other ones are based on 0-1 matrices modified to sequence based problems. Computational results elucidate the efficiency of the EICA in solving CFP problems. Keywords—Cell formation problem, Group technology, Imperialist competitive algorithm, Sequence data.

[1]  Warren J. Boe,et al.  A close neighbour algorithm for designing cellular manufacturing systems , 1991 .

[2]  Philip M. Wolfe,et al.  Application of the Similarity Coefficient Method in Group Technology , 1986 .

[3]  Ali Safari Mamaghani,et al.  An application of Imperialist Competitive Algorithm to solve the quadratic assignment problem , 2011, 2011 International Conference for Internet Technology and Secured Transactions.

[4]  Mostafa Zandieh,et al.  An imperialist competitive algorithm to schedule of receiving and shipping trucks in cross-docking systems , 2010 .

[5]  Tabitha L. James,et al.  Grouping efficiency measures and their impact on factory measures for the machine-part cell formation problem: A simulation study , 2007, Eng. Appl. Artif. Intell..

[6]  Liang Gao,et al.  Optimization of process planning with various flexibilities using an imperialist competitive algorithm , 2012 .

[7]  Albert P. M. Wagelmans,et al.  Models and solution approaches for complex production planning and scheduling , 2008 .

[8]  Iraj Mahdavi,et al.  An integrated model for solving cell formation and cell layout problem simultaneously considering new situations , 2013 .

[9]  Hadi Moradi,et al.  An imperialist competitive algorithm for a mixed-model assembly line sequencing problem , 2013 .

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

[11]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[12]  T.-H. Wu,et al.  A tabu search approach to the cell formation problem , 2004 .

[13]  Stella Sofianopoulou,et al.  An efficient ant colony optimization system for the manufacturing cells formation problem , 2008 .

[14]  John M. Wilson,et al.  The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research , 2010, Eur. J. Oper. Res..

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

[16]  Liang Gao,et al.  A modified colonial competitive algorithm for the mixed-model U-line balancing and sequencing problem , 2012 .

[17]  P. Waghodekar,et al.  Machine-component cell formation in group technology: MACE , 1984 .

[18]  Marc Gravel,et al.  Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm , 1998, Eur. J. Oper. Res..

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

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

[21]  T. T. Narendran,et al.  CASE: A clustering algorithm for cell formation with sequence data , 1998 .

[22]  Mostafa Zandieh,et al.  The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm , 2012 .

[23]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[24]  A. Kusiak,et al.  Efficient solving of the group technology problem , 1987 .

[25]  Majid Yousefikhoshbakht,et al.  New Imperialist Competitive Algorithm to solve the travelling salesman problem , 2013, Int. J. Comput. Math..

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

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

[28]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[29]  Hamid Seifoddini,et al.  Single linkage versus average linkage clustering in machine cells formation applications , 1989 .

[30]  F. Boctor.  A Jinear formulation of the machine-part cell formation problem , 1991 .

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

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

[33]  J. King,et al.  Machine-component group formation in group technology: review and extension , 1982 .

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

[35]  Mostafa Zandieh,et al.  A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties , 2013 .

[36]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

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

[39]  Tai-Hsi Wu,et al.  A water flow-like algorithm for manufacturing cell formation problems , 2010, Eur. J. Oper. Res..

[40]  R. Sudhakara Pandian,et al.  Manufacturing cell formation with production data using neural networks , 2009, Comput. Ind. Eng..

[41]  Siamak Talatahari,et al.  Optimum design of skeletal structures using imperialist competitive algorithm , 2010 .

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

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

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

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

[46]  M. Chandrasekharan,et al.  ZODIAC—an algorithm for concurrent formation of part-families and machine-cells , 1987 .

[47]  S. H. Tang,et al.  BASE: A bacteria foraging algorithm for cell formation with sequence data , 2010 .

[48]  Iraj Mahdavi,et al.  CLASS: An algorithm for cellular manufacturing system and layout design using sequence data , 2008 .

[49]  Mauricio G. C. Resende,et al.  An evolutionary algorithm for manufacturing cell formation , 2004, Comput. Ind. Eng..