首页> 外文期刊>Procedia CIRP >Many-objective best-order-sort genetic algorithm for mixed-model multi-robotic disassembly line balancing
【24h】

Many-objective best-order-sort genetic algorithm for mixed-model multi-robotic disassembly line balancing

机译:混合模型多机器人拆卸线平衡的多目标最优排序遗传算法

获取原文
           

摘要

Disassembly is a crucial step of the end-of-life product recovery with growing environmental concerns. Improving the disassembly process helps to raise the resource utilization rate and to reduce the environmental pollution. Robotic disassembly line is considered to be one of the most efficient and eco-friendly disassembly systems. In this article, the mixed-model multi-robotic disassembly line balancing problem is addressed with the objectives of optimizing the number of robots, number of workstations, total load density, hazardous task cost, and CO2 saving rate. A mathematical programming formulation is proposed to represent the problem based on the transformed AND/OR graph of product. Since the addressed problem is NP-hard, a many-objective best-order-sort genetic algorithm, including a particular encoding/decoding procedure, two genetic operators, a neighborhood search operator, and the best-order-sort mechanism, has been developed. The performance of the proposed algorithm is compared with three state-of-the-art evolutionary algorithms. Computational results show that the proposed algorithm can be considered as an efficient solution method for solving this problem.
机译:随着对环境问题的日益关注,拆卸是产品报废的关键一步。改进拆卸过程有助于提高资源利用率,减少环境污染。机器人拆卸线被认为是最高效,最环保的拆卸系统之一。本文以优化机器人数量,工作站数量,总负载密度,危险任务成本和二氧化碳节省率为目标,解决了混合模型多机器人分解线平衡问题。提出了一种数学编程公式来表示基于转换后的产品AND / OR图的问题。由于解决的问题是NP难题,因此已经开发了一种多目标的最佳排序遗传算法,包括特定的编码/解码过程,两个遗传算子,一个邻域搜索算子以及最佳排序机制。 。将该算法的性能与三种最新的进化算法进行了比较。计算结果表明,该算法可作为解决该问题的有效方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号