Optimization of high-mix printed circuit card assembly using genetic algorithms

被引:29
作者
Dikos, A
Nelson, PC
Tirpak, TM
Wang, WS
机构
[1] Univ Illinois, Dept Elect Engn & Comp Sci MC 154, Artificial Intelligence Lab, Chicago, IL 60607 USA
[2] Motorola Inc, Corp Mfg Res, Schaumburg, IL 60196 USA
关键词
Genetic Algorithm; Manufacturing Process; Cycle Time; Problem Domain; Genetic Operator;
D O I
10.1023/A:1018919815515
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The purpose of this paper is to present an overview of the factors affecting the cycle time of printed circuit card assembly (PCCA) in high-mix environments and demonstrate a technique for improving machine throughput. We have concentrated our research on optimizing the portion of the PCCA manufacturing process performed by high-speed placement machines (chip shooters). A crucial factor affecting the throughput of a chip shooter is the assignment of components to the feeder slots. Genetic algorithms were employed to find a near optimal assignment of the feeder carriage. Results for various genetic operators in this problem domain are presented.
引用
收藏
页码:303 / 324
页数:22
相关论文
共 18 条
[1]  
BAGLEY JD, 1967, THESIS U MICHIGAN
[2]  
BROWN DE, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P406
[3]  
DAVIS L, 1985, P INT JOINT C ART IN
[4]  
DIKOS A, 1995, THESIS U ILLINOIS CH
[5]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[6]  
GOLDBERG DE, 1991, P 1 INT C GEN THEIR, P154
[7]  
Holland J.H., 1975, Adoption in Natural and Artificial systerm
[8]  
KOOPMANS TC, 1957, ECONOMETRICA, P53
[9]  
MCGINNIS LF, 1993, COMPUTER AIDED PROCE
[10]  
MCGINNIS LF, 1992, IIE T SEP