首页> 外文期刊>Journal of Industrial Engineering International >A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
【24h】

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

机译:缓解串联自动导引车系统划分问题的新模因算法

获取原文
       

摘要

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Algorithm (MA) for optimizing partitioning problem of tandem AGVS. MAs employ a Genetic Algorithm (GA), as a global search, and apply a local search to bring the solutions to a local optimum point. A new Tabu Search (TS) has been developed and combined with a GA to refine the newly generated individuals by GA. The aim of the proposed algorithm is to minimize the maximum workload of the system. After all, the performance of the proposed algorithm is evaluated using Matlab. This study also compared the objective function of the proposed MA with GA. The results showed that the TS, as a local search, significantly improves the objective function of the GA for different system sizes with large and small numbers of zone by 1.26 in average.
机译:自动导引车系统(AGVS)提供了灵活制造系统(FMS)所需的灵活性和自动化。但是,随着对资源使用负责任管理的关注日益增加,以有效的方式管理这些车辆至关重要,以便减少行驶时间并控制冲突和拥堵。本文介绍了一种用于优化串联AGVS分区问题的新Memetic算法(MA)的开发过程。 MA使用遗传算法(GA)作为全局搜索,并应用局部搜索将解决方案带到局部最优点。已开发出新的禁忌搜索(TS),并将其与GA结合使用,以优化GA生成的新个体。所提出的算法的目的是最小化系统的最大工作量。毕竟,使用Matlab评估了所提出算法的性能。这项研究还比较了提出的MA和GA的目标函数。结果表明,作为局部搜索,TS显着提高了GA的目标功能,该功能对于具有大小区域的不同系统大小平均降低了1.26。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号