Dp 508 en
Algorithms for the efficient solution space search in the Nurse Rostering Problems
Author: Jakub Levý
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.
- Levý Jakub, mailto:firstname.lastname@example.org