基于改进蚁群算法的装配序列规划研究

装配序列规划能解决装配过程中所出现的速度和质量问题,降低生产成本。通过考虑装配影响因素,对装配体零件之间关系进行数学建模,提出一种解决该问题的改进蚁群算法。算法提出用加强装配关系矩阵来表示零件之间存在的强约束关系;用加强随机状态转移规则,使蚂蚁能更快地寻找到最优或者近优解;完善信息素更新规则,使算法能更好的利用正反馈机制。通过实例证明,该改进型算法能实际有效地解决装配序列规划问题。

Study on assembly sequence planning based on improved ant colony algorithm

The research of assembly sequence planning can solve the problems occurred in assembly process such as assembly quality and assembly speed and reduce production costs.An improved ant colony algorithm to solve assembly sequence planning problem is presented first in this article through establishing a mathematical model of assembly relationship by considering assembly effecting factors.Then,according to the algorithm,an enhanced assembly relationship matrix is used to represent the strong constraints among parts.In order to find the optimal or near-optimal route as soon as possible,the stochastic state-transition rule has been applied.What’s more,the positive feedback mechanism is applied well by perfecting the pheromone update rule.Practice proves that the improved algorithm is effective in solving the assembly sequence planning problems.