Machine-component grouping using genetic algorithms

被引:12
|
作者
Chan, FTS
Mak, KL
Luong, LHS
Ming, XG
机构
[1] Univ Hong Kong, Dept Ind & Mfg Syst Engn, Hong Kong, Peoples R China
[2] Univ S Australia, Sch Engn Mech & Mfg, Adelaide, SA 5001, Australia
关键词
machine-component groupings; genetic algorithms; mathematical models;
D O I
10.1016/S0736-5845(98)00024-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
One major problem in cellular manufacturing is the grouping of component parts with similar processing requirements into part families. and machines into manufacturing cells to facilitate the manufacturing of specific part families assigned to them. The objective is to minimize the total inter-cell and intra-cell movements of parts during the manufacturing process. In this paper, a mathematical model is presented to describe the characteristics of such a problem. An approach based on the concept of genetic algorithms is developed to determine the optimal machine-component groupings. Illustrative examples are used to demonstrate the efficiency of the proposed approach. Indeed, the results obtained show that the proposed genetic approach is a simple and efficient means for solving the machine-component grouping problem. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:339 / 346
页数:8
相关论文
共 50 条