A dynamic programming-enhanced simulated annealing algorithm for solving bi-objective cell formation problem with duplicate machines

Article history: Received June 10, 2014 Accepted October 22, 2014 Available online October 22 2014 Cell formation process is one of the first and the most important steps in designing cellular manufacturing systems. It consists of identifying part families according to the similarities in the design, shape, and presses of parts and dedicating machines to each part family based on the operations required by the parts. In this study, a hybrid method based on a combination of simulated annealing algorithm and dynamic programming was developed to solve a biobjective cell formation problem with duplicate machines. In the proposed hybrid method, each solution was represented as a permutation of parts, which is created by simulated annealing algorithm, and dynamic programming was used to partition this permutation into part families and determine the number of machines in each cell such that the total dissimilarity between the parts and the total machine investment cost are minimized. The performance of the algorithm was evaluated by performing numerical experiments in different sizes. Our computational experiments indicated that the results were very encouraging in terms of computational time and solution quality. Growing Science Ltd. All rights reserved. 5 © 201

[1]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[2]  John McAuley,et al.  Machine grouping for efficient production , 1972 .

[3]  L. Kaufman,et al.  An algorithm for the quadratic assignment problem using Bender's decomposition , 1978 .

[4]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

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

[6]  N. Singh,et al.  Design of cellular manufacturing systems: An invited review , 1993 .

[7]  Bharatendu Srivastava,et al.  Simulated annealing procedures for forming machine cells in group technology , 1994 .

[8]  Jaydeep Balakrishnan,et al.  Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison , 1995 .

[9]  M. S. Akturk,et al.  Part-machine grouping using a multi-objective cluster analysis , 1996 .

[10]  Kazem Abhary,et al.  A genetic algorithm based cell design considering alternative routing , 1997 .

[11]  Ping-Teng Chang,et al.  A multisolution method for cell formation—Exploring practical alternatives in group technology manufacturing☆ , 2000 .

[12]  Anan Mungwattana,et al.  Design of Cellular Manufacturing Systems for Dynamic and Uncertain Production Requirements with Presence of Routing Flexibility , 2000 .

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

[14]  Michael Mutingi,et al.  A genetic algorithm approach to cellular manufacturing systems , 2001 .

[15]  Divakar Rajamani,et al.  The trade-off between intracell and intercell moves in group technology cell formation , 2001 .

[16]  Maghsud Solimanpur,et al.  A multi-objective genetic algorithm approach to the design of cellular manufacturing systems , 2004 .

[17]  Shine-Der Lee,et al.  Joint determination of machine cells and linear intercell layout , 2004, Comput. Oper. Res..

[18]  Amir Azaron,et al.  Solving a dynamic cell formation problem using metaheuristics , 2005, Appl. Math. Comput..

[19]  Yong Yin,et al.  Similarity coefficient methods applied to the cell formation problem: a comparative investigation , 2005, Comput. Ind. Eng..

[20]  Herman R. Leep,et al.  Forming part families by using genetic algorithm and designing machine cells under demand changes , 2006, Comput. Oper. Res..

[21]  Eduardo Vila Gonçalves Filho,et al.  A group genetic algorithm for the machine cell formation problem , 2006 .

[22]  Felix T.S. Chan,et al.  Two-stage approach for machine-part grouping and cell layout problems , 2006 .

[23]  Yong Yin,et al.  Similarity coefficient methods applied to the cell formation problem: A taxonomy and review , 2006 .

[24]  Jamal Arkat,et al.  Applying simulated annealing to cellular manufacturing system design , 2007 .

[25]  Hamid R. Parsaei,et al.  Machine Cell Formation Based on a New Similarity Coefficient , 2008 .

[26]  Reza Tavakkoli-Moghaddam,et al.  A new solution for a dynamic cell formation problem with alternative routing and machine costs using simulated annealing , 2008, J. Oper. Res. Soc..

[27]  Soroush Saghafian,et al.  Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems , 2009 .

[28]  Tolga Bektas,et al.  Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration , 2009, Eur. J. Oper. Res..

[29]  Zülal Güngör,et al.  Modeling of a manufacturing cell design problem with fuzzy multi-objective parametric programming , 2009, Math. Comput. Model..

[30]  Maghsud Solimanpur,et al.  Heuristic Approaches for Cell Formation in Cellular Manufacturing , 2010, J. Softw. Eng. Appl..

[31]  Mohammad Saidi-Mehrabad,et al.  An efficient hybrid self-learning method for stochastic cellular manufacturing problem: A queuing-based analysis , 2011, Expert Syst. Appl..

[32]  Manojit Chattopadhyay,et al.  Meta-heuristics in cellular manufacturing: A state-of-the-art review , 2011 .

[33]  Chia-Hsien Lin,et al.  A PSO-based approach to cell formation problems with alternative process routings , 2012 .

[34]  Prasun Das,et al.  Group technology based adaptive cell formation using predator-prey genetic algorithm , 2012, Appl. Soft Comput..