SciELO - Scientific Electronic Library Online

 
 issue56Analysis and convergence of weighted dimensionality reduction methods author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería Universidad de Antioquia

Print version ISSN 0120-6230On-line version ISSN 2422-2844

Abstract

RIVERA, Juan Carlos  and  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.

Keywords : Simulated Annealing; Heuristic Algorithms; Variable Neighborhoods Search (VNS); Justification; RCPSP; Scheduling.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License