Paper Info
Title
Ant Colonies for the RCPS Problem
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.
Year
DOI
Venue
2002
10.1007/3-540-36079-4_23
CCIA
Keywords
Field
DocType
ant colony optimization,different algorithm,benchmark instance,different proposal,ant colonies,resource constrained project scheduling,problem characteristic,rcps problem,ant colony
Ant colony optimization algorithms,Project scheduling problem,Mathematical optimization,Schedule (project management),Parallel metaheuristic,Computer science,Scheduling (computing),Artificial intelligence,Ant colony,Hybrid system,Metaheuristic
Conference
Volume
ISSN
ISBN
2504
0302-9743
3-540-00011-9
Citations 
PageRank 
References 
3
0.43
5
Authors
2
Name
Order
Citations
PageRank
Joaquín Bautista134527.50
Jordi Pereira225219.64