Genetic Algorithm for Assembly Sequences Planning Based on Heuristic Assembly Knowledge

Article Preview

Abstract:

To improve the efficiency of Assembly Sequences Planning (ASP), a new approach based on heuristic assembly knowledge and genetic algorithm was proposed. First, Connection Graph of Assembly (CGA) was introduced, and then, assembly knowledge was described in the form of Assembly Rings, on that basis, the assembly connection graph model containing Assembly Rings was defined, and the formation of initial population algorithm was given. In addition, a function was designed to measure the feasible assembly and then the genetic algorithm fitness function was given. Finally, an example was shown to illustrate the effectiveness of the algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3657-3661

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] HAN Xiao-dong, CAI Yong, JIANG Gang: Machinery Design &Manufacture Journal Vol. 3 (2009), pp.212-214, in Chinese.

Google Scholar

[2] LIN Xibo: Assembly sequence optimization based on genetic algorithm [D]. Nanjing: Nanjing University of Science & Technology, 2004, in Chinese.

Google Scholar

[3] Han Jiansheng: Research on Disassembly Sequence Planning Based on Genetic Algorithms [D]. Wuhan: Huazhong University of Science and Technology, 2007, in Chinese.

Google Scholar

[4] HUANG Jie, DU Pingang et al.: Computer Integrated Manufacturing Systems Vol. 3 (2007), pp.757-761, in Chinese.

Google Scholar

[5] LiuZhenyu: Research on the Theory Method and Application of Process and history oriented Assembly Modeling in Virtual Environment [D]. Zhejiang, Zhejiang University, 2001, in Chinese.

Google Scholar