基于蚁群算法的零件多工艺路线决策方法研究

Research on part multiple process routes decision-making based on ant colony algorithm

为满足企业对工艺规划的新需求,提出了采用蚁群算法进行多工艺路线决策的方法。在几何和技术需求以及可用加工资源的基础上,零件所有特征的各个加工阶段的工序节点构成了工艺求解空间,把加工工序安排的基本原理作为决策加工顺序的约束。采用蚁群算法对工艺求解空间中的所有工序节点在搜索规则的约束作用下进行遍历,最终寻找到能够完全满足工序节点搜索规则的优化工序序列。最后,用实例验证了该方法的可行性,证明该方法可以搜索出可行的工艺路线。

To satisfy new requirements of process planning for enterprises, a method of multiple process routes decision- making using Ant Colony Algorithm （ACA） was proposed. Based on geometrical and technological requirements and the available machining resources, the solution space for process planning was formed by all the procedure -nodes of components＂ characteristics. Basic principles of process planning were identified as constraints for operation sequences. All procedure-nodes in solution space were searched through ACA under search rules constraints so as to find the optimal procedure sequence, which was completely conforming to search rules of procedure- nodes.. Finally, an example was presented to verify the feasibility of this method. The result showed that the ACA was able to find the feasible process routes for a given part.