首页> 外文会议>IFIP TC 12 international conference on intelligent information processing >Assembly Sequence Planning Based on Hybrid Artificial Bee Colony Algorithm
【24h】

Assembly Sequence Planning Based on Hybrid Artificial Bee Colony Algorithm

机译:基于混合人工蜂群算法的装配序列规划

获取原文

摘要

Intelligent algorithm provides a promising approach for solving the Assembly Sequence Planning (ASP) problem on complex products, but there is still challenge in finding best solutions efficiently. In this paper, the artificial bee colony algorithm is modified to deal with this challenge. The algorithm is modified from four aspects. First, for the phase that employed bee works, a simulated annealing operator is introduced to enrich the diversity of nectar sources and to enhance the local searching ability. Secondly, in order to prevent the swarm from falling into local optimal solutions quickly, a tournament selection mechanism is introduced for the onlooker bees to choose the food source. Thirdly, for the phase that scout bee works, a learning mechanism is introduced to improve the quality of new generated food sources and to increase the convergence speed of the algorithm. Finally, a fitness function based on the evaluation indexes of assemblies is proposed to evaluate and select nectar sources. The experimental results show that the modified algorithm is effective and efficient for the ASP problem.
机译:智能算法为解决复杂产品上的装配顺序计划(ASP)问题提供了一种有前途的方法,但是要有效地找到最佳解决方案仍然存在挑战。本文对人工蜂群算法进行了改进,以应对这一挑战。该算法从四个方面进行了修改。首先,在蜜蜂工作的阶段,引入了模拟退火算子,以丰富花蜜来源并增强局部搜索能力。其次,为防止蜂群迅速陷入局部最优解,引入了锦标赛选择机制,供围观蜜蜂选择食物来源。第三,在侦察蜂工作的阶段,引入了一种学习机制,以提高新产生的食物来源的质量并提高算法的收敛速度。最后,提出了一种基于装配体评价指标的适应度函数,用于评价和选择花蜜来源。实验结果表明,改进后的算法对于ASP问题是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号