首页> 外文期刊>Engineering Computations >An improved immune clonal selection algorithm for bi-objective robotic assemble line balancing problems considering time and space constraints
【24h】

An improved immune clonal selection algorithm for bi-objective robotic assemble line balancing problems considering time and space constraints

机译:考虑时间和空间约束的双目标机器人装配线平衡问题的一种改进的免疫克隆选择算法

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

摘要

Purpose The extensive applications of the industrial robots have made the optimization of assembly lines more complicated. The purpose of this paper is to develop a balancing method of both workstation time and station area to improve the efficiency and productivity of the robotic assembly lines. A tradeoff was made between two conflicting objective functions, minimizing the number of workstations and minimizing the area of each workstation. Design/methodology/approach This research proposes an optimal method for balancing robotic assembly lines with space consideration and reducing robot changeover and area for tools and fixtures to further minimize assembly line area and cycle time. Due to the NP-hard nature of the considered problem, an improved multi-objective immune clonal selection algorithm is proposed to solve this constrained multi-objective optimization problem, and a special coding scheme is designed for the problem. To enhance the performance of the algorithm, several strategies including elite strategy and global search are introduced. Findings A set of instances of different problem scales are optimized and the results are compared with two other high-performing multi-objective algorithms to evaluate the efficiency and superiority of the proposed algorithm. It is found that the proposed method can efficiently solve the real-world size case of time and space robotic assembly line balancing problems. Originality/value For the first time in the robotic assembly line balancing problems, an assignment-based tool area and a sequence-based changeover time are took into consideration. Furthermore, a mathematical model with bi-objective functions of minimizing the number of workstations and area of each station was developed. To solve the proposed problem, an improved multi-objective immune clonal selection algorithm was proposed and a special coding scheme is designed.
机译:目的工业机器人的广泛应用使装配线的优化更加复杂。本文的目的是开发一种工作站时间和工作站面积的平衡方法,以提高机器人组装线的效率和生产率。在两个相互矛盾的目标功能之间进行了权衡,以最小化工作站的数量并最小化每个工作站的面积。设计/方法/方法这项研究提出了一种最佳方法,该方法可以在兼顾空间因素的情况下平衡机器人装配线,并减少机器人转换和工具和固定装置的面积,从而进一步最小化装配线面积和缩短周期。由于所考虑问题的NP难性,提出了一种改进的多目标免疫克隆选择算法来解决该约束多目标优化问题,并为此问题设计了一种特殊的编码方案。为了提高算法的性能,引入了包括精英策略和全局搜索在内的几种策略。结果优化了一组不同问题规模的实例,并将结果与​​其他两种高性能多目标算法进行了比较,以评估该算法的效率和优越性。发现所提出的方法可以有效解决时空机器人装配线平衡问题的实际情况。独创性/价值在机器人装配线平衡问题中,首次考虑了基于分配的工具区域和基于序列的转换时间。此外,建立了具有双目标功能的数学模型,该模型具有最小化工作站数量和每个工作站面积的双向目标。为了解决该问题,提出了一种改进的多目标免疫克隆选择算法,并设计了一种特殊的编码方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号