Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 205, Issue 1, Pages 31-41Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2009.12.014
Keywords
Project scheduling; Resource-constrained; Multiple modes; Evolutionary algorithms; Bi-objective approach; Clustering
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available