• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Mechanical, Material Engineering >Solving Two–sided Assembly Line Balancing Problem via Gravitational Search Algorithm
【24h】

Solving Two–sided Assembly Line Balancing Problem via Gravitational Search Algorithm

机译：通过引力搜索算法解决双面装配线平衡问题

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Two-sided assembly lines are widely applied in plants for producing large-sized high volume products, such as trucks and buses. Since the two-sided assembly line balancing problem (TALBP) is NP-hard, it is difficult to get an optimal solution in polynomial time. Therefore, a novel swarm based heuristic algorithm named gravitational search algorithm (GSA) is proposed to solve this problem with the objective of minimizing the number of mated-stations and the number of stations simultaneously. In order to apply GSA to solving the TALBP, an encoding scheme based on the random-keys method is used to convert the continuous positions of the GSA into the discrete task sequence. In addition, a new decoding scheme is implemented to decrease the idle time related to sequence-dependent finish time of tasks. The corresponding experiment results demonstrate that the proposed algorithm outperforms other well-known algorithms.
机译：双面装配线广泛应用于生产大型大批量产品的植物中，例如卡车和公共汽车。由于双面装配线平衡问题（TALBP）是NP - 硬，因此很难在多项式时间中获得最佳解决方案。因此，提出了一种名为Gravitational搜索算法（GSA）的新型基于群的启发式算法来解决这个问题，目的是最小化交配站的数量和站点的数量。为了应用GSA来解决TALBP，基于随机键方法的编码方案用于将GSA的连续位置转换为离散任务序列。另外，实现了一种新的解码方案以减少与序列相关的任务的序列完成时间相关的空闲时间。相应的实验结果表明，所提出的算法优于其他众所周知的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号