...
【24h】

Disassembly sequence planning based on a genetic algorithm

机译:基于遗传算法的拆卸序列计划

获取原文
获取原文并翻译 | 示例
           

摘要

Disassembly sequence planning is a relatively new subject and has only recently gained interest in the research literature. Disassembly simulations are important not only for improving product design, but also for maintaining an updated process plan, which becomes a tedious and complicated task given the complexity of today's mechanisms. The crucial issue, in the generation of disassembly plans, is the rise in the amount of sequences, especially with the increase of the number of parts in the mechanism. For this reason, it is crucial to seek an optimal feasible method for the disassembly process. In this paper, an optimized disassembly process based on a genetic algorithm is proposed. The method takes into account several criteria such as maintainability of usury component, part volume, tools change and the change of disassembly directions. The results obtained demonstrate the satisfactory side of these criteria to identify a feasible disassembly sequence.
机译:拆卸序列计划是一个相对较新的主题,直到最近才对研究文献产生兴趣。拆卸模拟不仅对于改进产品设计非常重要,而且对于维护更新的工艺计划也很重要,考虑到当今机制的复杂性,这成为繁琐而复杂的任务。在生成拆卸计划时,至关重要的问题是序列数量的增加,尤其是随着机构中零件数量的增加。因此,至关重要的是寻找一种最佳可行的拆卸方法。本文提出了一种基于遗传算法的优化拆卸过程。该方法考虑了多个标准,例如高利贷部件的可维护性,零件体积,工具更换以及拆卸方向的改变。获得的结果证明了这些标准的令人满意的一面,以确定可行的拆卸顺序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号