.png){kind=icon}
返回
A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.12.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the multi-mode resource-constrained project scheduling problem (MRCPSP), where a task has different execution modes characterized by different resource requirements. Due to the nonrenewable resources and the Multiple modes, this problem is NP-hard: therefore, we implement an evolutionary algorithm looking for a feasible solution minimizing the makespan. In this paper, we propose and investigate two new ideas. On the one hand, we transform the problem of single objective MRCPSP to bi-objective one to cope with the potential violation of nonrenewable resource constraints. Relaxing the latter constraints allows to visit a larger solution set and thus to simplify the evolutionary operators. On the other hand, We build the fitness function not on a priori grid of the bi-objective space, but on an adaptive one relying on Clustering techniques. This proposed idea aims at more relevant fitness values. We show that a clustering-based fitness function can be an appealing feature in multi-objective evolutionary algorithms since it may promote diversity and avoid premature convergence of the algorithms. Clustering heuristics require certainly computation time, but they are still competitive with respect to Classical niche formation multi-objective genetic algorithm. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Project scheduling
Resource-constrained
Multiple modes
Evolutionary algorithms
Bi-objective approach
Clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
PREAI
分享收藏分享收藏分享收藏
查看更多内容