基于加工操作单元的多态蚁群装夹规划方法

发布时间：2018-06-30 07:35

本文选题：装夹规划 + 加工特征　；参考：《机械工程学报》2017年07期

【摘要】：针对基于加工特征的计算机辅助装夹规划问题,提出一种基于多态蚁群算法的装夹规划优化方法。根据零件的加工特征,定义了加工操作单元,建立零件的装夹规划模型;接着提出了集成顺序优先约束的多态蚁群求解装夹规划的优化算法。其中顺序优先约束是通过对加工操作单元的划分,实现禁忌加工操作单元的动态调整;多态蚁群算法将局域搜索与全局搜索进行结合,并根据状态转移概率在可行的加工操作单元中进行选择,完成整个装夹路径的规划。最后通过典型零件装夹规划的实例,验证了提出的多态蚁群算法在求解装夹规划问题中的可行性和有效性。
[Abstract]:In order to solve the problem of computer-aided clamping planning based on machining features, an optimization method based on polymorphic ant colony algorithm is proposed. According to the machining characteristics of the parts, the machining operation unit is defined, and the clamping planning model of the parts is established, and then the optimization algorithm for solving the clamping planning with polymorphic ant colony which integrates sequential precedence constraints is proposed. Among them, sequential priority constraint is to realize dynamic adjustment of Tabu processing operation unit by dividing processing operation unit, and polymorphic ant colony algorithm combines local search with global search. According to the state transition probability, we select the feasible processing operation unit to complete the planning of the whole clamping path. Finally, the feasibility and effectiveness of the proposed polymorphic ant colony algorithm in solving the clamping planning problem is verified by an example of typical parts clamping planning.
【作者单位】：嘉兴学院机电工程学院;
【基金】：国家自然科学科学基金(61403163) 浙江省自然科学基金(LY13E050021,LQ14G010008) 浙江省公益性技术应用研究计划(2015C31069)资助项目
【分类号】：TH162;TP18

【相似文献】