Serviços Personalizados
Journal
Artigo
Indicadores
- Citado por SciELO
- Acessos
Links relacionados
- Citado por Google
- Similares em SciELO
- Similares em Google
Compartilhar
Revista Facultad de Ingeniería Universidad de Antioquia
versão impressa ISSN 0120-6230versão On-line ISSN 2422-2844
Resumo
RIVERA, Juan Carlos e CELIN, Ana Josefina. Hybrid Variable Neighborhood and Simulated Annealing Heuristic Algorithm to Solve RCPSP. Rev.fac.ing.univ. Antioquia [online]. 2010, n.56, pp.255-267. ISSN 0120-6230.
This paper presents a hybrid heuristic algorithm for solving the Resource Constrained Project Scheduling Problem (RCPSP). The algorithm designed combines elements of Simulated Annealing and Variable Neighborhood Search. Additionally, it uses the method called Justification, which is a method designed specifically for the RCPSP. To evaluate the performance of the algorithm, a statistical analysis for tuning the parameters has done. The results were compared with those reported in the scientific literature.
Palavras-chave : Simulated Annealing; Heuristic Algorithms; Variable Neighborhoods Search (VNS); Justification; RCPSP; Scheduling.