Heuristic Approaches for Cell Formation in Cellular Manufacturing  

作　　者：Shahram Saeedi Maghsud Solimanpur Iraj Mahdavi Nikbakhsh Javadian 

机构地区：[1]不详

出　　处：《Journal of Software Engineering and Applications》2010年第7期674-682,共9页软件工程与应用（英文）

摘　　要：Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manu-facturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on simi-larities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Simulated Annealing (SA) meta-heuristic methods and the results are compared. The computational results show that the GA method is more effective in solving the model.Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manu-facturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on simi-larities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Simulated Annealing (SA) meta-heuristic methods and the results are compared. The computational results show that the GA method is more effective in solving the model.

关 键 词：Cell Formation Problem ANT COLONY Optimization GENETIC Algorithm SIMULATED ANNEALING SEQUENCE Data Production Volume 

分 类 号：TP1[自动化与计算机技术—控制理论与控制工程]