A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem

被引:69
作者
Elloumi, Sonda [1 ]
Fortemps, Philippe [2 ]
机构
[1] Inst Super Gest Ind, Res Unit Logist Gest Ind & Qualite, Sfax, Tunisia
[2] Univ Mons, Fac Polytech, Serv Math & Rech Operat, B-7000 Mons, Belgium
关键词
Project scheduling; Resource-constrained; Multiple modes; Evolutionary algorithms; Bi-objective approach; Clustering; GENETIC ALGORITHM; MULTIPLE-MODES; RESTRICTIONS; HEURISTICS; SEARCH;
D O I
10.1016/j.ejor.2009.12.014
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:31 / 41
页数:11
相关论文
共 41 条
[1]   Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms [J].
Alcaraz, J ;
Maroto, C ;
Ruiz, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) :614-626
[2]  
Alcaraz J., 2004, Proceedings of the ninth international workshop on project management and scheduling, P40
[3]  
[Anonymous], 2003, P 3 INT WORKSH COMP
[4]  
[Anonymous], GENETIC ALGORITHMS
[5]   Heuristics for multimode scheduling problems with dedicated resources [J].
Bianco, L ;
Dell'Olmo, P ;
Speranza, MG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) :260-271
[6]   Resource-constrained project scheduling by simulated annealing [J].
Boctor, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (08) :2335-2351
[7]   A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes [J].
Boctor, FF .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) :349-361
[8]   HEURISTICS FOR SCHEDULING PROJECTS WITH RESOURCE RESTRICTIONS AND SEVERAL RESOURCE-DURATION MODES [J].
BOCTOR, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1993, 31 (11) :2547-2558
[9]   A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version [J].
Bouleimen, K ;
Lecocq, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :268-281
[10]  
COELLO CAC, 2002, BOOK SERIES GENETIC