绿色混合流水车间机器与AGV联合调度研究
作者:
作者单位:

上海理工大学

作者简介:

通讯作者:

中图分类号:

TP18

基金项目:

国家自然科学基金项目(面上项目,重点项目,重大项目)


Research on joint scheduling of machines and AGVs in green hybrid flow shop
Author:
Affiliation:

University of Shanghai for Science and Technology

Fund Project:

The National Natural Science Foundation of China (General Program, Key Program, Major Research Plan)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对带工序跳跃的绿色混合流水车间机器和AGV(Automated Guided Vehicle)联合调度问题,以最小化最大完工时间和总能耗为目标建立集成调度模型.根据问题的特性,提出了改进Memetic Algorithm (MA) 算法求解该问题.首先,设计了基于工序,机器和转速的三层编码策略,最大程度保证了算法在整个解空间中搜索;然后,设计了混合种群初始化方法以提高初始种群解的质量;同时,设计了交叉和变异算子以及两种基于问题的邻域搜索策略以平衡算法的全局搜索和局部搜索能力.最后,通过大量仿真实验验证了MA算法求解该问题的有效性和优越性.

    Abstract:

    For the joint scheduling of machines and AGVs in green hybrid flow shop problem with missing operations, an integrated scheduling model is established to minimize both the maximum completion time and the total energy consumption, simultaneously. Firstly, a three-layer encoding method based on operations, machines and speeds is designed to ensure the search of the algorithm in the whole solution space to the greatest extent. Then, a hybrid population initialization method is designed to improve the quality of initial population solution. Meanwhile, the crossover, mutation operators and two kinds of neighbourhood search strategies based on the problem are designed to balance the global and local search ability of the algorithm. Finally, simulation experiments show the superiority of the proposed algorithm in solving the joint scheduling of machines and AGVs in green hybrid flow shop problem with missing operations.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2021-02-24
  • 最后修改日期:2021-06-17
  • 录用日期:2021-07-05
  • 在线发布日期: 2021-08-01
  • 出版日期: