A novel discrete particle swarm optimization algorithm for the manufacturing cell formation problem

The manufacturing cell formation problem, with the aim of grouping parts into families and machines into cells, is considered with the objective of maximizing grouping efficacy. A new solution approach based on the particle swarm optimization (PSO) algorithm is presented for the problem. Unlike the original PSO algorithm which works with arithmetic operators and scalars, the new algorithm uses group-based operators, in place of arithmetic operators, in the body of the updating equations analogous to those of the classical PSO equations (given the fact that the cell formation problem is essentially a grouping problem, all operators in the new algorithm work with constructed cells (groups) rather than parts/machines (objects), isolatedly). We benchmark a set of 40 test problem instances from previous researches and do comparisons between the new algorithm and existing algorithms. We also compare the performance of our algorithm when it is hybridized with a local search module. Our computations reveal that the proposed algorithm performs well on all test problems, exceeding or matching the best solution’s quality presented in the literature.