A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem

•The multi-objective and multi-skilled MRCPSP is considered.•A parameters tuned invasive weeds optimization algorithm procedure is proposed.•The effectiveness of the proposed method is investigated based on 30 test problems. A new multi-skill multi-mode resource constrained project scheduling proble...

Full description

Saved in:
Bibliographic Details
Published inComputers & chemical engineering Vol. 88; pp. 157 - 169
Main Authors Maghsoudlou, Hamidreza, Afshar-Nadjafi, Behrouz, Niaki, Seyed Taghi Akhavan
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 08.05.2016
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:•The multi-objective and multi-skilled MRCPSP is considered.•A parameters tuned invasive weeds optimization algorithm procedure is proposed.•The effectiveness of the proposed method is investigated based on 30 test problems. A new multi-skill multi-mode resource constrained project scheduling problem with three objectives is studied in this paper. The objectives are: (1) minimizing project's makespan, (2) minimizing total cost of allocating workers to skills, and (3) maximizing total quality of processing activities. A meta-heuristic algorithm called multi-objective invasive weeds optimization algorithm (MOIWO) with a new chromosome structure guaranteeing feasibility of solutions is developed to solve the proposed problem. Two other meta-heuristic algorithms called non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization algorithm (MOPSO) are used to validate the solutions obtained by the developed MOIWO. The parameters of the developed algorithms are calibrated using Taguchi method. The results of the experiments show that the MOIWO algorithm has better performance in terms of diversification metric, the MOPSO algorithm has better performance regarding mean ideal distance, while NSGA-II algorithm has better performance in terms of spread of non-dominance solution and spacing metrics.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2016.02.018