.png){kind=icon}
返回
Improved genetic algorithm based on time windows decomposition for solving resource-constrained project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.autcon.2022.104503.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The resource-constrained project scheduling problem (RCPSP) is one of the project scheduling problems which are widely used in construction and many industrial disciplines. The challenge of the problem is to design some appropriate search mechanism for finding solutions in feasible space. An improved genetic algorithm based on time window decomposition is proposed in this paper. Three derivation methods are applied to increase population diversity. The sampling count allocation strategy and the use of destructive lower bounds improve the search efficiency. The computational experiments on PSPLIB show that the proposed approach is more effective than that only using the decomposition mechanism and is competitive in solving two real-life cases. This research illustrates that continuously changing the search subspaces has potential advantages, which may be useful for studying RCPSP using other evolutionary algorithms in future. Some other better results may be obtained by using machine learning methods to flexibly determine the sampling times for each individual.
Keyword:
Project scheduling
Resource constrained
Decomposition-based approach
Genetic algorithm
Extended serial scheduling scheme
期刊
IF:
11.5
论文数:
6.3K
被引数:
4.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs具有替代子图的资源受限项目调度问题的禁忌搜索程序
OAAI
OAAI分享收藏
查看更多内容