首页> 外文会议>IEEE International Conference on Mechatronics and Automation >Automatic generation and optimization of stable assembly sequence based on ACO algorithm
【24h】

Automatic generation and optimization of stable assembly sequence based on ACO algorithm

机译:基于ACO算法的稳定装配顺序自动生成与优化

获取原文

摘要

In this research, a methodology based on ant colony optimization algorithm to generate the optimal assembly operation sequence is introduced. With the strategy of “assembly by disassembling” for assembly planning, the model of disassembly operation information graph representing for disassembly process was developed, and the assembly sequence planning problem was translated into an optimal path searching in a directed graph. Based on the integrated disassembly interfere matrix, connection matrix and integrated support matrix information of the product, the generation method for the geometrical feasible and stable assembly operation sequence was elaborated in detail. A modified strategy of pheromone trails initialization and update for colony optimization algorithm was put forward. Finally an illustrative case study was used to testify the validity of the presented methodology.
机译:在这项研究中,介绍了一种基于蚁群优化算法生成最优装配操作序列的方法。运用“拆装组装”的策略进行装配计划,建立了代表拆卸过程的拆卸操作信息图模型,并将装配顺序计划问题转化为有向图的最优路径搜索。基于产品的综合拆装干扰矩阵,连接矩阵和综合支撑矩阵信息,详细阐述了几何可行且稳定的组装操作序列的生成方法。针对菌落优化算法,提出了信息素踪迹初始化和更新的改进策略。最后,通过示例性案例研究来验证所提出方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号