An Ant Colony Optimization Strategy for Assembly Sequence Planning
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.
precedence relation assembly sequence planning ant colony optimization
Shijing Wu Mingxing Deng Lilun Luo Jing Xie Xiao Peng
Wuhan University, China
国际会议
武汉
英文
2007-09-21(万方平台首次上网日期,不代表论文的发表时间)