Ant colonies for the RCPS problem

Joaquín Bautista, Jordi Pereira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


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.

Original languageEnglish
Title of host publicationTopics in Artificial Intelligence - 5th Catalonian Conference on AI, CCIA 2002, Proceedings
EditorsM. Teresa Escrig, Francisco Toledo, Elisabet Golobardes
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)3540000119, 9783540000112
StatePublished - 2002
Externally publishedYes
Event5th Catalonian Conference on Artificial Intelligence, CCIA 2002 - Castellon, Spain
Duration: 24 Oct 200225 Oct 2002

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
ISSN (Print)0302-9743


Conference5th Catalonian Conference on Artificial Intelligence, CCIA 2002


Dive into the research topics of 'Ant colonies for the RCPS problem'. Together they form a unique fingerprint.

Cite this