Abstract
Aiming at Assembly Sequence Planning(ASP)problem, shortcomings of basic ant system were analyzed, an improved Ant Colony Algorithm(ACA)oriented to ASP was proposed to obtain optimal or near optimal assembly sequence. In this algorithm, assembly operation constraint was introduced into the state transfer function as heuristic information. And feasible transition area was set up by obtaining assembly relationship of the parts. By dynamic change of pheromohe trail persistence and dynamic setting of parameters α and β, the convergence speed of ACA was improved and the local optimization was avoided. Finally, the effectiveness was verified by an example.
| Original language | English |
|---|---|
| Pages (from-to) | 1189-1194 |
| Number of pages | 6 |
| Journal | Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS |
| Volume | 16 |
| Issue number | 6 |
| State | Published - Jun 2010 |
Keywords
- Ant colony algorithm
- Assembly sequence planning
- Optimization
- Pheromone
Fingerprint
Dive into the research topics of 'Assembly sequence planning based on improved ant colony algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver