摘要
An ant colony optimization approach for assembly sequence planning is presented. Precedence relations among components are introduced to the searching algorithm. Dynamical candidates set strategy based on precedence relations is adopted to constrain the searching space of assembly sequence; penalty-volatilization mechanism is used to help ants avoid unfeasible sequences; state transition rule and local-global updating rule are defined to ensure that the ant colony can find the optimal sequence. Finally, an assembly sequence planning system based on the proposed approach is developed.
- 出版日期2007
- 单位武汉大学