首页> 外文期刊>Electronics and communications in Japan >Solving Resource Constrained Multiple Project Scheduling Problems by Random Key-Based Genetic Algorithm
【24h】

Solving Resource Constrained Multiple Project Scheduling Problems by Random Key-Based Genetic Algorithm

机译:基于随机密钥的遗传算法求解资源受限的多项目调度问题

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

摘要

In this paper, we propose a hybrid genetic algorithm with fuzzy logic controller (flc-rkGA) to solve the resource-constrained multiple project scheduling problem (rc-mPSP) which is well known as an NP-hard problem and the objective in this paper is to minimize total complete time in the project. It is difficult to treat the rc-mPSP problems with traditional optimization techniques. The new approach proposed is based on the hybrid genetic algorithm (flc-rkGA) with fuzzy logic controller (FLC) and random-key encoding. For these rc-mPSP problems, we demonstrate that the proposed flc-rkGA to solve the rc-mPSP problem yields better results than several heuristic genetic algorithms presented in the computation result.
机译:本文提出了一种具有模糊逻辑控制器的混合遗传算法(flc-rkGA),以解决资源受限的多项目调度问题(rc-mPSP),该问题通常被称为NP-hard问题,并且其目标是是为了最大程度地减少项目中的总完成时间。用传统的优化技术很难解决rc-mPSP问题。提出的新方法基于具有模糊逻辑控制器(FLC)和随机密钥编码的混合遗传算法(flc-rkGA)。对于这些rc-mPSP问题,我们证明,与计算结果中提出的几种启发式遗传算法相比,提出的解决rc-mPSP问题的flc-rkGA产生了更好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号