Connector-based approach to assembly planning using a genetic algorithm

被引:42
作者
Tseng, HE [1 ]
Li, JD [1 ]
Chang, YH [1 ]
机构
[1] Da Yeh Univ, Dept Ind Engn, Da Tsuen 515, Chang Hua, Taiwan
关键词
D O I
10.1080/0020754042000203894
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Assembly planning refers to the task where planners arrange a specific assembly sequence according to the product design description as well as to their particular heuristics in putting together all the components of a product. In assembly planning, one needs to take into consideration the relationships between components such as the geometric limitation factor before the precedence sequence is set up for assembly. This deliberation will contribute strongly to lower the production cost. Unlike traditional studies where the liaison graph goes with a genetic algorithm, an attempt is made to solve problems in assembly planning by using a genetic algorithm under the connector-based environment. Such a connector-based genetic algorithm takes a more realistic view. The key point in this approach to assembly planning is to combine the connector concept and characteristics of a genetic algorithm using object-oriented programming; thus, the programming language C++ is used to develop the mechanism of the algorithm. Finally, a stapler and a computer hard disk were used as practical examples to illustrate the possibility of such an idea. Consequently, in terms of assembly planning, it is feasible to create a genetic algorithm based on the connector's engineering features.
引用
收藏
页码:2243 / 2261
页数:19
相关论文
共 19 条
[1]   THE METHOD OF ANALYSIS OF ASSEMBLY WORK BASED ON THE FASTENER METHOD [J].
AKAGI, F ;
OSAKI, H ;
KIKUCHI, S .
BULLETIN OF THE JSME-JAPAN SOCIETY OF MECHANICAL ENGINEERS, 1980, 23 (184) :1670-1675
[2]   AN INTEGRATED COMPUTER AID FOR GENERATING AND EVALUATING ASSEMBLY SEQUENCES FOR MECHANICAL PRODUCTS [J].
BALDWIN, DF ;
ABELL, TE ;
LUI, MCM ;
DEFAZIO, TL ;
WHITNEY, DE .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (01) :78-94
[3]   Decision quality using ranked attribute weights [J].
Barron, FH ;
Barrett, BE .
MANAGEMENT SCIENCE, 1996, 42 (11) :1515-1523
[4]  
Bonneville F., 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95 (Cat. No.95TH8056), P231, DOI 10.1109/ETFA.1995.496663
[5]   An adaptive genetic assembly-sequence planner [J].
Chen, SF ;
Liu, YJ .
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2001, 14 (05) :489-500
[6]   SIMPLIFIED GENERATION OF ALL MECHANICAL ASSEMBLY SEQUENCES [J].
DEFAZIO, TL ;
WHITNEY, DE .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1987, 3 (06) :640-658
[7]   A CORRECT AND COMPLETE ALGORITHM FOR THE GENERATION OF MECHANICAL ASSEMBLY SEQUENCES [J].
DEMELLO, LSH ;
SANDERSON, AC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (02) :228-240
[8]   Generation of optimized assembly sequences using genetic algorithms [J].
Dini, G ;
Failli, F ;
Lazzerini, B ;
Marcelloni, F .
CIRP ANNALS 1999 - MANUFACTURING TECHNOLOGY, 1999, :17-20
[9]   Parameter control in evolutionary algorithms [J].
Eiben, AE ;
Hinterding, R ;
Michalewicz, Z .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (02) :124-141
[10]  
Gen M., 2000, Genetic Algorithms and Engineering Optimization