Search
Now showing items 1-2 of 2
Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
Gonzalez-Pardo, A.; Del Ser, J.
; Camacho, D. (2017-11)
; Camacho, D. (2017-11)
Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and industrial domains. The goal of these problems is to find a feasible assignment for a group ...
Quantitative Analysis and Performance Study of Ant Colony Optimization Models Applied to Multi-Mode Resource Constraint Project Scheduling Problem
Gonzalez-Pardo, A.; Del Ser, J.; Camacho, D. (2017)
; Camacho, D. (2017)
Constraint 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 ...