摘要
In order to tackle the hard problems of ″combinatorial explosion″ and ″blind search″, considering the disadvantages of single intelligent optimization algorithm for assembly sequence planning, an approach to resolve the problem of assembly sequence planning with intelligent optimization algorithm library (IAL) is proposed. The IAL is composed of an algorithm advisor and an algorithm pool. The most suitable algorithm will be provided to assembly planners by the algorithm advisor according to the description of the assembly planning problems, the quantified reference indices of algorithm performance and the empirical formulas. The improved genetic algorithm (GA), ant colony algorithm (AC) and simulated annealing algorithm (SA) have been implemented and stored in the algorithm pool. The evaluation index system of optimization algorithms and the optimization model of assembly sequence planning are also established. The operational procedure of the IAL is described. Finally, an illustrative example (cork-driver) is given to verify the rationality of the algorithms suggested by the IAL.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1593-1599 |
| 页数 | 7 |
| 期刊 | Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics |
| 卷 | 22 |
| 期 | 9 |
| 出版状态 | 已出版 - 9月 2010 |
学术指纹
探究 'Intelligent optimization algorithm library for assembly sequence planning of products' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver