Solving Manufacturing Cell Design Problems Using a Shuffled Frog Leaping Algorithm

The manufacturing Cell Design Problem (MCDP) is a well-known problem for lines of manufacture where the main goal is to minimize the inter-cell moves. To solve the MCDP we employ the Shuffled Frog Leaping Algorithm (SFLA), which is a metaheuristic inspired on the natural memetic features of frogs. The frog tries to leap all over the search space for a better result until the stopping criteria is met. The obtained results are compared with previous approaches of the algorithm to test the real efficiency of our proposed SFLA. The results show that the proposed algorithm produces optimal solutions for all the 50 studied instances.

[1]  Mohammed Atiquzzaman,et al.  Optimal design of water distribution network using shu2ed complex evolution , 2004 .

[2]  R. Lashkari,et al.  A mathematical programming approach to joint cell formation and operation allocation in cellular manufacturing , 1995 .

[3]  S. Oliveira,et al.  A spectral clustering algorithm for manufacturing cell formation , 2009, Comput. Ind. Eng..

[4]  Mary E. Helander,et al.  Manufacturing cell formation using an improved p -median model , 1998 .

[5]  Orlando Durán,et al.  Cell formation in group technology using constraint programming and Boolean satisfiability , 2012, Expert Syst. Appl..

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

[7]  Orlando Durán,et al.  Collaborative particle swarm optimization with a data mining technique for manufacturing cell design , 2010, Expert Syst. Appl..

[8]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[9]  Andrew Kusiak,et al.  The part families problem in flexible manufacturing systems , 1985 .

[10]  Divakar Rajamani,et al.  A mathematical model for cell formation considering investment and operational costs , 1993 .

[11]  Mahesh Gupta,et al.  A genetic algorithm-based approach to cell composition and layout design problems , 1996 .

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

[13]  G. Srinivasan.  A clustering algorithm for machine cell formation in group technology using minimum spanning trees , 1994 .

[14]  T. Narendran,et al.  A genetic algorithm approach to the machine-component grouping problem with multiple objectives , 1992 .

[15]  G. F. Purcheck,et al.  Load balancing for group technology planning and control , 1979 .

[16]  S. Shekhar,et al.  Evaluation of search algorithms and clustering efficiency measures for machine-part matrix clustering , 1995 .

[17]  John L. Burbidge,et al.  Production flow analysis , 1963 .

[18]  Pedro M. Vilarinho,et al.  A simulated annealing approach for manufacturing cell formation with multiple identical machines , 2003, Eur. J. Oper. Res..

[19]  Hamid Seifoddini,et al.  Comparative study of similarity coefficients and clustering algorithms in cellular manufacturing , 1994 .

[20]  Sarada Prasad Sarmah,et al.  Shuffled frog leaping algorithm and its application to 0/1 knapsack problem , 2014, Appl. Soft Comput..

[21]  G. Purcheck.  A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set , 1975 .