A PSO-based approach to cell formation problems with alternative process routings

Group technology (GT) has been extensively applied to cellular manufacturing system (CMS) design for decades due to many benefits such as decreased number of part movements among cells and increased machine utilisation in cells. This paper considers cell formation problems with alternative process routings and proposes a discrete particle swarm optimisation (PSO) approach to minimise the number of exceptional parts outside machine cells. The approach contains two main steps: machine partition and part-routing assignment. Through inheritance and random search, the proposed algorithm can effectively partition machines into different cells with consideration of multiple part process routings. The computational results are compared with those obtained by using simulated annealing (SA)-based and tabu search (TS)-based algorithms. Experimental results demonstrate that the proposed algorithm can find equal or fewer exceptional elements than existing algorithms for most of the test problems selected from the literature. Moreover, the proposed algorithm is further tailed to incorporate various production factors in order to extend its applicability. Four sample cases are tested and the results suggest that the algorithm is capable of solving more practical cell formation problems.

[1]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

[3]  Stella Sofianopoulou,et al.  Manufacturing cells design with alternative process plans and/or replicate machines , 1999 .

[4]  R. S. Lashkari,et al.  Cell formation in the presence of alternate process plans in Flexible Manufacturing Systems , 1991 .

[5]  Bassem Jarboui,et al.  Combinatorial particle swarm optimization (CPSO) for partitional clustering problem , 2007, Appl. Math. Comput..

[6]  Christophe Caux,et al.  Cell formation with alternative process plans and machine capacity constraints: A new combined approach , 2000 .

[7]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[8]  Sebastián Lozano,et al.  A particle swarm optimization algorithm for part–machine grouping , 2006 .

[9]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[10]  Y. Won,et al.  Multiple criteria clustering algorithm for solving the group technology problem with multiple process routings , 1997 .

[11]  A. Kusiak,et al.  Similarity coefficient algorithms for solving the group technology problem , 1992 .

[12]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.

[13]  Tom Fearn,et al.  Particle Swarm Optimisation , 2014 .

[14]  Sehun Kim,et al.  An Assignment Method for Part-Machine Cell Formation Problem In the Presence of Multiple Process Routes , 1994 .

[15]  Yong Yin,et al.  Manufacturing cells' design in consideration of various production factors , 2002 .

[16]  Mitsuo Gen,et al.  A genetic algorithm-based approach for design of independent manufacturing cells , 1999 .

[17]  Swaminathan Sankaran,et al.  AN INTEGRATED APPROACH TO CELL FORMATION AND PART ROUTING IN GROUP TECHNOLOGY MANUFACTURING SYSTEMS , 1990 .

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

[19]  Riccardo Poli,et al.  Particle Swarm Optimisation , 2011 .

[20]  Asoo J. Vakharia,et al.  Cell formation in group technology: review, evaluation and directions for future research , 1998 .

[21]  Y. Won,et al.  New p-median approach to cell formation with alternative process plans , 2000 .

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

[23]  Rakesh Nagi,et al.  Multiple routeings and capacity considerations in group technology applications , 1990 .

[24]  G. K. Adil,et al.  Cell formation considering alternate routeings , 1996 .

[25]  Sebastián Lozano,et al.  Machine cell formation in generalized group technology , 2001 .

[26]  Felix T.S. Chan,et al.  Cell formation problem with consideration of both intracellular and intercellular movements , 2008 .

[27]  Rasaratnam Logendran,et al.  Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans , 1994 .

[28]  Tai-Hsi Wu,et al.  An efficient tabu search algorithm to the cell formation problem with alternative routings and machine reliability considerations , 2011, Comput. Ind. Eng..

[29]  Jeng-Fung Chen,et al.  A decomposition approach to the cell formation problem with alternative process plans , 2004 .

[30]  Hark Hwang,et al.  Routes selection for the cell formation problem with alternative part process plans , 1996 .

[31]  Maghsud Solimanpur,et al.  Solving cell formation problem in cellular manufacturing using ant-colony-based optimization , 2010 .

[32]  Jamal Arkat,et al.  Modelling the effects of machine breakdowns in the generalized cell formation problem , 2008 .

[33]  Tai-Hsi Wu,et al.  Hybrid simulated annealing algorithm with mutation operator to the cell formation problem with alternative process routings , 2009, Expert Syst. Appl..

[34]  Stella Sofianopoulou,et al.  Manufacturing cell design with alternative routings in generalized group technology: reducing the complexity of the solution space , 2007 .

[35]  S. Chi,et al.  Generalized part family formation using neural network techniques , 1992 .

[36]  A. Kusiak.  The generalized group technology concept , 1987 .