首页> 外文会议>International conference on frontiers of manufacturing and design science >Genetic algorithm for Assembly sequences planning based on heuristic Assembly knowledge
【24h】

Genetic algorithm for Assembly sequences planning based on heuristic Assembly knowledge

机译:基于启发式装配知识的装配序列计划遗传算法

获取原文

摘要

To improve the efficiency of Assembly Sequences Planning (ASP),a new approach based on heuristic assembly knowledge and genetic algorithm was proposed.First,Connection Graph of Assembly (CGA) was introduced,and then,assembly knowledge was described in the form of Assembly Rings,on that basis,the assembly connection graph model containing Assembly Rings was defined,and the formation of initial population algorithm was given.In addition,a function was designed to measure the feasible assembly and then the genetic algorithm fitness function was given.Finally,an example was shown to illustrate the effectiveness of the algorithm.
机译:为了提高装配顺序计划(ASP)的效率,提出了一种基于启发式装配知识和遗传算法的新方法。首先介绍了装配连接图(CGA),然后以装配形式描述了装配知识。环,在此基础上,定义了包含装配环的装配连接图模型,并给出了初始填充算法的形成。此外,设计了测量可行装配的函数,然后给出了遗传算法的适应度函数。 ,通过一个例子说明了该算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号