首页> 外文期刊>Journal of Advanced Manufacturing Systems >Low-Carbon Job Shop Scheduling Problem with Discrete Genetic-Grey Wolf Optimization Algorithm
【24h】

Low-Carbon Job Shop Scheduling Problem with Discrete Genetic-Grey Wolf Optimization Algorithm

机译:离散遗传灰狼优化算法的低碳作业商店调度问题

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

摘要

The workshop scheduling has historically emphasized the production metrics without involving any environmental considerations. Low-carbon scheduling has attracted the attention of many researchers after the promotion of green manufacturing. In this paper, we investigate the low-carbon scheduling problem in a job shop environment. A mathematical model is first established with the objective to minimize the sum of energy-consumption cost and completion-time cost. A discrete genetic-grey wolf optimization algorithm (DGGWO) is developed to solve the problem in this study. According to the characteristics of the problem, a job-based encoding method is first employed. Then a heuristic approach and the random generation rule are combined to fulfill the population initialization. Based on the original GWO, a discrete individual updating method the crossover operation of the genetic algorithm is adopted to make the algorithm directly work in a discrete domain. Meanwhile, a mutation operator is adopted to enhance the population diversity and avoid the algorithm from getting trapped into the local optima. In addition, a variable neighborhood search is embedded to further improve the search ability. Finally, extensive simulations are conducted based on 43 benchmark instances. The experimental data demonstrate that the proposed algorithm can yield better results than the other published algorithms.
机译:工作坊调度已经历史上强调了生产指标,而不涉及任何环境考虑因素。低碳调度在促进绿色制造后引起了许多研究人员的注意。在本文中,我们调查了职业店环境中的低碳调度问题。首先建立数学模型,目的是最小化能量消耗成本和完成时间成本的总和。开发了一种离散遗传 - 灰狼优化算法(DGGWO)以解决本研究中的问题。根据问题的特征,首先采用基于作业的编码方法。然后组合出启发式方法和随机生成规则以满足人口初始化。基于原始GWO,采用离散个体更新方法来采用遗传算法的交叉操作来使算法直接在离散域中工作。同时,采用突变运算符来增强群体多样性,避免算法被困到本地最佳时。此外,嵌入可变邻域搜索以进一步提高搜索能力。最后,基于43个基准实例进行了广泛的模拟。实验数据表明,所提出的算法可以产生比其他公开的算法更好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号