基于约束蚁群算法的装配序列优化

Assembly Sequence Optimization Based on Constrained Ant Colony Algorithm

针对装配序列优化问题,定义装配约束条件下的蚂蚁转移概率函数和启发式信息函数,提出了面向装配序列优化的约束蚁群算法,以获得相对较优的装配序列。改进了算法的参数设置,利用信息素残留系数的动态变化以及优化转移概率的公式,控制算法的迭代速度,避免了算法过快收敛导致的局部最优解。运用CATIA二次开发方式获取了干涉矩阵等装配信息模型,并以一个典型实例分析了约束蚁群算法的特性,验证了算法的可行性和可靠性,实例证明了约束蚁群算法的有效性。

Aiming at the problem of assembly sequence optimization,the ant transfer probability function and heuristic information function under assembly constraints are defined,and a constrained ant colony algorithm for assembly sequence optimization is proposed to obtain a relatively optimal assembly sequence.The parameter setting of the algorithm is improved.By using the dynamic change of pheromone residue coefficient and the formula of optimizing transfer probability,the iteration speed of the algorithm is controlled to avoid the local optimal solution caused by too fast convergence.The assembly information model,such as interference matrix,is obtained by using CATIA secondary development method.The characteristics of constrained ant colony algorithm are analyzed with a typical example.The feasibility and reliability of the algorithm are verified.The example proves that the constrained ant colony algorithm is effective.