...
首页> 外文期刊>Procedia Computer Science >Robotic Optimal Assembly Sequence Using Improved Cuckoo Search Algorithm
【24h】

Robotic Optimal Assembly Sequence Using Improved Cuckoo Search Algorithm

机译:基于改进的布谷鸟搜索算法的机器人最优装配序列

获取原文

摘要

The demand for manufacturing newer products are increasing day-by-day, keeping this demand in mind many modern manufacturing processes have been evolved to meet the demand and supply the product in time. Even though many modern methods have been evolved, still there is lack in time to meet the consumer’s requirements. This is due to assembly, which takes 20% of cost in manufacturing. To do effective assembly, optimal sequence is required; achieving the optimal assembly sequence is a difficulty process because it is one of them Non Probabilistic (NP) hard combinatorial problems. Achieving an effective optimal assembly sequence involves more than one objective function to develop the fitness equation (number of directional changes, gripper changes, time of assembly etc.), which converts the problem into discrete optimization problem. At the starting stages of assembly planning, researchers implemented mathematical models to achieve the feasible solution. These methods performs very poorly when comes to large part assemblies. Meanwhile, Artificial Intelligence (AI) techniques are evolved to solve the Assembly Sequence Planning (ASP) Problems. Performances of these methods are quite impressive in solving ASP problems, but most of these algorithms fall in local optimal during execution. More over these methods consumes more time for getting optimal solution especially for the more part assemblies. Keeping the above difficulties in mind, in this paper an Improved Cuckoo Search (ICS) algorithm is implemented to obtain the optimal solution. The proposed algorithm is compared by considering two assemblies (wall rack assembly and eccentric milling machine) with the algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO) algorithm and Hybrid Ant Wolf Algorithm (HAWA). The results of the different algorithms are compared in terms of number of iterations and fitness values with the proposed algorithm. The results show that the proposed algorithm performs better than the compared algorithms.
机译:制造新产品的需求每天都在增加,因此请牢记这一需求,已经开发了许多现代制造工艺来满足需求并及时提供产品。尽管已经开发出许多现代方法,但仍然缺乏时间来满足消费者的要求。这是由于组装,这需要20%的制造成本。为了进行有效的组装,需要最佳顺序。实现最佳组装顺序是一个困难的过程,因为它是非概率(NP)硬组合问题之一。实现有效的最佳装配顺序涉及多个目标函数,以开发适应度方程(方向变化次数,抓爪变化,装配时间等),从而将问题转换为离散的优化问题。在装配计划的开始阶段,研究人员实施了数学模型以实现可行的解决方案。对于大型零件装配,这些方法的性能非常差。同时,人工智能(AI)技术得到了发展,以解决装配顺序计划(ASP)问题。这些方法在解决ASP问题上的性能令人印象深刻,但是大多数算法在执行过程中处于局部最优状态。这些方法更多地花费了更多时间来获得最佳解决方案,尤其是对于更多零件装配而言。考虑到上述困难,本文采用改进的布谷鸟搜索(ICS)算法来获得最佳解决方案。通过考虑两个组件(壁架组件和偏心铣床)与遗传算法(GA),蚁群优化(ACO),灰狼优化(GWO),粒子群优化(PSO)算法和混合蚁狼算法(HAWA)。将不同算法的结果在迭代次数和适应性值方面与提出的算法进行了比较。结果表明,所提算法的性能优于比较算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号