装配序列规划的一种改进蚁群算法

Ant Colony Algorithm for Assembly Sequence Planning

在当前的基于蚁群算法的装配／拆卸序列规划研究中,装配／拆卸序列都是在假设整个产品中 各个零件处于失重的情况下生成的,没有考虑零件稳定性,导致生成的序列不能完全反映工程情况。针 对这个问题,提出了使用扩展支撑矩阵来判断稳定性的思想;对蚁群算法的转移概率表达式、成本函数 及信息素更新表达式进行了相应的改进,建立了装配序列规划问题一种改进蚁群算法。实例仿真实验结 果表明:改进蚁群算法较之于已有的蚁群算法和遗传算法更为高效,所得到的解更具有工程意义。

Ant colony algorithm has been shown to be a promising method to tackle the assembly/disassembly planning problems. However, the weightlessness of parts was assumed in generating the assembly/disassembly sequences, i.e. , the stability of parts was ignored in the planning process, which might cause meaningless sequences on the view of industrial application. In order to deal with the stability of parts, the extended-sustain matrix was proposed, and the expression of transfer probability and the cost-estimating function were improved. The improved ant colony algorithm for assembly sequence planning was tested by illustrative cases. Test results show that the algorithm developed works more efficiently and effectively than either the ant colony algorithm or genetic algorithm.