一种复合算法的装配序列规划方法  

An assembly sequence planning method based on composite algorithm

作　　者：刘恩福[1] 刘博[1] 刘晓阳[1] 李伊[1] 

机构地区：[1]河北科技大学机械工程学院,河北石家庄050018

出　　处：《河北科技大学学报》2016年第1期52-57,共6页Journal of Hebei University of Science and Technology

基　　金：河北省应用基础研究计划重点基础研究项目(14961811D)

摘　　要：针对复杂产品装配规划的组合爆炸和盲目搜索难题,提出一种复合算法解决装配序列规划问题的方法。复合算法首先采取多色集合形式化推理获取足够数量的可行装配序列,并将可行装配序列作为遗传算法的初始种群;然后,通过遗传算法和蚁群算法将人的模糊知识融入规划过程中求精确解;最后,通过实例验证了复合算法的可行性。To solve the combination explosion problem and the blind searching problem in assembly sequence planning of complex products,an assembly sequence planning method based on composite algorithm is proposed.In the composite algorithm,a sufficient number of feasible assembly sequences are generated using formalization reasoning algorithm as the initial population of genetic algorithm.Then fuzzy knowledge of assembly is integrated into the planning process of genetic algorithm and ant algorithm to get the accurate solution.At last,an example is conducted to verify the feasibility of composite algorithm.

关 键 词：计算机辅助制造 装配序列规划 复合算法 多色集合 遗传算法 蚁群算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]