Show simple item record

dc.contributor.authorGonzalez-Pardo, A.
dc.contributor.authorDel Ser, J. 
dc.contributor.authorCamacho, D.
dc.description.abstractConstraint Satisfaction Problems (CSP) belongs to this kind of traditional NP-hard problems with a high impact in both, research and industrial domains. However, due to the complexity that CSP problems exhibit, researchers are forced to use heuristic algorithms for solving the problems in a reasonable time. One of the most famous heuristic al- gorithms is Ant Colony Optimization (ACO) algorithm. The possible utilization of ACO algorithms to solve CSP problems requires the de- sign of a decision graph where the ACO is executed. Nevertheless, the classical approaches build a graph where the nodes represent the vari- able/value pairs and the edges connect those nodes whose variables are different. In order to solve this problem, a novel ACO model have been recently designed. The goal of this paper is to analyze the performance of this novelty algorithm when solving Multi-Mode Resource-Constraint Satisfaction Problems. Experimental results reveals that the new ACO model provides competitive results whereas the number of pheromones created in the system is drastically reduced.en_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.subjectAnt Colony Optimizationen_US
dc.subjectOblivion Rateen_US
dc.subjectResource-Constraint Project Scheduling Problemsen_US
dc.subjectPheromone Controlen_US
dc.titleQuantitative Analysis and Performance Study of Ant Colony Optimization Models Applied to Multi-Mode Resource Constraint Project Scheduling Problemen_US
dc.journal.titleFuture Generation Computer Systemsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España