摘要
定义了加工特征、加工链以及加工单元的基本概念。利用执行成本加权求和计算加工单元之间的广义欧式距离。通过对信息素浓度的更新由实时更新改进为循环后更新,使新的蚁群算法不仅简化了计算复杂性,而且增强了最优工艺路线规划的客观性。根据机加工之间具体的约束方式以及蚂蚁选择节点方式规定寻径过程中的tuba表。建立了基于改进蚁群算法的最优加工工艺路线规划算法流程。
The basic concepts of the processing characteristics, the processing chain, as well as the processing unit were defmed. Euclidean distance between the processing units was calculated based on the implementation of cost-weighted sum. Improvement of cycle was updated through the update of pheromone concenlration by real-time updates. The new ant colony algorithm not only simplifies the computational complexity, but also enhances the objectivity of the optimal process planning. According to the specific constraints between machining and the ants choose the node to the provisions of the tuba in the process of muting. Process of the optimal process route planning algorithm based on improved ant colony algorithm was established.
出处
《自动化与仪器仪表》
2012年第3期164-166,共3页
Automation & Instrumentation
关键词
工艺路线
蚁群算法
信息素
Process Route
Ant Colony Algorithm
Pheromone
