A Particle Swarm Algorithm for Assembly Sequence Planning

Article Preview

Abstract:

A particle swarm algorithm is proposed to generate optimal assembly sequences for compliant assemblies. Firstly, the liaison graph and the adjacency matrix describe the geometry of the compliant assemblies. An assembly sequence is represented by a character string, whose length is the number of all parts. The conceptual tolerance analysis is used to evaluate feasible sequences. Thereafter, the particle swarm algorithm is presented to generate assembly sequences, in which the elite ratio is applied to improve optimization results. Finally a fender assembly is used to illustrate the algorithm of assembly sequence generation and optimization.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Pages:

3243-3246

Citation:

Online since:

March 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Bourjault: Contribution a une Approche Methodologique deL'Assemblage Automatise: Elaboration Automatique des Sequences Operatoires (PhD Thesis, I' Universite de Franche-Comte 1984).

Google Scholar

[2] T. L. De Fazio and D. E. Whitney: IEEE of Robotics and Automation Vol. 3(1987), p.640.

Google Scholar

[3] L. S. Homem de Mello and A. C. Sanderson: IEEE Transactions on Robotics and Automation Vol. 7(1991), p.211.

Google Scholar

[4] B. Lazzerini and F. Marcelloni: Artificial Intelligence in Engineering, Vol. 14 (2000), p.319.

Google Scholar

[5] Q. Su: International Journal of Production Research Vol. 45(2007), p.29.

Google Scholar

[6] J. Kennedy and R.C. Eberhart: The Particle Swarm: Social Adaptation in Information - Processing Systems (New Ideas in Optimization, McGraw-Hill, Cambridge, UK 1999).

Google Scholar