A two-stage multi-operator differential evolution algorithm for solving Resource Constrained Project Scheduling problems

被引:38
作者
Sallam, Karam M. [1 ]
Chakrabortty, Ripon K. [1 ]
Ryan, Michael J. [1 ]
机构
[1] UNSW Canberra, Sch Engn & IT, Capabil Syst Ctr, ADFA, Canberra, ACT, Australia
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2020年 / 108卷
关键词
Evolutionary algorithms; Differential evolution; Adaptive operator selection; Resource constrained project scheduling problems; PARTICLE SWARM OPTIMIZATION; PROGRAMMING APPROACH; GENETIC ALGORITHM; SERIAL;
D O I
10.1016/j.future.2020.02.074
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The Resource Constrained Project Scheduling problem (RCPSP) is a complex and combinatorial optimization problem mostly relates with project management, construction industries, production planning and manufacturing domains. Although several solution methods have been proposed, no single method has been shown to be the best. Further, optimal solution of this type of problem requires different requirements of the exploration and exploitation at different stages of the optimization process. Considering these requirements, in this paper, a two-stage multi-operator differential evolution (DE) algorithm, called TS-MODE, has been developed to solve RCPSP. TS-MODE starts with the exploration stage, and based on the diversity of population and the quality of solutions, this approach dynamically place more importance on the most-suitable DE, and then repeats the same process during the exploitation phase. A complete evaluation of the components and parameters of the algorithms by a Design of Experiments technique is also presented. A number of single-mode RCPSP data sets from the project scheduling library (PSPLIB) have been considered to test the effectiveness and performance of the proposed TS-MODE against selected recent well-known state-of-the-art algorithms. Those results reveal the efficiency and competitiveness of the proposed TS-MODE approach. (C) 2020 Published by Elsevier B.V.
引用
收藏
页码:432 / 444
页数:13
相关论文
共 60 条
[1]   Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach [J].
Agarwal, A ;
Colak, S ;
Eryarsoy, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (03) :801-815
[2]   A Differential Evolution Algorithm for Solving Resource Constrained Project Scheduling Problems [J].
Ali, Ismail M. ;
Elsayed, Saber Mohammed ;
Ray, Tapabrata ;
Sarker, Ruhul A. .
ARTIFICIAL LIFE AND COMPUTATIONAL INTELLIGENCE, ACALCI 2016, 2016, 9592 :209-220
[3]  
Ali IM, 2015, IEEE C EVOL COMPUTAT, P2761, DOI 10.1109/CEC.2015.7257231
[4]  
[Anonymous], 1959, E JOINT IRE AIEE ACM, DOI [DOI 10.1109/AFIPS.1959.79, DOI 10.1145/1460299.1460318]
[5]  
[Anonymous], P 45 INT C COMP IND
[6]  
[Anonymous], GENETIC ALGORITHMS S
[7]  
[Anonymous], 2018, MATLAB 9 5 0 944444
[8]  
[Anonymous], WIREL PERS COMMUN
[9]  
[Anonymous], 2014, Differential Evolution: A Practical Approach to Global Optimization
[10]   An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem [J].
Arkhipov, Dmitry ;
Battaia, Olga ;
Lazarev, Alexander .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (01) :35-44