GRASP Applied to Multi-Skill Resource-Constrained Project Scheduling Problem

被引:13
|
作者
Myszkowski, Pawel B. [1 ]
Siemienski, Jedrzej J. [1 ]
机构
[1] Wroclaw Univ Technol, Dept Computat Intelligence, Wroclaw, Poland
来源
COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2016, PT I | 2016年 / 9875卷
关键词
SIMULATED ANNEALING ALGORITHM;
D O I
10.1007/978-3-319-45243-2_37
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The paper describes an application of Greedy Randomized Adaptive Search Procedure (GRASP) in solving Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP). Proposed work proposes a specific greedy-based local search and schedule constructor specialised to MS-RCPSP. The GRASP is presented as the better option to classical heuristic but also as a faster and successful alternative to another metaheuristic. To compare results of GRASP to others approaches, various methods are proposed: methods of constructing scheduling based on the greedy algorithm, randomized greedy approach, and HAntCO. The research was performed using all instances of benchmark iMOPSE dataset and the results compared to best-known methods.
引用
收藏
页码:402 / 411
页数:10
相关论文
empty
未找到相关数据