Dp 508 en

Z DCEwiki
Verze z 20. 8. 2014, 12:46, kterou vytvořil Sturcmar (diskuse | příspěvky) (Kategorizace anotací.)
(rozdíl) ← Starší verze | zobrazit aktuální verzi (rozdíl) | Novější verze → (rozdíl)
Skočit na navigaci Skočit na vyhledávání

Algorithms for the efficient solution space search in the Nurse Rostering Problems

Author: Jakub Levý

Diplomové práce 2013

Download thesis in PDF

The aim of this diploma thesis is the proposal of solution for nurse scheduling problem, which will be applicable on the instances with various parameters. Tabu-Search hyperheuristic was used after studying existing possibilities. It uses low-level heuristics which are based on the shift balancing. Considering the hyperheuristic drawbacks the new modified algorithm was designed in this thesis. The adjustments which are based on integrating of the neural network to manage steps of algorithm were done as a substitution of the Tabu-Search method. Finally, these three versions of the algorithm were compared on the set of testing data provided by the science group from Nottingham University.


Dp 2013 levy jakub.pdf