基于约束矩阵与蚁群算法的CAPP加工工序优化排序  

Optimization Operation Sequence in CAPP Using an Ant Colony Algorithm Based on Constraint Matrix

作　　者：姜存学[1] 蔡力钢[1] 胡于进[1] 

机构地区：[1]华中科技大学,武汉430074

出　　处：《中国机械工程》2009年第18期2203-2206,共4页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(50675078);国家863高技术研究发展计划资助项目(2006AA04Z136)

摘　　要：针对复杂零件工艺方案全局优化难题,提出基于约束矩阵与蚁群算法进行工序优化的方法。约束矩阵包括客观约束矩阵与费用约束矩阵,在分析两个矩阵的基础上,将客观约束矩阵与费用约束矩阵统一为一个矩阵,在此矩阵约束下,用蚁群算法进行工序排序优化,从而保证快速地得到正确的优化工艺序列。结果表明,所提方法具有良好的实用效果。A method was proposed for optimization operation sequence based on constraint matrix and ant colony algorithm for the global process optimization problem of complex components. The constraint matrix included two parts, object constraint matrix and cost constraint matrix, according to ours rules, we united the two matrixes to one matrix. With the constraint of this matrix, operation sequence was optimized by using an ant colony algorithm,thus a right optimized operations sequence was obtained quickly. The result shows that this method has good practical effectiveness.

关 键 词：制造特征 工步元 约束矩阵 蚁群算法 工序排序 

分 类 号：TH162[机械工程—机械制造及自动化]