Metaheuristic algorithms for cellular manufacturing system for the loop-layout

Cellular manufacturing system is a procedure for improving flexibility and efficiency in production stations. Cellular manufacturing systems have three important steps including Cell formation, intracellular machine layout and layout of the cells within the shop. Facility layout is one of the important segments in cellular manufacturing systems. In this paper, a new mathematical model for facility layout problem in cellular manufacturing system (CMS) has been developed. The aim of this model is minimizing both intra-cell and inter-cell material handling cost. To solving the model, we used two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS). The proposed SA and TS algorithms are included two stages to achieve to final layout. Comparison between results of these algorithms to solve U and loop-layout problems in cellular manufacturing systems showed that the tabu search algorithm has better solution quality and less computation time in comparing the simulated annealing algorithm.

Metaheuristic algorithms for cellular manufacturing system for the loop-layout Keywords:

Cellular manufacturing system , facility layout problem , loop-layout , simulated annealing , tabu search