首页> 外文期刊>Applied Soft Computing >Hybrid Differential Evolution and Greedy Algorithm (DEGR) for solving Multi-Skill Resource-Constrained Project Scheduling Problem
【24h】

Hybrid Differential Evolution and Greedy Algorithm (DEGR) for solving Multi-Skill Resource-Constrained Project Scheduling Problem

机译:用于解决多技能资源约束项目调度问题的混合差分演进和贪婪算法(DEGR)

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

摘要

Paper presents a hybrid Differential Evolution and Greedy Algorithm (DEGR) applied to solve Multi-Skill Resource-Constrained Project Scheduling Problem. The specialized indirect representation and transformation of solution space from discrete (typical for this problem), to continuous (typical for DE-approaches) are proposed and examined. Furthermore, Taguchi Design of Experiments method has been used to adjust parameters for investigated method to reduce the procedure of experiments. Finally, various initialisation, clone elimination, mutation and crossover operators have been applied there. The results have been compared with the results from other reference methods (HantCO, GRASP and multiStart Greedy) using the benchmark iMOPSE dataset. This comparison shows that DEGR effort is very robust and effective. For 28 instances of iMOPSE dataset DEGR has achieved the best-known solutions. (C) 2017 Elsevier B.V. All rights reserved.
机译:纸张介绍了应用于解决多技能资源约束项目调度问题的混合差分演进和贪婪算法(Dol)。 提出并检查了来自离散(典型的解决方案)的专门间接表示和转换,从离散(典型的解决方案),并进行了连续的(典型的去方法)。 此外,实验方法的Taguchi设计已被用于调整研究方法的参数,以减少实验程序。 最后,在那里应用了各种初始化,克隆消除,突变和交叉运算符。 使用基准iMopse数据集将结果与来自其他参考方法(Hantco,Grasp和MultiStart Greey)的结果进行了比较。 这种比较表明,降解努力是非常稳健和有效的。 对于28个IMOPSE数据集DEL,已经实现了最着名的解决方案。 (c)2017 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号