Using Firefly Algorithm to Solve Resource Constrained Project Scheduling Problem

Abstract

The Firefly Algorithm (FA) is among the most recently introduced meta-heuristics. This work aims at study the application of FA algorithm to solve the Resource Constrained Project Scheduling Problem (RCPSP). The algorithm starts by generating a set of random schedules. After that, the initial schedules are improved iteratively using the flying approach proposed by the FA. By termination of algorithm, the best schedule found by the method is returned as the final result. The results of the state-of-art algorithms are used in this work in order to evaluate the performance of the proposed method. The comparison study shows the efficiency of the proposed method in solving RCPSP. The proposed method has competitive performance compared to the other RCPSP solvers.