Abstract
A relation code matrix model is proposed for non-linear assembly sequence planning. Through encoding, all assembly relation information is integrated into a simple matrix. The connection pattern, namely binary template, is used to identify the geometry constraints of parts during assembly planning. Based on the relation code matrix model, methods are devised to find a feasible assembly sequence, to test the stability of the part and to detect possible subassembly. Combined with these methods, genetic algorithm is employed to find the feasible and optimal assembly sequence. The individual sequence is represented by compound list. At last, an example is illustrated to test the validity of the proposed approach.
| Original language | English |
|---|---|
| Pages (from-to) | 88-94 |
| Number of pages | 7 |
| Journal | Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS |
| Volume | 10 |
| Issue number | 1 |
| State | Published - Jan 2004 |
Keywords
- Compound list
- Connection pattern
- Genetic algorithm
- Non-linear assembly sequence planning
- Relation code matrix
Fingerprint
Dive into the research topics of 'Non-linear assembly sequence planning for mechanical product'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver