Multi‐start iterated local search metaheuristic for the multi‐mode resource‐constrained project scheduling problem

Abstract

AbstractIn this paper a multi‐start iterated local search (MS‐ILS) algorithm is presented as a new and effective approach to solve the multi‐mode resource‐constrained project scheduling problem (MRCPSP). The MRCPSP is a well‐known project scheduling NP‐Hard optimization problem, in which there is a trade‐off between the duration of each project activity and the amount of resources they require to be completed. The proposed algorithm generates an initial solution, performs a local search to obtain a local optimum, subsequently, for a certain number of iterations, makes a perturbation to that local optimum and performs a new local search on the perturbed solution. This whole process then restarts with a different initial solution for a certain number of restarts. The algorithm was tested on benchmark instances of projects with 30, 50 and 100 activities from well‐known libraries. The obtained results were compared to recent benchmark results from the literature. The proposed algorithm outperforms other solution methods found in related literature for the largest tested instances (100 activities), while for smaller instances it shows to be quite competitive, in terms of the average deviation against known lower bounds.