Abstract

Several approaches based on Ant Colony Optimization (ACO) are developed to solve the Resource Constrained Project Scheduling Problem (RCPSP). Starting from two different proposals of the metaheuristic, four different algorithms adapted to the problem characteristics are designed and implemented. Finally the effectiveness of the algorithms are tested comparing its results with those previously found in the literature for a data set used as a the benchmark instance set for the problem.