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.
CITATION STYLE
Bautista, J., & Pereira, J. (2002). Ant colonies for the RCPS problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2504, pp. 257–268). Springer Verlag. https://doi.org/10.1007/3-540-36079-4_23
Mendeley helps you to discover research relevant for your work.