Hybrid Variable Neighborhood and Simulated Annealing Heuristic Algorithm to Solve RCPSP

Hybrid Variable Neighborhood and Simulated Annealing Heuristic Algorithm to Solve RCPSP

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 design...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy: Juan Carlos Rivera, Ana Josefina Celín
Format: Artykuł
Język:English
Wydane: Universidad de Antioquia 2013-02-01
Seria:Revista Facultad de Ingeniería Universidad de Antioquia
Hasła przedmiotowe:
simulated annealing
heuristic algorithms
variable neighborhoods search (VNS)
justification
RCPSP
scheduling
Dostęp online:https://revistas.udea.edu.co/index.php/ingenieria/article/view/14675

Internet

https://revistas.udea.edu.co/index.php/ingenieria/article/view/14675

Podobne zapisy