TITLE

Assembly sequences merging based on assembly unit partitioning

AUTHOR(S)
Wang, Y.; Liu, J.; Li, L.
PUB. DATE
December 2009
SOURCE
International Journal of Advanced Manufacturing Technology;Dec2009, Vol. 45 Issue 7/8, p808
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Assembly sequence planning is a typical of combinatorial optimization problem which is difficult to be tackled when the number of parts of assembly becomes large. To reduce the searching space of assembly sequence planning of complex products, assembly sequences merging based on assembly unit partitioning is suggested. Assembly unit partitioning is presented to decompose the complex products into a group of assembly units containing a reduced number of parts or components, and the assembly design constraints and the assembly process constraints are comprehensively taken into account. The global optimal assembly sequences can be acquired through three steps. Firstly, the assembly units and decision graph of assembly unit are generated utilizing fuzzy analytical hierarchy process approach. Secondly, the optimal or near-optimal subsequences of assembly units can be obtained with current efficient methods of assembly sequence planning. Thirdly, under the assembly interference of assembly relations (geometrical constraints) of the whole products and the assembly precedence concluded by subsequences of assembly units, the assembly sequence merging is implemented to generate the global assembly sequences, and the optimal sequence is obtained through assembly sequences evaluation. The assembly constraints considered at the two previous steps is represented by the evaluation function. The effectiveness of the method is verified by an illustrative example and the results show that the searching space of assembly sequence merging of complex products is reduced remarkably and the optimal assembly sequence of the whole produces is obtained.
ACCESSION #
44917628

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics