Manufacturing Cell Formation Problem Using Hybrid Cuckoo Search Algorithm

Cellular manufacturing, as one of the most important applications of Group Technology, has gained popularity in both academic research and industrial applications. The cell formation problem is considered the first and the foremost issue faced in the designing of cellular manufacturing systems that attempts to minimize the inter-cell movement of the products while maximize the machines utilization. This paper presents an adapted optimization algorithm entitled the cuckoo search algorithm for solving this kind of problems. The proposed method is tested on different benchmark problems; the obtained results are then compared to others available in the literature. The comparison result reveals that on 31 out of 35 problems (88.57%) the results of the introduced method are among the best results.

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

[2]  Behrooz Karimi,et al.  A novel discrete particle swarm optimization algorithm for the manufacturing cell formation problem , 2014 .

[3]  Chung-Cheng Lu,et al.  Cell formation using a simulated annealing algorithm with variable neighbourhood , 2011 .

[4]  Mohammad Kazem Sayadi,et al.  Firefly-inspired algorithm for discrete optimization problems: An application to manufacturing cell formation , 2013 .

[5]  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..

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

[7]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[8]  Dolores E. Luna,et al.  A GRASP heuristic for the manufacturing cell formation problem , 2012 .

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

[10]  Maghsud Solimanpur,et al.  A tabu search approach for cell scheduling problem with makespan criterion , 2013 .

[11]  G. Srinivasan,et al.  GRAFICS—a nonhierarchical clustering algorithm for group technology , 1991 .

[12]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

[13]  Seyed Mohammad Seyedhosseini,et al.  Machine-Part Cell Formation Problem Using a Group Based League Championship Algorithm , 2015 .

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

[15]  M. Chandrasekharan,et al.  Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology , 1990 .