Connector-based approach to assembly planning using a genetic algorithm

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.

[1]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[2]  Beatrice Lazzerini,et al.  Generation of Optimized Assembly Sequences Using Genetic Algorithms , 1999 .

[3]  Hideo Fujimoto,et al.  A genetic planner for assembly automation , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[4]  David R. Musser,et al.  STL tutorial and reference guide - C++ programming with the standard template library , 1996, Addison-Wesley professional computing series.

[5]  Shana Smith,et al.  An enhanced genetic algorithm for automated assembly planning , 2002 .

[6]  David R. Musser,et al.  STL tutorial and reference guide, second edition: C++ programming with the standard template library , 2001 .

[7]  Bruce E. Barrett,et al.  Decision quality using ranked attribute weights , 1996 .

[8]  Thomas L. DeFazio,et al.  An integrated computer aid for generating and evaluating assembly sequences for mechanical products , 1991, IEEE Trans. Robotics Autom..

[9]  Hyungsuck Cho,et al.  A genetic-algorithm-based approach to the generation of robotic assembly sequences , 1999 .

[10]  Surendra M. Gupta,et al.  An evaluation methodology for disassembly processes , 1997 .

[11]  F. Bonneville,et al.  A genetic algorithm to generate and evaluate assembly plans , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[12]  K. Ghosh,et al.  Representation and selection of assembly sequences in computer-aided assembly process planning , 1997 .

[13]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  J. H. Liu,et al.  A concurrent hierarchical evolution approach to assembly process planning , 2002 .

[15]  Yong-Jin Liu,et al.  An adaptive genetic assembly-sequence planner , 2001, Int. J. Comput. Integr. Manuf..

[16]  H. W I A-E N T S E N G,et al.  A novel means of generating assembly sequences using the connector concept , 1999 .

[17]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[18]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[19]  Hirokazu Osaki,et al.  The Method of Analysis of Assembly Work Based on the Fastener Method , 1980 .