.png){kind=icon}
返回
An Immune Genetic Algorithm for Solving NPV-Based Resource Constrained Project Scheduling Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3057366.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The net present value (NPV)-based resource constrained project scheduling problem (RCPSP) is a well-known scheduling problem in many industries, such as construction, software development, and manufacturing. Over the last five decades, although different approaches have been proposed to solve the problem, no single approach has been shown to achieve satisfactory performances with quality solutions for a wide range of problems. This study presents a hybrid immune genetic algorithm (IGA) to solve NPV-based RCPSPs. Hybridizing a genetic algorithm (GA) with an immune algorithm (IA) enhances the overall performance of their standalone components (i.e., only GA or IA). Performance of the proposed IGA is further improved by applying a variable insertion based local search (VINS) and forward-backward improvement (FBI). A restart mechanism is presented to the algorithm which induces diversity and helps to avoid becoming trapped in local optima. Moreover, an activity move rule (AMR) is implemented to shift the negative cash flow associated activities to further improve the NPV. Taguchi Design of Experiment (DOE) is conducted to investigate the impact of various parameters and to determine the appropriate set of parameters for the proposed IGA. The performances of the proposed algorithms are tested on 17,280 standard benchmark instances ranging from 25 to 100 activities. Comparison with the state-of-art algorithms through extensive numerical experiments reveal the effectiveness of the proposed algorithms. Overall, the proposed algorithm outperforms existing algorithms, particularly the projects with 0% and 100% negative cash flow associated activities, the 75-activity instances, and the projects with two resources usage in terms of a lower value of average percentage deviation.
Keyword:
Genetic algorithms
Heuristic algorithms
Approximation algorithms
Approximation methods
Convergence
Benchmark testing
Task analysis
Net present value
resource constrained project scheduling
RCPSPDC
immune genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏
查看更多内容